Results 131 to 140 of about 1,537 (183)
Some of the next articles are maybe not open access.
On the Price of Locality in Static Fast Rerouting
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2022 Accepted and to appear at the 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'22)
Klaus-Tycho Foerster +2 more
exaly +6 more sources
The 11th IEEE International Conference on Networks, 2003. ICON2003., 2004
This paper presents an approach to improve inter-domain connectivity in the Internet. This novel concept deploys inter-domain routing functions on two different time scales. The innovative fast scoped rerouting approach operates on a fine granular time scale while regular BGP is used on a coarse granular time scale.
Lichtwald, G. +3 more
openaire +1 more source
This paper presents an approach to improve inter-domain connectivity in the Internet. This novel concept deploys inter-domain routing functions on two different time scales. The innovative fast scoped rerouting approach operates on a fine granular time scale while regular BGP is used on a coarse granular time scale.
Lichtwald, G. +3 more
openaire +1 more source
Fast reroute for stateless multicast
2009 International Conference on Ultra Modern Telecommunications & Workshops, 2009Multicast applications such as real-time streaming and video/teleconferencing tolerate delay and packet loss poorly. As a consequence, multicast routing and forwarding should offer flexibility and resiliency for them. In this paper, we introduce fast reroute methods for LIPSIN, a novel Bloom filter based multicast forwarding fabric.
András Zahemszky, Somaya Arianfar
openaire +1 more source
Fast convergence with fast reroute in IP networks
2010 International Conference on High Performance Switching and Routing, 2010It has been observed that even in well managed networks, failures of links and routers are not uncommon. In order to satisfy the demand for high availability in case of a failure, fast restoration of loop-free forwarding along the optimal paths is imperative for a routing scheme.
Glenn Robertson +2 more
openaire +1 more source
FBR: Dynamic Memory-Aware Fast Rerouting
2022 IEEE 11th International Conference on Cloud Networking (CloudNet), 2022Modern internet communication networks, such as MPLS networks, provide fast rerouting mechanisms in the data plane in order to quickly react to link failures and hence become more dependable. However, fast rerouting requires additional memory for the conditional failover rules--a scarce and expensive resource. We initiate the study of memory-aware fast
Stefan Schmid, Jiří Srba
exaly +4 more sources
A fast rerouting scheme for OSPF/IS-IS networks
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969), 2005Most current backbone networks use link-state protocol, OSPF or IS-IS, as their intra-domain routing protocol. Link-state protocols perform global routing table update to route around the failures. It usually takes seconds. As real-time applications like VoIP emerge in recent years, there is a requirement for a fast rerouting mechanism to route around ...
Yong Liu 0014, A. L. Narasimha Reddy
openaire +1 more source
IP fast reroute with failure inferencing
Proceedings of the 2007 SIGCOMM workshop on Internet network management, 2007Five nines availability is being expected from IP networks due to the growing popularity of IP telephony and the increasing usage of the Internet for mission-critical applications. This necessitates enhancing the resiliency of IP networks against transient failures that are observed to happen relatively frequently even in well-managed networks. Towards
Junling Wang, Srihari Nelakuditi
openaire +1 more source
A Fast Reroute Scheme for IP Multicast
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, 2009We propose a fast reroute scheme for the single link failure protection of IP multicast network. A multicast network connects nodes as a spanning tree, which is vulnerable to link failures. Our scheme uses ring topologies to ensure a backup path always exists to any single link failure and only a few nodes in the neighborhood of the failed link have to
Adrian Sai-Wah Tam +2 more
openaire +1 more source