S. Jain, R.Mahajan, D.Wetherall, G.Borriello, and S.D. Gribble. Scalable Self-Organizing Overlays. Technical report UW-CSE 02-02-02, University of Washington, February 2002.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....thea protocols impose rule onnefi5 bor re 5xDP1x ; that are dictate by addrefiP1 assigne to hosts rathe than pe5 x9P1xF This may involve a pexHDfiP1xD pefi 9 y inconstructe ove rlays and could complicate defiDFx with dynamic memicP such as available bandwidth. The Nice proje; 1] and Kudos [12] achie e bex59 scaling propeopPD than Narada by organizing me be rs intohie5 F hie of clusteP1 Kudos constructs a twole e hieF 9 hy with a Narada like protocol ate achle e ofthe hie;9 hy. 1] constructs a multi le e hie le hy, and doe s not involve use of a traditional routing protocol. A conce ....

S. Jain, R.Mahajan, D.Wetherall, G.Borriello, and S.D. Gribble. Scalable Self-Organizing Overlays. Technicalrep ort UW-CSE 02-02-02, University of Washington, February 2002.

....focuses on multi sender multi receiver streaming applications, maintains a mesh among the peers, and establishes a tree whenever a sender wants to transmit a content to a set of receivers. Narada only emphasizes on small P2P networks. Its extension to work with large scale networks was proposed in [17] using a two layer hierarchical topology. To better reduce cluster size, whereby reducing the control overhead at a peer, the scheme NICE in [3] focuses on large P2P networks by using the multi layer hierarchical clustering idea as we do. However, NICE always uses the head to forward the content ....

S. Jain, R. Mahajan, D. Wetherall, and G. Borriello, "Scalable self-organizing overlays," Tech. Rep., Wash- ington University, 2000.

....the content directly from the source and the others get it from the receivers in the upstream. P2P consumes the source s bandwidth efficiently by capitalizing a receiver s bandwidth to provide services to other receivers. More recent P2P streaming techniques were introduced in [3] 5 7] 15] [16]. We will discuss them in Section IV. The following issues are important in designing an efficient P2P technique: The end to end delay from the source to a receiver may be excessive because the content may have to go through a number of intermediate receivers. To shorten this delay (whereby, ....

....focuses on multi sender multi receiver streaming applications, maintains a mesh among the peers, and establishes a tree whenever a sender wants to transmit a content to a set of receivers. Narada only emphasizes on small P2P networks. Its extension to work with large scale networks was proposed in [16] using a two layer hierarchical topology. To better reduce cluster size, whereby reducing the control overhead at a peer, the scheme NICE in [5] focuses on large P2P networks by using the multi layer hierarchical clustering idea as we do. However, NICE always uses the head to forward the content ....

S. Jain, R. Mahajan, D. Wetherall, and G. Borriello, "Scalable selforganizing overlays," Tech. Rep., University of Washington, 2000.

....for building the overlay topology can reduce link stress. Range Multicast can employ such a technique, and, by having an eitlcient caching and delivery strategy atop the overlay topology, significantly save the server bandwidth. Since link stress was already studied in many overlay works such as [25, 11, 24, 29], we opted to report the results on server bandwidth only. It is our conviction that despite recent advances in network bandwidth technologies, that can handle increases in network trafiqc incurred by our scheme, server bottleneck remains a severe problem in most large scale VOD systems nowadays. ....

S. Jain, R. Mahajan, D. Wetherall, and G. Borriello. Scalable self-organizing overlays. Technical report, University of Washington, 2000.

....focuses on multi sender multi receiver streaming applications, maintains a mesh among the peers, and establishes a tree whenever a sender wants to transmit a content to a set of receivers. Narada only emphasizes on small P2P networks. Its extension to work with large scale networks was proposed in [9] using a two layer hierarchical topology. To better reduce cluster size, whereby reducing the control overhead at a peer, the scheme NICE in [2] focuses on large P2P networks by using the multi layer hierarchical clustering idea as we do. However, NICE always uses the head to forward the content ....

S. Jain, R. Mahajan, D. Wetherall, and G. Borriello. Scalable selforganizing overlays. Technical report, Washington University, 2000.

....focuses on multi sender multi receiver streaming applications, maintains a mesh among the peers, and establishes a tree whenever a sender wants to transmit a content to a set of receivers. Narada only emphasizes on small P2P networks. Its extension to work with large scale networks was proposed in [14] using a two layer hierarchical topology. To better reduce cluster size, whereby reducing the control overhead at a peer, the scheme SMOP in [5] focuses on large P2P networks by using the multi layer hierarchical clustering idea as we do. However, SMOP always uses the head to forward the content ....

S. Jain, R. Mahajan, D. Wetherall, and G. Borriello, "Scalable self-organizing overlays," Tech. Rep., Washington University, 2000.

....bring DHT performance at par with NICE. We also report on performance of overlays with power law structure and the impact of hierarchy on performance. 1 Introduction Overlays have become the preferred vehicle for providing new Internet services, e.g. CDNs [1, 12] application level multicast [15, 4, 17, 16, 20, 25, 7, 39, 20, 34], and P2P le sharing [18, 13, 10, 22, 11] As such, overlay construction protocols that provide good levels of performance, scalability, and robustness are of considerable importance. There has been a surge of interest in the area, along with rapid advances that have led to two main approaches to ....

....hash tables (DHTs) Measurement based protocols use estimates of network properties such as latency between overlay nodes to make an informed choice of overlay structure. They were initially motivated by applicationlevel multicast. Examples include Narada [15] RON [2] NICE [4] Kudos [16] and TAG [20] These algorithms provide good performance via high quality paths. Recent extensions have allowed them to scale up to tens of thousands of nodes by using hierarchy [4, 19] On the other hand, DHT based protocols begin with structure in mind, and may fold measurement information into ....

[Article contains additional citation context not shown here]

S. Jain, R. Mahajan, D. Wetherall, and G. Borriello. Scalable self organizing overlays. Tech. Rep. UW-CSE 02-06-04, University of Washington, 2002.

No context found.

S. Jain, R.Mahajan, D.Wetherall, G.Borriello, and S.D. Gribble. Scalable Self-Organizing Overlays. Technical report UW-CSE 02-02-02, University of Washington, February 2002.

No context found.

S. Jain, R. Mahajan, D. Wetherall, and G. Borriello. Scalable self-organizing overlays. Technical Report UW-CSE 02-02-02, University of Washington, 2002.

No context found.

S. Jain, R.Mahajan, D.Wetherall, G.Borriello, and S.D. Gribble. Scalable Self-Organizing Overlays. Technical report UW-CSE 02-02-02, University of Washington, February 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC