258 search results - page 46 / 52 » Non-cooperative routing in loss networks |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
INFOCOM
2002
IEEE
14 years 17 days ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Verifying the accuracy of a passive measurementsbased inference technique under all possible network scenarios is a difficult challenge - the measurement point has lim...
ICNP
2003
IEEE
14 years 28 days ago
2003
IEEE
Several recent proposals for sharing congestion information across concurrent flows between end-systems overlook an important problem: two or more flows sharing congestion state...
ICNP
2003
IEEE
14 years 28 days ago
2003
IEEE
TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no...