DocumentCode
2894589
Title
Exact topology inference for DAGs using network coding
Author
Jithin, R. ; Dey, Bikash Kumar
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol. Bombay, Mumbai, India
fYear
2012
fDate
29-30 June 2012
Firstpage
73
Lastpage
78
Abstract
We propose an active tomography technique for inferring directed acyclic graph (DAG) logical topologies where intermediate nodes need to perform network coding. Unlike traditional traceroute-based techniques, our technique requires only unidirectional communication on each link, and does not require the nodes to reveal their unique identities. Also, unlike other recent techniques, our technique requires a single probing experiment with only one probe packet flowing on each link and the deterministic outcome always gives the exact logical topology. As a preparation, we first present two network coding based topology inference schemes for tree topologies which are also of independent interest.
Keywords
graph theory; network coding; telecommunication network routing; telecommunication network topology; DAG logical topologies; active tomography technique; directed acyclic graph logical topologies; exact topology inference; intermediate nodes; network coding based topology inference schemes; probe packet; traceroute-based techniques; unidirectional communication; Encoding; Network coding; Network topology; Probes; Receivers; Routing; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Coding (NetCod), 2012 International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
978-1-4673-1890-7
Type
conf
DOI
10.1109/NETCOD.2012.6261887
Filename
6261887
Link To Document