3319 search results - page 647 / 664 » The topology of dark networks |
SIGCOMM
2000
ACM
14 years 3 months ago
2000
ACM
This paper examines the latency in Internet path failure, failover and repair due to the convergence properties of interdomain routing. Unlike switches in the public telephony net...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
SIGCOMM
1998
ACM
14 years 3 months ago
1998
ACM
Recent studies provide evidence that Quality ofService QoS routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of tra...
ICALP
1998
Springer
14 years 3 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
ICDCS
2010
IEEE
14 years 2 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...