Filters








365 Hits in 3.8 sec

A design of self-healing ATM networks based on backup virtual paths

Chae Y. Lee, Seok J. Koh
1998 Computers & Operations Research  
A backup VP can be assigned between any pair of nodes on a VP route. The backup route is link disjoint from the original path to avoid the simultaneous failure of both the original and the backup VP.  ...  Abstracts We propose a design of self-healing ATM virtual path (VP) networks based on backup VP. The backup VP is a preassigned virtual path to restore the traffic after a network failure.  ...  If those target VPs are link disjoint in the network, the network cost is reduced by routing those corresponding two backup VPs through a common path. C.  ... 
doi:10.1016/s0305-0548(97)00095-6 fatcat:v7sz2ue3tncwnflaufzvmmpdh4

The use of hop-limits to provide survivable ATM group communications

William Yurcik, David Tipper, Deepankar Medhi
2000 Proceedings of NGC 2000 on Networked group communication - COMM '00  
We compare the feasibility and cost of providing survivability using working multipoint routes with disjoint dedicated backup multipoint routes, where the multipoint routes are setup using either Self-Healing  ...  We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications.  ...  of a non-optimal set of working routes that can be paired with a disjoint set of backup routes..  ... 
doi:10.1145/354644.354662 fatcat:ea7vulk4wzb45ohgp5x6rcs3ly

Design and Performance Issues of Protection Virtual Path Networks [chapter]

P. A. Veitch, D. G. Smith, I. Hawker
1996 IFIP Advances in Information and Communication Technology  
This paper addresses the problem of allocating protection Virtual Path (VP) routes in an ATM network to enable rapid restoration from span or node failures.  ...  A promising approach to VP restoration in a meshed ATM backbone network which combines features of simplicity, resource efficiency and rapid response times, is that of assigning a disjoint protection (  ...  This mode of protection design could have serious implications in an ATM network.  ... 
doi:10.1007/978-0-387-34987-9_45 fatcat:qx33anqhp5aajjtu2bpdhsphei

Capacity performance of dynamic provisioning in optical networks

R. Ramamurthy, Z. Bogdanowicz, S. Samieian, D. Saha, B. Rajagopalan, S. Sengupta, S. Chaudhuri, K. Bala
2001 Journal of Lightwave Technology  
This paper describes an architecture and analyzes the performance of dynamic provisioning of lightpaths in an optical network.  ...  This paper develops a general model of the physical topology of the optical network, and outlines routing approaches for dynamic provisioning of lightpaths.  ...  In 1 1 with sharing, a pair of 1 1 SRG-disjoint routes is determined as described above, and then one of the routes is chosen as the primary path, and the other route is chosen as the backup path, and  ... 
doi:10.1109/50.914483 fatcat:zfyiaokrqjesrjvdrn7mcxmbdu

Survivable WDM mesh networks. Part I-Protection

S. Ramamurthy, B. Mukherjee
1999 IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)  
Path-and link-restoration schemes are dynamic schemes in which backup paths ar-e discovered (from the spare capacity in the network) upon the occurr-ante of a failure.  ...  In path-and linkprotection schemes, backup paths and wavelengths are reserved in advance at the time of call setup.  ...  for that connection. 0-7803-5420-6/99/$10.00 (c) 1999 IEEE -Shared-path protection: In shared-path protection, at the time of call setup for a primary path, a link-disjoint backup path and wavelength are  ... 
doi:10.1109/infcom.1999.751461 dblp:conf/infocom/RamamurthyM99 fatcat:zdfdctinmfgyhlu55ap25pn63a

A New Approach to Survivability of Connection Oriented Networks [chapter]

Krzysztof Walkowiak
2003 Lecture Notes in Computer Science  
In this paper we concentrate on survivability of connection oriented networks (ATM, MPLS, Frame Relay). We introduce a new approach to network survivability.  ...  Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences.  ...  Each connection, i.e. virtual path in ATM or label switched path in MPLS, has a primary route and a backup route.  ... 
doi:10.1007/3-540-44860-8_52 fatcat:fl3ftbxxkzg6zjcud5vmikczr4

The Design of Survivable ATM Networks [chapter]

P. A. Veitch, D. G. Smith, I. Hawker
1995 Performance Modelling and Evaluation of ATM Networks  
In this work, a backbone ATM mesh network is considered whereby Virtual Paths are cross-connected at special ATM switching nodes.  ...  A network design scheme is subsequently described which enables provisioning of spare capacity for complete restoration from particular failures: the expected Virtual Path traffic demands and routing must  ...  For an ATM core network, this requires a knowledge of the routing and bandwidth allocation of Virtual Paths.  ... 
doi:10.1007/978-0-387-34881-0_28 fatcat:teciedyhv5gadifkmc5qtigk6a

Light Path Protection for IP/DWDM Networks

Luying Zhou, Bei Yu, Jia Yu
2002 Optical Communications and Networks  
This paper presents a new algorithm that dynamically allocate restorable bandwidth guaranteed paths in IP over DWDM network.  ...  This paper tackles the bandwidth efficiency by considering sharing of the bandwidth on the backup lightpaths.  ...  Path selecting in the optical network is the problem of routing and wavelength assignment (RWA) [8] , not simply shortest path problem [6] .  ... 
doi:10.1142/9789812776280_0012 fatcat:xx3ojdw5t5bflezrru247dohny

Comparison of two path restoration schemes in self-healing networks

Yijun Xiong, Lorne Mason
2002 Computer Networks  
The state-independent (SI) and state-dependent (SD) path restoration schemes for self-healing networks are studied in this paper.  ...  (in ATM) and nodal storage capacity requirement.  ...  In the SI scheme, which is also called the backup VP scheme in ATM [1] , each working VP has only one backup VP which takes a link/node disjoint path.  ... 
doi:10.1016/s1389-1286(01)00279-1 fatcat:hrvqfwkpb5fdrd2ct7bg5jemja

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

M. Medard, S.G. Finn, R.A. Barry, R.G. Gallager
1999 IEEE/ACM Transactions on Networking  
Unlike previous algorithms, our algorithm can establish two redundant trees in the case of a node failing in the network.  ...  In the case of failure of a communications link, our algorithm provides a superset of the previously known trees.  ...  Pair of link-disjoint paths and pair of vertex-disjoint paths. Fig. 6 . 6 Fig. 6. An example of a network which cannot have edge-disjoint trees. Fig. 7 . 7 Fig. 7.  ... 
doi:10.1109/90.803380 fatcat:j3edyxmf7vdezbp54dndqgczma

Approximating optimal spare capacity allocation by successive survivable routing

Yu Liu, D. Tipper, P. Siripongwutikorn
2005 IEEE/ACM Transactions on Networking  
SSR routes link-disjoint backup paths for each traffic flow one at a time.  ...  Each flow keeps updating its backup path according to the current network state as long as the backup path is not carrying any traffic.  ...  The restoration scheme considered in this paper is the path restoration with link disjoint routes, where the backup path of a flow is link disjointed from its working path.  ... 
doi:10.1109/tnet.2004.842220 fatcat:ryi4efpt7rhk3cypmvpjjlspuy

Design of survivable WDM networks for carrying ATM traffic

N. Sreenath, P. Phanibhushan Rao, G. Mohan, C. Siva Ram Murthy
2002 Computer Communications  
The three-level connection architecture is realized by providing a LP network under the virtual path network, to meet the bandwidth requirements of the virtual paths (VPs).  ...  ATM is a widespread architecture and it is natural to extend the two-level connection architecture of ATM to the three-level connection architecture of optical-ATM networks.  ...  The backup path should be link disjoint to the corresponding primary path.  ... 
doi:10.1016/s0140-3664(01)00390-5 fatcat:kitfhmuxevep5civ25suneeiya

A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks

Krzysztof M. Walkowiak
2004 Computational optimization and applications  
A new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy.  ...  A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses.  ...  Each virtual path has one backup copy, link-disjoint with the normal route of a virtual path.  ... 
doi:10.1023/b:coap.0000008650.91314.59 fatcat:kmwf6nopkvfmto3fy3fofpvdsa

Crosslayer survivable mapping in Overlay-IP-WDM networks

Peera Pacharintanakul, David Tipper
2009 2009 7th International Workshop on Design of Reliable Communication Networks  
We investigate the impacts of overlay network dependency on lower layer network layout in terms of the capacity allocated to overlay paths.  ...  This paper highlights the challenges of providing survivability in three-layer networks and develops a novel approach crosslayer survivable mapping to offer such survivability in an efficient way.  ...  Constraint (16) guarantees that, at Layer 1, each backup path matrix is disjoint from the primary paths. Constraint (17) guarantees paths disjointness of Layer 2 traffic at Layer 1.  ... 
doi:10.1109/drcn.2009.5340009 fatcat:zvxfaxylq5esjl6peq7qeu6bki

From network design to dynamic provisioning and restoration in optical cross-connect mesh networks: an architectural and algorithmic overview

S. Sengupta, R. Ramamurthy
2001 IEEE Network  
The essential components of an IP-centric control architecture for dynamic provisioning and restoration of lightpaths in optical networks are outlined.  ...  This article presents a broad overview of the architectural and algorithmic aspects involved in deploying an optical cross-connect mesh network, starting from the network design and capacity planning phase  ...  Edge disjoint paths in the network are found by determining link/node disjoint routes in the graph between the given pair of nodes. We discuss online path computation algorithms in a later section.  ... 
doi:10.1109/65.941836 fatcat:sc65iekl6rdixmsvbknjdp7fx4
« Previous Showing results 1 — 15 out of 365 results