2005
DOI: 10.1016/j.comcom.2004.09.005
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis of large multicast switches with multicast virtual output queues

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
3
0

Year Published

2005
2005
2012
2012

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 10 publications
1
3
0
Order By: Relevance
“…Figure 9 we can see that the improvement of the throughput is not significant when the multicast traffic fraction is small, and as the proportion of multicast traffic grows, the improvement is obvious. We can also observe that a high throughput can be achieved when k grows to 8, which corresponds to the conclusion in [9] that a small number of multicast queues (less than 10) are enough to obtain a high switch performance.…”
Section: Performance Under Uniform Trafficsupporting
confidence: 71%
See 1 more Smart Citation
“…Figure 9 we can see that the improvement of the throughput is not significant when the multicast traffic fraction is small, and as the proportion of multicast traffic grows, the improvement is obvious. We can also observe that a high throughput can be achieved when k grows to 8, which corresponds to the conclusion in [9] that a small number of multicast queues (less than 10) are enough to obtain a high switch performance.…”
Section: Performance Under Uniform Trafficsupporting
confidence: 71%
“…Consequently, multicast queuing structure can vary from just one multicast (first in first out) FIFO queue per input to 2 1 N queues per input, where N is the number of output ports of the switch, and considerable amount of solutions based on the architecture have therefore been proposed such as [3][4][5][6][7][8]. The performance of such queuing structure was analyzed in [9][10][11]. Depending on the above input queuing structure, integrated scheduling algorithms have been proposed.…”
Section: Introductionmentioning
confidence: 99%
“…A comparative simulation study is provided to verify its efficiency compared with the previous work in [15]. Figure 1 shows the structure of a switch considered in this paper [17,18]. To simplify the development of a congestion control scheme to be proposed we postulate the following assumptions.…”
Section: Introductionmentioning
confidence: 99%
“…The set of cells to transmit per time slot can be represented as a permutation. Scheduling for IQ switches is known to be a difficult problem [13][14][15][16][17][18][19][20][21][22][23][24][25][26][27]. The difficulty is compounded when Quality-of-Service (QoS) constraints are added to the scheduling problem.…”
Section: Luxembourg the Netherlands Finland Andorra Sweden And Smentioning
confidence: 99%