Results 1 - 10
of
15
Path Splicing
"... We present path splicing, a new routing primitive that allows network paths to be constructed by combining multiple routing trees (“slices”) to each destination over a single network topology. Path splicing allows traffic to switch trees at any hop en route to the destination. End systems can change ..."
Abstract
-
Cited by 52 (5 self)
- Add to MetaCart
(Show Context)
We present path splicing, a new routing primitive that allows network paths to be constructed by combining multiple routing trees (“slices”) to each destination over a single network topology. Path splicing allows traffic to switch trees at any hop en route to the destination. End systems can change the path on which traffic is forwarded by changing a small number of additional bits in the packet header. We evaluate path splicing for intradomain routing using slices generated from perturbed link weights and find that splicing achieves reliability that approaches the best possible using a small number of slices, for only a small increase in latency and no adverse effects on traffic in the network. In the case of interdomain routing, where splicing derives multiple trees from edges in alternate backup routes, path splicing achieves near-optimal reliability and can provide significant benefits even when only a fraction of ASes deploy it. We also describe several other applications of path splicing, as well as various possible deployment paths.
Bandwidth-aware routing in overlay networks
- in Proc. IEEE Int. Conf. Computer Communications
, 2008
"... Abstract—In the absence of end-to-end quality of service (QoS), overlay routing has been used as an alternative to the default best effort Internet routing. Using end-to-end network measurement, the problematic parts of the path can be bypassed, resulting in improving the resiliency and robustness t ..."
Abstract
-
Cited by 19 (1 self)
- Add to MetaCart
(Show Context)
Abstract—In the absence of end-to-end quality of service (QoS), overlay routing has been used as an alternative to the default best effort Internet routing. Using end-to-end network measurement, the problematic parts of the path can be bypassed, resulting in improving the resiliency and robustness to failures. Studies have shown that overlay paths can give better latency, loss rate, and TCP throughput. Overlay routing also offers flexibility as different routes can be used based on application needs. There have been very few proposals of using bandwidth as the main metric of interest, which is of great concern in media applications. We introduce our scheme BARON (Bandwidth-Aware Routing in Overlay Networks) that utilizes capacity between the end hosts to identify viable overlay paths and measures available bandwidth to select the best route. We propose our path selection approaches, and using the measurements between 174 PlanetLab nodes and over 13,189 paths, we evaluate the usefulness of overlay routes in terms of bandwidth gain. Our results show that among 658,526 overlay paths, 25 % have larger bandwidth than their native IP routes, and over 86 % of 〈source, destination 〉 pairs have at least one overlay route with larger bandwidth than the default IP routes. We also present the effectiveness of BARON in preserving the bandwidth requirement over time for a few selected Internet paths. I.
Cross-Layer Failure Restoration Techniques for a Robust IPTV
- Service”, Proc. of IEEE LANMAN Workshop
, 2008
"... Abstract — Broadcast TV distribution over an IP network requires stringent QoS constraints, such as low latency and loss. The main challenge to achieving these QoS objectives is how to design the network to respond to network failures. Streaming content in IPTV is typically delivered to the distribu ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract — Broadcast TV distribution over an IP network requires stringent QoS constraints, such as low latency and loss. The main challenge to achieving these QoS objectives is how to design the network to respond to network failures. Streaming content in IPTV is typically delivered to the distribution points on the IP backbone using IP multicast, and in the case being considered, with Protocol Independent Multicast Source Specific Mode (PIM-SSM). A proven failure restoration technique at the IP layer is link-restoration using MPLS or layer-2 Fast Reroute (FRR). Link-based FRR creates a pseudo-wire or tunnel in parallel to the IP adjacencies (links) along the forwarding path used by the PIM tree. For each such tunnel both a primary and backup path are defined. The backup path is Layer-1-disjoint from the physical link and when the link fails, the pseudo-wire can be rapidly restored. Thus, single link failures are transparent to the Interior Gateway Protocol (IGP). Although one may choose the back-up path’s IGP link weights to avoid traffic overlap during any single link failure, multiple failures may still cause traffic overlap with FRR. We present a cross-layer restoration approach that combines both FRR-based restoration for single link failure and “hitless ” (i.e., without loss) PIM tree reconfiguration algorithms to prevent traffic overlap when multiple failures occur. Index Terms — multicast, fast-reroute, cross-layer design, IPTV, PIM-SSM reconfiguration
On the Effectiveness of Proactive Path-Diversity Based Routing for Robustness to Path Failures
"... Abstract. Path disruptions are frequent occurrences on today's Internet. They may be due to congestion or failures, which in turn may be attributed to unintentional factors (e.g., hardware failures) or caused by malicious activity. Several efforts to-date have focused on enhancing robustness f ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract. Path disruptions are frequent occurrences on today's Internet. They may be due to congestion or failures, which in turn may be attributed to unintentional factors (e.g., hardware failures) or caused by malicious activity. Several efforts to-date have focused on enhancing robustness from the end-to-end viewpoint by using path diversity. Most of these studies are limited to single-or two-path approaches. This paper is the first to address the question of what degree of path diversity is needed to effectively mitigate the effect of path failures. We seek to answer this question through extensive experiments in PlanetLab. To evaluate the effect of path diversity on routing robustness in regards to a wide spectrum of applications, we introduce a new performance metric we named outage duration. Experimental results show that proactively forwarding packets using a high degree of path diversity is more effective in overcoming path failures in comparison with single-path or two-path approaches. In addition, for applications in which low packet loss probability is as important as uninterrupted connectivity, we suggest a packet forwarding scheme based on link gains and discuss the trade-offs between robustness and packet delivery probability.
Cross-Layer Techniques for Failure Restoration of IP Multicast with Applications to IPTV
"... Abstract — Broadcast TV distribution over an IP network requires stringent QoS constraints, such as low latency and loss. Streaming content in IPTV is typically delivered to the distribution points on the IP backbone using IP multicast protocols such as Protocol Independent Multicast Source Specific ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract — Broadcast TV distribution over an IP network requires stringent QoS constraints, such as low latency and loss. Streaming content in IPTV is typically delivered to the distribution points on the IP backbone using IP multicast protocols such as Protocol Independent Multicast Source Specific Mode (PIM-SSM). Link-restoration using MPLS or layer-2 Fast Reroute (FRR) is a proven failure restoration technique at the IP layer. Link-based FRR creates a pseudo-wire or tunnel in parallel to the IP adjacencies (links); and thus, single link failures are transparent to the Interior Gateway Protocol (IGP). Although one may choose the back-up path’s IGP link weights to avoid traffic overlap during any single physical link failure, multiple failures may still cause traffic overlap with FRR. We present a cross-layer restoration approach that combines both FRR-based restoration for single link failure and “hitless ” (i.e., without loss) PIM tree reconfiguration algorithms to prevent traffic overlap when multiple failures occur. D I.
(or
"... of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM 2007 proceedings. Combining multihoming with overlay routing ..."
Abstract
- Add to MetaCart
(Show Context)
of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM 2007 proceedings. Combining multihoming with overlay routing
2009 28th IEEE International Symposium on Reliable Distributed Systems The Blocking Option in Routing Protocols
"... Abstract—Routing protocols are designed under the assumption that each node in a network should be able to reach (i. e. send or forward packets to) every other node in the network. Unfortunately, adopting this assumption in a routing protocol does allow adversary nodes to launch spam or DoS attacks ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Routing protocols are designed under the assumption that each node in a network should be able to reach (i. e. send or forward packets to) every other node in the network. Unfortunately, adopting this assumption in a routing protocol does allow adversary nodes to launch spam or DoS attacks against the other nodes in the network. In this paper, we introduce the “blocking option ” in routing protocols; this option allows a node u to block a specified set of nodes {v,..,w} and prevent each of them from reaching node u. It turns out that if node u blocks a large number of nodes, then u may end up blocking other nodes as well. We refer to these unintentionally blocked nodes as blind to u nodes. Clearly, a node u cannot communicate with its blind nodes in a regular manner. Thus, we extend the routing protocol to allow each node u to communicate with its blind nodes via some special node, called the joint node. To perform its intended function, the joint node needs to be neither blocked by any node nor blind to any node in the network. We give an algorithm for identifying the node that is best suited to be the joint node in a network. Finally, we show, through extensive simulation, that the average number of blind nodes is close to zero when the average number of blocked nodes is small (< 20) and that the probability of a joint node being blind is quite small, on the order of 10 −3. The path length of using a joint node for communication between a node u and any one of its blind nodes v is around 1.5 the shortest path between u and v.
Overlay Networks
, 2006
"... To my wife Yan, and my parents, for their love, support and encouragement iii ACKNOWLEDGEMENTS My first, and most earnest, acknowledgment must go to my advisor Dr. Mostafa Ammar, who led me into the exciting area of networking and telecommunications. His insights, experience, encouragement, and unco ..."
Abstract
- Add to MetaCart
(Show Context)
To my wife Yan, and my parents, for their love, support and encouragement iii ACKNOWLEDGEMENTS My first, and most earnest, acknowledgment must go to my advisor Dr. Mostafa Ammar, who led me into the exciting area of networking and telecommunications. His insights, experience, encouragement, and uncompromising emphasis on quality research guided me through my entire program of study. Much of this thesis work is collaboration with Dr. Constantine Dovrolis. I have learned substantially from his detail-oriented attitude, enthusiasm and dedication to precise and high quality research. I owe a lot to Dr. Admela Jukan for her compassion, dedication, and constant en-couragement during my early work in optical networks. This experience provided many important insights and valuable techniques to the thesis work presented here. Dr. Jun Xu offered me opportunities to work on network security projects and I am
