Minimum interference path selection based on maximum degree of sharing

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kim, H., & Ahn, S. (2005). Minimum interference path selection based on maximum degree of sharing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3726 LNCS, pp. 1096–1105). Springer Verlag. https://doi.org/10.1007/11557654_122

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free