A Spare Capacity Planning Methodology for Wide Area Survivable Networks PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download A Spare Capacity Planning Methodology for Wide Area Survivable Networks PDF full book. Access full book title A Spare Capacity Planning Methodology for Wide Area Survivable Networks by Adel A. Al-Rumaih. Download full books in PDF and EPUB format.
Author: Adel A. Al-Rumaih
Publisher: Universal-Publishers
ISBN: 158112046X
Category : Computers
Languages : en
Pages : 212
Get Book Here
Book Description
In this dissertation, a new spare capacity planning methodology is proposed utilizing path restoration. The approach is based on forcing working flows/traffic which are on paths that are disjoint to share spare backup capacity. The algorithm for determining the spare capacity assignment is based on genetic algorithms and is capable of incorporating non-linear variables such as non-linear cost function and QoS variables into the objective and constraints. The proposed methodology applies to a wider range of fault scenarios than most of the current literature. It can tolerate link-failures, node-failures, and link-and-node failures. It consists of two stages: the first stage generates a set of network topologies that maximize the sharing between backup paths by forcing them to use a subset of the original network. The second stage utilizes a genetic algorithm to optimize the set of solutions generated by the first stage to achieve an even better final solution. It can optimize the solution based on either minimizing spare capacity or minimizing the total network cost. In addition, it can incorporate QoS variables in both the objective and constraints to design a survivable network that satisfies QoS constraints. Numerical results comparing the proposed methodology to Integer Programming techniques and heuristics from the literature are presented showing the advantages of the technique. The proposed methodology was applied on 4 different size networks based on spare capacity optimization criteria and it was found that it achieved solutions that were on average 9.3% better than the optimal solution of the IP design that is based on link-restoration. It also achieved solutions that were on average 22.2 % better than the previous heuristic SLPA. The proposed methodology is very scalable. It was applied on networks with different sizes ranging from a 13-node network to a 70-node network. It was able to solve the 70-node network in less than one hour on a Pentium II PC. The curve-fitting of the empirical execution time of the methodology was found to be O(n3).
Author: Adel A. Al-Rumaih
Publisher: Universal-Publishers
ISBN: 158112046X
Category : Computers
Languages : en
Pages : 212
Get Book Here
Book Description
In this dissertation, a new spare capacity planning methodology is proposed utilizing path restoration. The approach is based on forcing working flows/traffic which are on paths that are disjoint to share spare backup capacity. The algorithm for determining the spare capacity assignment is based on genetic algorithms and is capable of incorporating non-linear variables such as non-linear cost function and QoS variables into the objective and constraints. The proposed methodology applies to a wider range of fault scenarios than most of the current literature. It can tolerate link-failures, node-failures, and link-and-node failures. It consists of two stages: the first stage generates a set of network topologies that maximize the sharing between backup paths by forcing them to use a subset of the original network. The second stage utilizes a genetic algorithm to optimize the set of solutions generated by the first stage to achieve an even better final solution. It can optimize the solution based on either minimizing spare capacity or minimizing the total network cost. In addition, it can incorporate QoS variables in both the objective and constraints to design a survivable network that satisfies QoS constraints. Numerical results comparing the proposed methodology to Integer Programming techniques and heuristics from the literature are presented showing the advantages of the technique. The proposed methodology was applied on 4 different size networks based on spare capacity optimization criteria and it was found that it achieved solutions that were on average 9.3% better than the optimal solution of the IP design that is based on link-restoration. It also achieved solutions that were on average 22.2 % better than the previous heuristic SLPA. The proposed methodology is very scalable. It was applied on networks with different sizes ranging from a 13-node network to a 70-node network. It was able to solve the 70-node network in less than one hour on a Pentium II PC. The curve-fitting of the empirical execution time of the methodology was found to be O(n3).
Author: Guy Pujolle
Publisher: Springer
ISBN: 3540455515
Category : Computers
Languages : en
Pages : 1000
Get Book Here
Book Description
This was the first conference jointly organized by the IFIP Working Groups 6. 2, 6. 3, and 6. 4. Each of these three Working Groups has its own established series of conferences. Working Group 6. 2 sponsors the Broadband Communications series of conferences (Paris 1995, Montreal 1996, Lisboa 1997, Stuttgart 1998, and Hong-Kong 1999). Working Group 6. 3 sponsors the Performance of Communication Systems series of conferences (Paris 1981, Zürich 1984, Rio de Janeiro 1987, Barcelona 1990, Raleigh 1993, Istanbul 1995, and Lund 1998). Working Group 6. 4 sponsors the High Performance Networking series of conferences (Aaren 1987, Liège 1988, Berlin 1990, Liège 1992, Grenoble 1994, Palma 1995, New York 1997, Vienna 1998). It is expected that this new joint conference will take place every two years. In view of the three sponsoring Working Groups, there were three separate tracks, one per Working Group. Each track was handled by a different co chairman. Specifically, the track of Working Group 6. 2 was handled by Ulf Körner, the track of Working Group 6. 3 was handled by Ioanis Stavrakakis, and the track of Working Group 6. 4 was handled by Serge Fdida. The overall program committee chairman was Harry Perros, and the general conference chairman was Guy Pujolle. A total of 209 papers were submitted to the conference of which 82 were accepted. Each paper was submitted to one of the three tracks.
Author:
Publisher: Institute of Electrical & Electronics Engineers(IEEE)
ISBN:
Category : Computers
Languages : en
Pages : 448
Get Book Here
Book Description
Two volumes contain papers presented at the January 2000 conference in South Carolina. The subject is hot--how to strengthen security of network systems--and the DARPA Information Survivability program began in 1994 as a government funded response to threats to the US Department of Defense. The program's four research areas, addressed here in 32 papers from government, academia, and industry, include high confidence networking--developing protocols and services to protect the integrity of internet-based activities; high confidence computing--developing secure operating systems and computing environments); survivability of large scale systems--focusing on intrusion detection techniques; and wrappers and composition-- toolkits for integrating security and survivability functionality into legacy systems. Indexed only by author. Annotation copyrighted by Book News, Inc., Portland, OR.
Author:
Publisher:
ISBN:
Category : Broadband communication systems
Languages : en
Pages : 1026
Get Book Here
Book Description
Author:
Publisher:
ISBN:
Category : Dissertations, Academic
Languages : en
Pages : 856
Get Book Here
Book Description
Author: Hermann Kaindl
Publisher: Margret Schneider
ISBN: 3800728400
Category :
Languages : en
Pages : 457
Get Book Here
Book Description
Author: Andre Girard
Publisher: Springer Science & Business Media
ISBN: 0387255516
Category : Business & Economics
Languages : en
Pages : 377
Get Book Here
Book Description
GERAD celebrates this year its 25th anniversary. The Center was created in 1980 by a small group of professors and researchers of HEC Montreal, McGill University and of the Ecole Polytechnique de Montreal. GERAD's activities achieved sufficient scope to justify its conversion in June 1988 into a Joint Research Centre of HEC Montreal, the Ecole Polytechnique de Montreal and McGill University. In 1996, the U- versite du Quebec a Montreal joined these three institutions. GERAD has fifty members (professors), more than twenty research associates and post doctoral students and more than two hundreds master and Ph.D. students. GERAD is a multi-university center and a vital forum for the devel- ment of operations research. Its mission is defined around the following four complementarily objectives: • The original and expert contribution to all research fields in GERAD's area of expertise; • The dissemination of research results in the best scientific outlets as well as in the society in general; • The training of graduate students and post doctoral researchers; • The contribution to the economic community by solving important problems and providing transferable tools.
Author: Yuan-Shun Dai
Publisher: Nova Publishers
ISBN: 9781600212024
Category : Computers
Languages : en
Pages : 336
Get Book Here
Book Description
The field of parallel and distributed computing is undergoing changes at a breathtaking pace. Networked computers are now omnipresent in virtually every application, from games to sophisticated space missions. The increasing complexity, heterogeneity, largeness, and dynamism of the emerging pervasive environments and associated applications are challenging the advancement of the parallel and distributed computing paradigm. Many novel infrastructures have been or are being created to provide the necessary computational fabric for realising parallel and distributed applications from diverse domains. New models and tools are also being proposed to evaluate and predict the quality of these complicated parallel and distributed systems. Current and recent past efforts, made to provide the infrastructures and models for such applications, have addressed many underlying complex problems and have thus resulted in new tools and paradigms for effectively realising parallel and distributed systems. This book showcases these novel tools and approaches with inputs from relevant experts.
Author: Mohammad Ilyas
Publisher: CRC Press
ISBN: 0203489640
Category : Science
Languages : en
Pages : 485
Get Book Here
Book Description
The Internet revolution. Once, the public was delighted with 14.4 modem access and fascinated by low-tech Web site content. But not for long. Technology has raced to keep up with users' calls for high-speed facilities and advanced applications. With the development of high-speed transmission media and the availability of high-speed hardware, we are
Author: Peng-Jun Wan
Publisher: American Mathematical Soc.
ISBN: 9780821870907
Category : Technology & Engineering
Languages : en
Pages : 268
Get Book Here
Book Description
Time division multiplexing (TDM) has been the fundamental basis for adding capacity to digital telecommunications networks for decades. However, within the past two years, wavelength division multiplexing (WDM) has been emerging as an important and widely deployed complement to TDM. Sales of systems based on the new technology have risen at breathtaking speed. The driving force behind this sales explosion was the unexpected rapid exhaustion of long distance fiber network capacity. This fiber exhaust, combined with favorable economics for WDM, led to the use of this technology over other alternatives. The WDM deployment raises fundamental and challenging problems that require novel and innovative solutions. This volume presents papers from an interdisciplinary workshop held at DIMACS on multichannel optical networks. Leading computer science theorists and practitioners discussed admissions control, routing and channel assignment, multicasting and protection, and fault-tolerance. The book features application of theoretical and/or algorithmical results to practical problems and addresses the influence of practical problems to theoretical/algorithmic studies. The volume can serve as a text for an advanced course in computer science, networking, and operations research.
