945 search results - page 147 / 189 » On Equivalence Between Network Topologies |
CONEXT
2008
ACM
13 years 9 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
CCR
2008
13 years 7 months ago
2008
In this paper we present Cyclops, a system that collects and displays information of AS-level connectivity extracted from looking glasses, route-servers and BGP tables and updates...
JSAC
2008
13 years 7 months ago
2008
This paper addresses the multiplexing loss that occurs in relay networks due to causality of relays and the halfduplex constraint. We devise relay selection methods to recover the ...
ICNP
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...