Name
Abstract | ||
|---|---|---|
In this paper we consider the theoretical and practical management resources needed to reliably localize congested nodes/links and propose a solution based on decoding linear error control codes. We define the scalability of measurement-based network monitoring and relate this to the problem decoding of linear error control codes on a binary symmetric channel. Our main goal is to minimize the number of probe packets required to fully identify congested nodes and our approach requires a number of measurements that grows linearly with respect to the network size, i.e. the approach is scalable. We provide fundamental limits on the relationship between the number of probe packets, size of the network and the ability to perfectly identify all congested nodes. To identify the congested nodes we construct a bipartite graph, and congestion is inferred using the message-passing algorithm. Simulation results demonstrate the ability to perfectly locate congested nodes using this approach. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICC.2006.254779 | 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12 |
Keywords | Field | DocType |
decoding,error correction,scalability,bipartite graph,network monitoring,message passing,resource management,reliability theory,binary symmetric channel | Binary symmetric channel,Computer science,Network packet,Bipartite graph,Computer network,Real-time computing,Error detection and correction,Decoding methods,Network monitoring,Message passing,Distributed computing,Scalability | Conference |
ISSN | Citations | PageRank |
1550-3607 | 0 | 0.34 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rajesh Narasimha | 1 | 30 | 6.18 |
| Souvik Dihidar | 2 | 11 | 2.97 |
| Chuanyi Ji | 3 | 812 | 124.04 |
| Steven W. McLaughlin | 4 | 343 | 41.18 |