File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/IWQOS.2006.250447
- Scopus: eid_2-s2.0-34250660405
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Echelon: Peer-to-peer network diagnosis with network coding
Title | Echelon: Peer-to-peer network diagnosis with network coding |
---|---|
Authors | |
Keywords | Computer Simulation Distributed Computer Systems Encoding (Symbols) Measurement Theory Network Protocols Random Processes |
Issue Date | 2006 |
Citation | Ieee International Workshop On Quality Of Service, Iwqos, 2006, p. 20-29 How to Cite? |
Abstract | It 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 Identifier | http://hdl.handle.net/10722/92636 |
ISSN | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wu, C | en_HK |
dc.contributor.author | Li, B | en_HK |
dc.date.accessioned | 2010-09-17T10:52:37Z | - |
dc.date.available | 2010-09-17T10:52:37Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | Ieee International Workshop On Quality Of Service, Iwqos, 2006, p. 20-29 | en_HK |
dc.identifier.issn | 1548-615X | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/92636 | - |
dc.description.abstract | It 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.language | eng | en_HK |
dc.relation.ispartof | IEEE International Workshop on Quality of Service, IWQoS | en_HK |
dc.subject | Computer Simulation | en_HK |
dc.subject | Distributed Computer Systems | en_HK |
dc.subject | Encoding (Symbols) | en_HK |
dc.subject | Measurement Theory | en_HK |
dc.subject | Network Protocols | en_HK |
dc.subject | Random Processes | en_HK |
dc.title | Echelon: Peer-to-peer network diagnosis with network coding | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Wu, C:cwu@cs.hku.hk | en_HK |
dc.identifier.authority | Wu, C=rp01397 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/IWQOS.2006.250447 | en_HK |
dc.identifier.scopus | eid_2-s2.0-34250660405 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-34250660405&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 20 | en_HK |
dc.identifier.epage | 29 | en_HK |
dc.identifier.scopusauthorid | Wu, C=15836048100 | en_HK |
dc.identifier.scopusauthorid | Li, B=35248588700 | en_HK |
dc.identifier.issnl | 1548-615X | - |