1,721,089 research outputs found
An Architecture for Differentiated Protection against Single and Double Faults in GMPLS
No full textIn the context of an optical network GMPLS can be used to provide network robustness to faults through end-to-end path protection techniques. In this paper, we present a dynamic distributed model supporting five different classes of protection, including protection against single and double fault, with and without sharing of backup bandwidth. Beyond link and node failures we also consider protection against shared risk link group (SLRG) failure. In this paper, we briefly describe the protection model and the underlying algorithms for route selection and backup bandwidth sharing. After that we face the following issue: Which subset out of the five possible protection classes is convenient for an operator to support on the same network infrastructure? To answer this question it is fundamental to have a clear view of the trade-offs between the costs and the performances associated to each class. To achieve that we carried out an extensive performance analysis by means of simulations. For each protection class, we evaluated two fundamental performance metrics: the recovery probability under multiple faults, and the average per-demand resource usage. On the basis of such results, we are able to identify some basic guidelines driving the choice of the more convenient subset of protection classes to be implemented within a single network
Optimal routing for protection and restoration in an optical network
No full textIn this paper we provide a centralized method for optimally selecting the set of active and backup paths in an optical transport network in the case of shared-path restoration and 1:1 protection schemes
Performance Evaluation of a Distributed Scheme for Protection against Single and Double Faults for MPLS
No full textSecond International Workshop, QoS-IP 2003 Milano, Italy, February 24–26, 2003 Proceeding
Introducing standby capabilities into next-generation network devices
No full textIn this contribution, our main objective is to introduce and to support standby modes in next-generation devices for backbone networks. Our main idea consists of periodically reconfiguring nodes and links to meet incoming traffic volumes and operational constraints of real-world networks, such as reliability, stability, quality of service, and re-convergence times. To this purpose, the approach is mainly founded on two features already and largely present in today's networks and devices: the network resource virtualization and the modular architecture of nodes. By means of a Linux SW router prototype, we demonstrated that the proposed approach allows dynamically sleeping pieces of hardware in several network nodes, while maintaining good network performance levels, and without causing undesired network instabilities. © 2010 ACM
Delivering end-to-end statistical QoS guarantees for expedited forwarding"
No full textThis paper presents an admission control frame work for Expedited Forwarding (EF) traffic in a Differentiated Service Network. The aim is to overcome the limitation in terms of achievable efficiency which are proper of a deterministic “worst case” approach based on the zero-los assumption
Non-blocking multicast three-stage interconnection networks
No full textThis paper deals with non-blocking properties of multicast three-stage interconnection networks. The necessary and suflcient condition for a strictly non blocking three-stage network is found and demonstrated. This condition represents a real innovative result with respect to those already available in literature that only refer to sufjicient bounds. Moreover, it is also demonstrated that, in the worst case of unrestricted fan-out and with a simple assumption on the path selection algorithm, the complexity of a NxN multicast network can be limited to O(p '). Such complexity is lower than that relevant to a crossbar network of the same size
Patent number 12712121.8 - 1855: Apparatus and Method for Switching Information Trasported using a Hierarchical Data Structure
No full textA switching apparatus is provided for switching information transported using a hierarchical data structure, the hierarchical data structure comprising at least first and second order data flows, The switching apparatus comprises an input stage (210) comprising at least one input switching unit (21 11 to 21 1 H), and an output stage (230) comprising at least one output switching unit (2311 to 231 H). A central stage (220) is coupled between the input stage (210) and the output stage (230), the central stage (220) comprising a central switching unit (221 ). The at least one input switching unit (21 11 to 21 1 H) and the at least one output switching unit (2311 to 231 H) are configured to switch first order data flows contained within second order data flows. The central switching unit (221 ) is configured to switch only second order data flows, wherein the second order data flows have a higher order than the first order data flows
- …
