Recovery of blocky images from noisy and blurred data
SIAM Journal on Applied Mathematics
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Accurate solution to overdetermined linear equations with errors using L1 norm minimization
Computational Optimization and Applications - Special issue on nonsmooth and smoothing methods
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Maximum likelihood network topology identification from edge-based unicast measurements
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Best-path vs. multi-path overlay routing
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Tomography-based overlay network monitoring
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
A Distributed Approach to Topology-Aware Overlay Path Monitoring
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A statistical framework for efficient monitoring of end-to-end network properties
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Improving Mutipath Reliability in Topology-Aware Overlay Networks
ICDCSW '05 Proceedings of the Fourth International Workshop on Assurance in Distributed Systems and Networks (ADSN) (ICDCSW'05) - Volume 01
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks and ISDN Systems
Scalable routing overlay networks
ACM SIGOPS Operating Systems Review
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Drafting behind Akamai (travelocity-based detouring)
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Avoiding traceroute anomalies with Paris traceroute
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Improving web availability for clients with MONET
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Improving the reliability of internet paths with one-hop source routing
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Compressed network monitoring for ip and all-optical networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
IEEE Transactions on Information Theory
On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Delay coerced multi constrained quality of service routing algorithm
WSEAS Transactions on Information Science and Applications
Future Generation Computer Systems
Hi-index | 0.00 |
Overlay networks can be used to find working paths when direct underlay paths are anomalously slow, e.g. because of a network fault. Overlay paths should not use links that are involved in a fault, so choosing which overlay path to use often requires path monitoring, which introduces an overhead. By using a routing matrix 'M' to define which links are used in each path, and sorting the matrix according to the degree of independence of paths, we can choose a reduced set of paths to monitor, and so reduce overheads. The state of the unmonitored paths are then predicted using statistical estimation techniques based on information inferred from the monitored paths. However, such methods assume knowledge of routing matrix. We investigate the impact on such methods when knowledge of the routing matrix is only approximate, e.g. as obtained using simple tools like traceroute which have been previously blamed for incorrect mapping of the topology of real world IP networks. This paper investigates the impact of routing matrix errors on such statistical path estimation approaches. We show that mitigation or removal of such errors leads to improved path metric prediction and anomaly detection.