Minimum interference path selection based on maximum degree of sharing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The explosive growth of Internet traffic has led to a dramatic increase in demand for data transmission capacity, which requires high transmission rates beyond the conventional transmission capability. This demand has spurred tremendous research activities in new high-speed transmission and switching technologies. The present paper focuses on the point of minimizing recovery blocking probability and contention probability to ensure fast and seamless recovery. For this purpose, first the recovery characteristics and grooming architectures of broadband convergence networks is analyzed. Based on the analyzed information, this paper proposes a new dynamic path selection scheme. The simulation results verify that the proposed revised SRLG schemes achieve good network performance and provides good network connectivity as well.

Original languageEnglish
Title of host publicationHigh Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings
PublisherSpringer Verlag
Pages1096-1105
Number of pages10
ISBN (Print)3540290311, 9783540290315
DOIs
StatePublished - 2005
Event1st International Conference on High Performance Computing and Communcations, HPCC 2005 - Sorrento, Italy
Duration: 21 Sep 200523 Sep 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3726 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Conference on High Performance Computing and Communcations, HPCC 2005
Country/TerritoryItaly
CitySorrento
Period21/09/0523/09/05

Fingerprint

Dive into the research topics of 'Minimum interference path selection based on maximum degree of sharing'. Together they form a unique fingerprint.

Cite this