Filters








11,246 Hits in 3.7 sec

The Design of Survivable ATM Networks [chapter]

P. A. Veitch, D. G. Smith, I. Hawker
1995 Performance Modelling and Evaluation of ATM Networks  
It is essential that broadband communication networks are survivable.  ...  In this work, a backbone ATM mesh network is considered whereby Virtual Paths are cross-connected at special ATM switching nodes.  ...  The planning algorithm described attempts to protect as many VPs as possible from single span or single node failure, thus ensuring fast restoration without contention for spare capacity.  ... 
doi:10.1007/978-0-387-34881-0_28 fatcat:teciedyhv5gadifkmc5qtigk6a

Segment-based approaches to survivable translucent network design under various ultra-long-haul system reach capabilities [Invited]

Gangxiang Shen, Wayne D. Grover
2003 Journal of Optical Networking  
network survivability, as opposed to single spans or entire end-to-end paths.  ...  More important, however, a fast, nearly optimal, algorithm is proposed that can determine the placement of opaque nodes so that the fewest possible number is needed that ensures complete translucent reachability  ...  For a survivable network considering various span-failure situations, some extension to the HNF algorithm is as follows: Survivable HNF (SHNF) algorithm: 1.  ... 
doi:10.1364/jon.3.000001 fatcat:ao5buh5f3rcwbclj5uwphzu3nm

Two Tree-Based Algorithms for Network Spare Capacity Design

Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan Zhang
2007 Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)  
In this paper, we introduce two pre-planned path restoration algorithms for spare capacity design in mesh-like networks.  ...  Survivable network design has become increasingly important due to the need for reliable communication service.  ...  Within the same complexity, for each model, the restorability of the S.T.C. algorithm is always higher than the other two algorithms. In one example the difference even reaches nearly 27%.  ... 
doi:10.1109/pdcat.2007.4420181 fatcat:rbra3zhomvbgnpaxde3w3iu5xm

Two Tree-Based Algorithms for Network Spare Capacity Design

Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan Zhang
2007 Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)  
In this paper, we introduce two pre-planned path restoration algorithms for spare capacity design in mesh-like networks.  ...  Survivable network design has become increasingly important due to the need for reliable communication service.  ...  Within the same complexity, for each model, the restorability of the S.T.C. algorithm is always higher than the other two algorithms. In one example the difference even reaches nearly 27%.  ... 
doi:10.1109/pdcat.2007.67 dblp:conf/pdcat/HarutyunyanMZ07 fatcat:zkuibd52e5e7vlj3ozjlixu46u

AVAILABILITY CALCULATIONS FOR A PROPOSED EGYPTIAN LONG-HAUL NETWORK USING NETWORK PERFORMANCE EVALUATION MODELLING

Wafae Bogdady, Atalla Hashad, Dalia Elgamel
2007 International Conference on Aerospace Sciences and Aviation Technology  
Mesh architecture is proposed, and analyzed to increase the availability of the Egyptian backbone when applying the span protection, and path protection method on this architecture.  ...  to be achieved: (1) Quality of Service (QoS) which is controlled by the bit error rate (BER), congestion rate, the latency, and the throughput. (2)Reliability controlled by the network availability & survivability  ...  Rings can restore failures fast in (50-60ms), with at least 100% extra capacity where this figure is only 50-70% (depending on the network topology) for meshes.  ... 
doi:10.21608/asat.2007.23954 fatcat:5ekzjqslufh2xolhol4uelrgwu

Scalable, Optimal and Capacity Efficient Survivable Technique (SOCEST) for Optical Network

Amit Kumar Garg
2017 International Journal of Future Generation Communication and Networking  
In the present work, a scalable, optimal and capacity efficient survivable technique (SOCEST) has been formulated and proposed which outperforms the existing ones in terms of capacity efficiency as well  ...  It is seen that preplanned protection cycles (p-cycles) have emerged as a viable scheme for recovery from failure in mesh networks.  ...  Like a self-healing ring, a p-cycle provides one restoration path for every on-cycle span; unlike a self-healing ring, a p-cycle also provides two restoration paths for every straddling span-a span whose  ... 
doi:10.14257/ijfgcn.2017.10.8.04 fatcat:rqq2m7rigrhbbnikry4iqixlci

Cross-Layer Approach to Survivable DWDM Network Design

Amir Askarian, Yuxiang Zhai, Suresh Subramaniam, Yvan Pointurier, Maïté Brandt-Pearce
2010 Journal of Optical Communications and Networking  
The cross-layer algorithms are computationally intensive, and to alleviate this issue we propose two new compound restoration algorithms as well as two novel quality-oftransmission-aware protection schemes  ...  We present algorithms that improve the network survivability over non-cross-layer algorithms by decreasing both the blocking probability and the vulnerability of the network to failures.  ...  plexity of HQ-HQ path restoration and that the compound algorithms produce significant improvements and are almost as fast as non-QoT-aware algorithms.  ... 
doi:10.1364/jocn.2.000319 fatcat:4mq6rzfahnf4zn3o23ytpqiqvi

A Hybrid p-Cycle Search Algorithm for Protection in WDM Mesh Networks

Kungmeng Lo, Daryoush Habibi, Alexander Rassan, Quoc Phung, Hoang Nguyen, Byungkyu Kang
2006 2006 14th IEEE International Conference on Networks  
p-Cycle is a type of shared link protection for survivable wavelength-division multiplexing (WDM) mesh networks. p-Cycle not only retains ring-like restoration speeds, but also achieves capacity efficiency  ...  In this paper, we propose the Span-weighted Cycle Searching (SCS) algorithm to generate and select an adequate number of p-cycles to minimize the spare capacity, while achieving 100% restorability, within  ...  The aim of survivability is to restore failed traffic flows via alternative backup routes.  ... 
doi:10.1109/icon.2006.302637 dblp:conf/icon/LoHRPNK06 fatcat:4mrxdfvf7ngmhfwriw37shmynq

Optimal & Computationally Efficient Resilient Technique (OCERT) for Optical WDM Networks

Amit Kumar Garg
2017 International Journal of Future Generation Communication and Networking  
Thus, this research paper has been framed considering protection and restoration mechanisms in order to guarantee the survivability of the networks.  ...  In this paper, for based optical networks, link and node failures recovery using p-cycles have been accounted for.  ...  This mechanism is a promising approach for solving the network design problem in the context of survivability, because p-cycles can achieve a fast restoration time like ring protection and a high efficiency  ... 
doi:10.14257/ijfgcn.2017.10.9.02 fatcat:vzbvloh5d5efbkwvxvgrwkgps4

A Novel Class-Based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks [chapter]

Wojciech Molisz, Jacek Rak
2008 Lecture Notes in Computer Science  
We propose a class-based method providing fast service restoration and reducing the number of service recovery actions in the IP layer.  ...  This may be achieved for the price of link capacity utilization degradation.  ...  .= 0 Fig. 2 . 102 Example IP/WDM routing of survivable connection of the class m Example IP/WDM routing of survivable connection of the class m = M-1 In the proposed algorithm, given in Fig. 3, the following  ... 
doi:10.1007/978-3-540-79549-0_29 fatcat:sklc4zp4h5c5hiqowiyw3u4mny

Evaluation of novel resilience schemes in dynamic optical transport networks

Monika Jaeger, Ralf Huelsermann, Dominic A. Schupke, Rene Sedlak, Shizhong Xie, Chunming Qiao, Yun Chur Chung
2002 Optical Networking II  
With the availability of a control plane for the optical layer, fast and efficient MPLS-like restoration mechanisms based on optical channels can be introduced in OTNs.  ...  They are used mainly for static point-to-point connections.  ...  For every two-span-failure the lost (not restorable) connections are counted and over all two-span-failure cases finally averaged.  ... 
doi:10.1117/12.482424 fatcat:mobfl7ps3jhrrgfzrivsgenw7q

Connectivity-aware virtual network embedding

Nashid Shahriar, Reaz Ahmed, Shihabur Rahman Chowdhury, Md. Mashrur Alam Khan, Raouf Boutaba, Jeebak Mitra, Feng Zeng
2016 2016 IFIP Networking Conference (IFIP Networking) and Workshops  
., "Survivable mapping algorithm by ring trimming (smart) for large ip-over-wdm networks," in BroadNets, 2004. *** K.  ...  in sparse VNs  Satisfying disjointedness constraints dominates otherwise  Restores ~100% bandwidth for the highest priority traffic  Penalizes lower priority traffic  Restored bandwidth by  ... 
doi:10.1109/ifipnetworking.2016.7497249 dblp:conf/networking/ShahriarACKBMZ16 fatcat:yoctasqu3fg3hjibkodgopblyu

Pre-configured multi-dimensional protection (p-MDP) structure against multi-failures in high-degree node based optical networks

Chen Ma, Jie Zhang, Yongli Zhao, Jian Yuan, Shanguo Huang, Wanyi Gu, Yang Wang, Huixia Ding, Lifeng Lu
2013 2013 8th International Conference on Communications and Networking in China (CHINACOM)  
Heuristic algorithms of construction, protection and fast restoration on p-MDP are proposed in static optical transport networks.  ...  Numerical results show that, p-MDP can improve the survivability of optical networks, and it has lower redundancy but a bit longer recovery time than p-Cycle in dealing with the same number of simultaneous  ...  Fast restoration algorithm has two advantages: Firstly, only the resource of spanning links is figured out, and other links of restoration path use the protection resource, so fast restoration algorithm  ... 
doi:10.1109/chinacom.2013.6694695 fatcat:6jbe7loqyrhu5dtit6iie7ustq

Simple Pre-Provisioning Scheme to Enable Fast Restoration

Mansoor Alicherry, Randeep Bhatia
2007 IEEE/ACM Transactions on Networking  
In this paper, we are interested in the problem of reserving the least amount of the network capacity for protection, while guaranteeing fast (local) reroute-based restoration for all the supported connections  ...  Supporting fast restoration for general mesh topologies with minimal network over-build is a technically challenging problem.  ...  Thus, for , we have . A. Algorithm Based on Spanning Tree Construction We assume without loss of generality that is connected.  ... 
doi:10.1109/tnet.2007.892844 fatcat:vigh2s6i65chhkacwtefyeztei

Performance of protected working capacity envelopes based on p -Cycles: fast, simple, and scalable dynamic service provisioning of survivable services

Gangxiang Shen, Wayne D. Grover, S. J. Ben Yoo, Gee-Kung Chang, Guangcheng Li, Kwok-wai Cheung
2005 Network Architectures, Management, and Applications II  
As an alternative of the Shared Backup Path Protection (SBPP) method, we develop a framework for dynamic provisioning of survivable services based on the use of p-cycles to form a Protected Working Capacity  ...  Based on p-cycles, the restoration speed of rings is obtained, but with the capacity efficiency of shared-mesh networks.  ...  restorability for any span failure at a time.  ... 
doi:10.1117/12.579373 fatcat:v3larzusu5empoqfhuzkv23kd4
« Previous Showing results 1 — 15 out of 11,246 results