5,713 research outputs found
Service level agreement framework for differentiated survivability in GMPLS-based IP-over-optical networks
In the next generation optical internet, GMPLS based IP-over-optical networks, ISPs will be required to support a wide variety of applications each having their own requirements. These requirements are contracted by means of the SLA. This paper describes a recovery framework that may be included in the SLA contract between ISP and customers in order to provide the required level of survivability. A key concern with such a recovery framework is how to present the different survivability alternatives including recovery techniques, failure scenario and layered integration into a transparent manner for customers. In this paper, two issues are investigated. First, the performance of the recovery framework when applying a proposed mapping procedure as an admission control mechanism in the edge router considering a smart-edge simple-core GMPLS-based IP/WDM network is considered. The second issue pertains to the performance of a pre-allocated restoration and its ability to provide protected connections under different failure scenarios
Practical issues for the implementation of survivability and recovery techniques in optical networks
Design of a fast and resource-efficient fault management system in optical networks to suit real-time multimedia applications
Today\u27s telecommunications networks are relying more and more on optical fibers as their physical medium. Currently the Wavelength Division Multiplexing technology enables hundreds of wavelengths to be multiplexed on a single fiber. Using this technology capacity can be dramatically increased, even to the order of Terabits per second. While WDM technology has given a satisfactory answer to the ever-increasing demand for capacity, there is still a problem which needs to be handled efficiently: survivability.
Our proposed fault restoration system optimized between restoration cost and speed. We extended the concept of Forward Equivalence Class (FEC) in Multi Protocol Label switching (MPLS) to our proposed fault restoration system. Speed was found to be in the order of 1 to 3 microseconds using predesigned protection, depending on the configuration of the system. Optimization was done between restoration speed and cost by introducing a priority field in the packet header
Wavelength assignment in all-optical networks for mesh topologies
All-Optical Networks employing Dense Wavelength Division Multiplexing (DWDM) are believed to be the next generation networks that can meet the ever-increasing demand for bandwidth of the end users. This thesis presents some new heuristics for wavelength assignment and converter placement in mesh topologies. Our heuristics try to assign the wavelengths in an efficient manner that results in very low blocking probability. We propose novel static and dynamic assignment schemes that outperform the assignments reported in the literature even when converters are used. The proposed on-line scheme called Round-Robin assignment outperforms previously proposed strategies such as first-fit and random assignment schemes. The performance improvement obtained with the proposed static assignments is very significant when compared with the dynamic schemes. We designed and developed a simulator in the C language that supports the 2D mesh topology with DWDM. We ran extensive simulations and compared our heuristics with those reported in the literature. We have examined converter placement in mesh topologies and proposed that placing converters at the center yields better results than uniform placement when dimension order routing is employed. We introduced a new concept called wavelength assignment with second trial that results in extremely low blocking probabilities when compared to schemes based on a single trial. Our proposed schemes are simple to implement and do not add to the cost. Thus we conclude that wavelength assignment plays more significant role in affecting the blocking probability than wavelength converters. We further conclude that static schemes without converters could easily outperform dynamic schemes thus resulting in great savings
Access and metro network convergence for flexible end-to-end network design
This paper reports on the architectural, protocol, physical layer, and integrated testbed demonstrations carried out by the DISCUS FP7 consortium in the area of access - metro network convergence. Our architecture modeling results show the vast potential for cost and power savings that node consolidation can bring. The architecture, however, also recognizes the limits of long-reach transmission for low-latency 5G services and proposes ways to address such shortcomings in future projects. The testbed results, which have been conducted end-to-end, across access - metro and core, and have targeted all the layers of the network from the application down to the physical layer, show the practical feasibility of the concepts proposed in the project
Distributed Failure Restoration for Asynchronous Transfer Mode (ATM) Tactical Communication Networks
Asynchronous Transfer Mode (A TM) is an attractive choice for future military
communication systems because it can provide high throughput and support multi-service
applications. Furthermore its use is consistent with the 'off the shelf technology
policy that is currently operated by the Defence Engineering Research Agency of Great
Britain. However, A TM has been developed as a civil standard and is designed to
operate in network infrastructures with very low failure rates. In contrast, tactical
networks are much less reliable. Indeed tactical networks operate on the premise that
failures, particularly node failures, are expected. Hence, efficient, automatic failure
restoration schemes are essential if an A TM based tactical network is to remain
operational. The main objective of this research is the proposal and verification of one
or more new restoration algorithms that meet the specific requirements of tactical
networks.
The aspects of ATM networks that influence restoration algorithms' implementation are
discussed. In particular, the features of A TM networks such as the concept of Virtual
Paths Virtual Channels and OAM (Operation And Maintenance) mechanisms that
facilitate implementation of efficient restoration techniques. The unique characteristics
of tactical networks and their impact on restoration are also presented.
A significant part of the research was the study and evaluation of existing approaches to
failure restoration in civil networks. A critical analysis of the suitability of these
approaches to the tactical environment shows no one restoration algorithm fully meets
the requirements of tactical networks. Consequently, two restoration algorithms for
tactical A TM networks, DRA-TN (Dynamic Restoration Algorithm for Tactical
Networks) and PPR-TN (Pre-planned Restoration Algorithm for Tactical Networks), are
proposed and described in detail. Since the primary concern of restoration in tactical
networks is the recovery of high priority connections the proposed algorithms attempt to
restore high-priority connections by disrupting low-priority calls. Also, a number of
additional mechanisms are proposed to reduce the use of bandwidth, which is a scarce
resource in tactical networks.
It is next argued that software simulation is the most appropriate method to prove the
consistency of the proposed algorithms, assess their performance and test them on
different network topologies as well as traffic and failure conditions.
For this reason a simulation software package was designed and built specifically to
model the proposed restoration algorithms. The design of the package is presented in
detail and the most important implementation issues are discussed. The proposed
restoration algorithms are modelled on three network topologies under various traffic
loads, and their performance compared against the performance of known algorithms
proposed for civil networks. It is shown that DRA-TN and PPR-TN provide better
restoration of higher priority traffic. Furthermore, as the traffic load increases the
relative performance of the DRA-TN and PPR-TN algorithms increases. The DRA-TN
and PPR-TN algorithms are also compared and their advantages and disadvantages
noted.
Also, recommendations are given about the applicability of the proposed algorithms,
and some practical implementation issues are discussed. The number of problems that
need further study are briefly described.Defence Engineering Research Agency of Great Britai
- …