Sciweavers

2063 search results - page 54 / 413
» connection 2007
Sort
View
MASCOTS
2004
15 years 4 days ago
Modeling the Burstiness of TCP
In this paper we investigate the burstiness of the Transmission Control Protocol (TCP) and its impact on a network of finite TCP connections. A detailed TCP and network model is d...
Peter Dimopoulos, Panlop Zeephongsekul, Zahir Tari
ARSCOM
2004
86views more  ARSCOM 2004»
14 years 10 months ago
New Conditions for k-ordered Hamiltonian Graphs
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
Guantao Chen, Ronald J. Gould, Florian Pfender
JNW
2007
104views more  JNW 2007»
14 years 10 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad
CCCG
2007
15 years 6 days ago
The Ordinary Line Problem Revisited
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
Asish Mukhopadhyay, Eugene Greene
ICNP
2007
IEEE
15 years 5 months ago
A Performance Study of Loss Detection/Recovery in Real-world TCP Implementations
— TCP is the dominant transport protocol used in the Internet and its performance fundamentally governs the performance of Internet applications. It is well-known that packet los...
Sushant Rewaskar, Jasleen Kaur, F. Donelson Smith