Bottleneck branch marking for noise consolidation in multicast networks

Author

Ros, Jordi ; Tsai, Wei K. ; Iyer, Mahadeven

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA

fYear

2000

fDate

2000

Firstpage

57

Lastpage

67

Abstract

The noisy feedback consolidation problem in point-to-multipoint ATM multicast networks is studied. A new algorithm, which keeps track of the M smallest available rates (AR) from the branches at each branching point, is proposed. This algorithm has zero response delay, noise stability (defined in the present paper), and small probability of noise. The probability model assumes no knowledge of the distribution of the available rate from the branches. Both analytical and simulation results demonstrate the superiority of the new algorithm

Keywords

asynchronous transfer mode; feedback; multicast communication; noise; bottleneck branch marking; branching point; multicast networks; noise consolidation; noise stability; noisy feedback consolidation problem; point-to-multipoint ATM multicast networks; probability; smallest available rates; zero response delay; Algorithm design and analysis; Asynchronous transfer mode; Delay; Erbium; Intelligent networks; Multicast algorithms; Protocols; Stability; State feedback; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 2000. (ICON 2000). Proceedings. IEEE International Conference on

Print_ISBN

0-7695-0777-8

Type

conf

DOI

10.1109/ICON.2000.875769

Filename

875769