Issues in the Design and Analysis of Survivable Networks
Author : Kalyan Taja Talluri
Publisher :
Page : 172 pages
File Size : 10,80 MB
Release : 1991
Category :
ISBN :
Author : Kalyan Taja Talluri
Publisher :
Page : 172 pages
File Size : 10,80 MB
Release : 1991
Category :
ISBN :
Author : B. Fortz
Publisher : Springer Science & Business Media
Page : 232 pages
File Size : 33,2 MB
Release : 2000-10-31
Category : Computers
ISBN : 9780792364146
This book studies the problem of designing, at minimal cost, a two-connected network such that each edge belongs to a cycle of bounded length. This problem arises in the long-term planning of telecommunications networks. The book provides an in-depth study of the underlying polyhedron, proposing several classes of facet-defining inequalities that are used in a branch-and-cut algorithm. Several heuristics are also proposed in order to solve real-world instances of the problem, and extensive numerical results are reported. The polyhedral analysis is done in the best mathematical programming tradition. Results obtained here demonstrate how to use polyhedral theory for practical network design problems, and are therefore of interest for mathematical programming practitioners as an application of classical theoretical concepts. Moreover, telecommunications specialists can find practical solutions to real-world problems, as several heuristics are proposed that can be easily extended to related problems. Audience: Operations research and mathematical programming researchers, and telecommunications specialists.
Author : Mechthild Stoer
Publisher : Springer
Page : 203 pages
File Size : 31,83 MB
Release : 2006-11-15
Category : Technology & Engineering
ISBN : 3540475001
The problem of designing a cost-efficient network that survives the failure of one or more nodes or edges of the network is critical to modern telecommunications engineering. The method developed in this book is designed to solve such problems to optimality. In particular, a cutting plane approach is described, based on polyhedral combinatorics, that is ableto solve real-world problems of this type in short computation time. These results are of interest for practitioners in the area of communication network design. The book is addressed especially to the combinatorial optimization community, but also to those who want to learn polyhedral methods. In addition, interesting new research problemsare formulated.
Author : Deepak Rajan
Publisher :
Page : 500 pages
File Size : 20,18 MB
Release : 2004
Category :
ISBN :
Author : Thomas L. Magnanti
Publisher :
Page : 10 pages
File Size : 39,22 MB
Release : 2000
Category :
ISBN :
Author : Wayne D. Grover
Publisher : Prentice Hall
Page : 0 pages
File Size : 47,79 MB
Release : 2004
Category : Multiplexing
ISBN : 9780134945767
A whole new suite of how-to capabilities, theoretical understandings, and newideas to apply to network planning and design.
Author : Wei Huo
Publisher :
Page : 0 pages
File Size : 49,11 MB
Release : 2005
Category :
ISBN :
In this thesis, we are particularly interested in studying the impact of network element failure(s) on network survivability. Namely, we propose and analyze a series of models and schemes to protect and restore the affected services in the networks, thus achieve a better survivability in optical networks. In additions to an introduction of optical networks and a survey of the related work, this thesis first focuses on the problem of fast recovery in Chapter 3. By using the framework of Offset-Time restoration, a novel model based on time-driven scheduling is proposed. It substantially shortens the restoration time and can be applied in both single-link failure and dual-link failure scenarios. Next, capacity reprovisioning, as a simple and efficient mechanism to protect a network against multiple failures, is investigated and a new reprovisioning scheme is proposed in Chapter 4. Finally, the application of capacity reprovisioning in traffic grooming is considered. Two frameworks, i.e., lightpath level reprovisioning and connection level reprovisioning, are proposed in Chapter 5 to improve the survivability of optical networks with grooming capability.
Author : Peter Stavroulakis
Publisher : John Wiley & Sons
Page : 370 pages
File Size : 46,39 MB
Release : 2003-09-11
Category : Technology & Engineering
ISBN : 047085930X
Competition within the telecommunications companies is growing fiercer by the day. Therefore, it is vital to ensure a high level of quality and reliability within all telecommunications systems in order to guard against faults and the failure of components and network services. Within large scale systems such quality and reliability problems are ever higher. The metrics of Quality and Reliability have to date only been available in journals and technical reports of companies which have designed or produced major parts of systems used in large applications. This book provides a self-contained treatment enabling the reader to be able to produce, define and utilise the metrics of Quality and Reliability required for the design and implementation of a large application such as a world class event as the Olympic Games. An additional outcome is that this book can be used as a guide for producing an ISO standard for large scale Systems such as the Olympic Games. * Provides presentations of techniques used for solving quality and reliability problems in telecommunications networks replete with illustrations of their applications to real-world services and world class events * Individual chapters written by respective international experts within their fields This will prove highly informative for Practising engineers, researchers and telecommunications professionals, academics and graduate students in telecommunications, standards bodies and organisations such as ISO.
Author : Ramesh Bhandari
Publisher : Springer Science & Business Media
Page : 218 pages
File Size : 42,46 MB
Release : 1999
Category : Computers
ISBN : 9780792383819
Survivable Networks: Algorithms for Diverse Routing provides algorithms for diverse routing to enhance the survivability of a network. It considers the common mesh-type network and describes in detail the construction of physically disjoint paths algorithms for diverse routing. The algorithms are developed in a systematic manner, starting with shortest path algorithms appropriate for disjoint paths construction. Key features of the algorithms are optimality and simplicity. Although the algorithms have been developed for survivability of communication networks, they are in a generic form, and thus applicable in other scientific and technical disciplines to problems that can be modeled as a network. A notable highlight of this book is the consideration of real-life telecommunication networks in detail. Such networks are described not only by nodes and links, but also by the actual physical elements, called span nodes and spans. The sharing of spans (the actual physical links) by the network (logical) links complicates the network, requiring new algorithms. This book is the first one to provide algorithms for such networks. Survivable Networks: Algorithms for Diverse Routing is a comprehensive work on physically disjoint paths algorithms. It is an invaluable resource and reference for practicing network designers and planners, researchers, professionals, instructors, students, and others working in computer networking, telecommunications, and related fields.
Author : Axaykumar Shah
Publisher :
Page : 88 pages
File Size : 49,21 MB
Release : 2000
Category :
ISBN :
ABSTRACT: Due to the remarkable growth of subscribers in cellular systems and mobile communication networks, users expect the same reliable services over the air interface during all operating conditions. This is creating the need to design more robust and survivable wireless access networks. The design of survivable networks requires performance analysis in the wake of failure. However, research has shown that the effectiveness of network analysis is highly dependent on the underlying system modes that are used. This study develops the effects of population distribution and transportation infrastructure on various channel allocation protocols under normal, hot spot and failed conditions. For this we select three geographic areas (small, medium and large cities) and perform various simulation runs by varying different geographic data sets under all above stated conditions and compare the performance of channel assignment protocols in terms of new call blocking, forced termination and handover activity. The results illustrate the extent to which incorporation of empirical data from the physical environment affects the conclusions that are drawn with respect to mobile network performance and survivability analysis.