File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Echelon: Peer-to-peer network diagnosis with network coding

TitleEchelon: Peer-to-peer network diagnosis with network coding
Authors
KeywordsComputer Simulation
Distributed Computer Systems
Encoding (Symbols)
Measurement Theory
Network Protocols
Random Processes
Issue Date2006
Citation
Ieee International Workshop On Quality Of Service, Iwqos, 2006, p. 20-29 How to Cite?
AbstractIt is critical to monitor the performance and " health" of large-scale peer-to-peer applications. As an example, operators of peer-to-peer live streaming applications may be interested in observing performance bottlenecks, peer failures, and network topologies. In most cases, such observations are used to diagnose potential problems in the protocol design, to troubleshoot network outage, or to improve the Quality of Service of the peer-to-peer network in general. They are not time sensitive in nature, as delayed observations up to minutes or even hours are still valuable. However, such historical and delay-tolerant observations should include measurements of peers that have already failed or departed, as peer dynamics significantly affect the health of peer-to-peer applications. Such a delay-tolerant observation of peer-to-peer applications over a historical period of time is referred to as a diagnosis. In this paper, we present Echelon, a time-insensitive way to construct the diagnosis of a large-scale peer-to-peer application. Replacing the traditional wisdom of logging servers, we leverage the power of network coding to collect application-specific measurements on each peer, and disseminate them to other peers in a coded form. Over time, measurements of departed peers can still be recovered, simply by probing a small subset of peers in the network. Simulation studies have shown that Echelon is highly configurable, bandwidth efficient, and extremely tolerant of peer dynamics, thanks to the advantages of randomized network coding. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/92636
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Cen_HK
dc.contributor.authorLi, Ben_HK
dc.date.accessioned2010-09-17T10:52:37Z-
dc.date.available2010-09-17T10:52:37Z-
dc.date.issued2006en_HK
dc.identifier.citationIeee International Workshop On Quality Of Service, Iwqos, 2006, p. 20-29en_HK
dc.identifier.issn1548-615Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/92636-
dc.description.abstractIt is critical to monitor the performance and " health" of large-scale peer-to-peer applications. As an example, operators of peer-to-peer live streaming applications may be interested in observing performance bottlenecks, peer failures, and network topologies. In most cases, such observations are used to diagnose potential problems in the protocol design, to troubleshoot network outage, or to improve the Quality of Service of the peer-to-peer network in general. They are not time sensitive in nature, as delayed observations up to minutes or even hours are still valuable. However, such historical and delay-tolerant observations should include measurements of peers that have already failed or departed, as peer dynamics significantly affect the health of peer-to-peer applications. Such a delay-tolerant observation of peer-to-peer applications over a historical period of time is referred to as a diagnosis. In this paper, we present Echelon, a time-insensitive way to construct the diagnosis of a large-scale peer-to-peer application. Replacing the traditional wisdom of logging servers, we leverage the power of network coding to collect application-specific measurements on each peer, and disseminate them to other peers in a coded form. Over time, measurements of departed peers can still be recovered, simply by probing a small subset of peers in the network. Simulation studies have shown that Echelon is highly configurable, bandwidth efficient, and extremely tolerant of peer dynamics, thanks to the advantages of randomized network coding. © 2006 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofIEEE International Workshop on Quality of Service, IWQoSen_HK
dc.subjectComputer Simulationen_HK
dc.subjectDistributed Computer Systemsen_HK
dc.subjectEncoding (Symbols)en_HK
dc.subjectMeasurement Theoryen_HK
dc.subjectNetwork Protocolsen_HK
dc.subjectRandom Processesen_HK
dc.titleEchelon: Peer-to-peer network diagnosis with network codingen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailWu, C:cwu@cs.hku.hken_HK
dc.identifier.authorityWu, C=rp01397en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/IWQOS.2006.250447en_HK
dc.identifier.scopuseid_2-s2.0-34250660405en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-34250660405&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage20en_HK
dc.identifier.epage29en_HK
dc.identifier.scopusauthoridWu, C=15836048100en_HK
dc.identifier.scopusauthoridLi, B=35248588700en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats