Sciweavers

3686 search results - page 575 / 738
» Performing work in broadcast networks
Sort
View
CCR
2004
91views more  CCR 2004»
15 years 6 months ago
New techniques for making transport protocols robust to corruption-based loss
Current congestion control algorithms treat packet loss as an indication of network congestion, under the assumption that most losses are caused by router queues overflowing. In r...
Wesley M. Eddy, Shawn Ostermann, Mark Allman
CCR
2002
86views more  CCR 2002»
15 years 6 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
IFE
2007
77views more  IFE 2007»
15 years 6 months ago
Drawing Subway Maps: A Survey
Abstract This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such...
Alexander Wolff
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
MOBICOM
2012
ACM
13 years 9 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...