DocumentCode :
1496433
Title :
Generalized dynamic frame sizing algorithm for finite-internal-buffered networks
Author :
Lien, Ching-Min ; Chang, Cheng-Shang
Author_Institution :
Inst. of Commun. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Volume :
13
Issue :
9
fYear :
2009
Firstpage :
714
Lastpage :
716
Abstract :
In this paper, we generalize the dynamic frame sizing (DFS) algorithm proposed in for CICQ switches to a network of queues subject to multicast traffic flows. Under the assumption of Bernoulli arrival processes for the multicast flows, we show that the DFS algorithm guarantees 100% throughput and there are at most two packets in each internal queue.
Keywords :
multicast communication; packet switching; queueing theory; telecommunication traffic; Bernoulli arrival processes; CICQ switches; finite-internal-buffered networks; generalized dynamic frame sizing algorithm; internal queue; multicast traffic flows; Equations; Heuristic algorithms; Multicast algorithms; Packet switching; Scheduling algorithm; Switches; Telecommunication traffic; Throughput; Traffic control; Flow-based networks, frame-based scheduling, packet switching, 100% throughput;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2009.090067
Filename :
5282385
Link To Document :
بازگشت