@article{gjoka_loss_2007,
 abstract = {Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.},
 type={4},
 author = {Gjoka, M. and Fragouli, C. and Sattari, P. and Markopoulou, Athina},
 journal = {IEEE GLOBECOM},
 tags = {network_coding},
 title = {Loss {Tomography} in {General} {Topologies} with {Network} {Coding}},
 year = {2007}
}

{"_id":"zLZvnJxsq6FgwbvGo","bibbaseid":"gjoka-fragouli-sattari-markopoulou-losstomographyingeneraltopologieswithnetworkcoding-2007","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Gjoka, M.","Fragouli, C.","Sattari, P.","Markopoulou, A."],"bibdata":{"bibtype":"article","type":"4","abstract":"Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.","author":[{"propositions":[],"lastnames":["Gjoka"],"firstnames":["M."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Sattari"],"firstnames":["P."],"suffixes":[]},{"propositions":[],"lastnames":["Markopoulou"],"firstnames":["Athina"],"suffixes":[]}],"journal":"IEEE GLOBECOM","tags":"network_coding","title":"Loss Tomography in General Topologies with Network Coding","year":"2007","bibtex":"@article{gjoka_loss_2007,\n abstract = {Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.},\n type={4},\n author = {Gjoka, M. and Fragouli, C. and Sattari, P. and Markopoulou, Athina},\n journal = {IEEE GLOBECOM},\n tags = {network_coding},\n title = {Loss {Tomography} in {General} {Topologies} with {Network} {Coding}},\n year = {2007}\n}\n\n","author_short":["Gjoka, M.","Fragouli, C.","Sattari, P.","Markopoulou, A."],"key":"gjoka_loss_2007","id":"gjoka_loss_2007","bibbaseid":"gjoka-fragouli-sattari-markopoulou-losstomographyingeneraltopologieswithnetworkcoding-2007","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&noBootstrap=1&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner="}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.554Z","downloads":0,"keywords":[],"search_terms":["loss","tomography","general","topologies","network","coding","gjoka","fragouli","sattari","markopoulou"],"title":"Loss Tomography in General Topologies with Network Coding","year":2007,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}