Bandwidth guaranteed multicast scheduling for virtual output queued packet switches

Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several multicast scheduling schemes for packet switches have been proposed in the literature, they usually aim to achieve only...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of parallel and distributed computing Ročník 69; číslo 12; s. 939 - 949
Hlavní autori:	Pan, Deng, Yang, Yuanyuan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier Inc 01.12.2009 Elsevier
Predmet:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Fair scheduling Multicast Packet scheduling Quality of service (QoS) Software Virtual output queued (VOQ) switch Multicast Virtual output queued (VOQ) switch Quality of service (QoS) Fair scheduling Packet scheduling Multimedia Input output Packet switching Banking Equity Data transmission Scheduling Bandwidth allocation Distributed system Delay Credit Multiplicity Bandwidth Internet Queue Service quality
ISSN:	0743-7315, 1096-0848
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several multicast scheduling schemes for packet switches have been proposed in the literature, they usually aim to achieve only short multicast latency and high throughput without considering bandwidth guarantees. However, fair bandwidth allocation is critical for the quality of service (QoS) of the network, and is necessary to support multicast applications requiring guaranteed performance services, such as online audio and video streaming. This paper addresses the issue of bandwidth guaranteed multicast scheduling on virtual output queued (VOQ) switches. We propose the Credit based Multicast Fair scheduling (CMF) algorithm, which aims at achieving not only short multicast latency but also fair bandwidth allocation. CMF uses a credit based strategy to guarantee the reserved bandwidth of an input port on each output port of the switch. It keeps track of the difference between the reserved bandwidth and actually received bandwidth, and minimizes the difference to ensure fairness. Moreover, in order to fully utilize the multicast capability provided by the switch, CMF lets a multicast packet simultaneously send transmission requests to multiple output ports. In this way, a multicast packet has more chances to be delivered to multiple destination output ports in the same time slot and thus to achieve short multicast latency. Extensive simulations are conducted to evaluate the performance of CMF, and the results demonstrate that CMF achieves the two design goals: fair bandwidth allocation and short multicast latency.
AbstractList	Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several multicast scheduling schemes for packet switches have been proposed in the literature, they usually aim to achieve only short multicast latency and high throughput without considering bandwidth guarantees. However, fair bandwidth allocation is critical for the quality of service (QoS) of the network, and is necessary to support multicast applications requiring guaranteed performance services, such as online audio and video streaming. This paper addresses the issue of bandwidth guaranteed multicast scheduling on virtual output queued (VOQ) switches. We propose the Credit based Multicast Fair scheduling (CMF) algorithm, which aims at achieving not only short multicast latency but also fair bandwidth allocation. CMF uses a credit based strategy to guarantee the reserved bandwidth of an input port on each output port of the switch. It keeps track of the difference between the reserved bandwidth and actually received bandwidth, and minimizes the difference to ensure fairness. Moreover, in order to fully utilize the multicast capability provided by the switch, CMF lets a multicast packet simultaneously send transmission requests to multiple output ports. In this way, a multicast packet has more chances to be delivered to multiple destination output ports in the same time slot and thus to achieve short multicast latency. Extensive simulations are conducted to evaluate the performance of CMF, and the results demonstrate that CMF achieves the two design goals: fair bandwidth allocation and short multicast latency.
Author	Pan, Deng Yang, Yuanyuan
Author_xml	– sequence: 1 givenname: Deng surname: Pan fullname: Pan, Deng organization: School of Computing and Information Sciences, Florida International University, Miami, FL 33174, USA – sequence: 2 givenname: Yuanyuan surname: Yang fullname: Yang, Yuanyuan email: yang@ece.sunysb.edu organization: Department of Electrical & Computer Engineering, State University of New York, Stony Brook, NY 11794, USA
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22103437$$DView record in Pascal Francis
BookMark	eNp9kE1v1DAQQC3USmxb_gCnXOCW1I6d2Ja4QNUCUiUOwNmatcetl2wS_NGKf1-vtlx66Gku741m3hk5mZcZCXnPaMcoGy933W51tusp1R1VHWX0DdkwqseWKqFOyIZKwVvJ2fCWnKW0o5SxQaoN-fkFZvcYXL5v7gpEmDOia_ZlysFCyk2y9-jKFOa7xi-xeQgxF5iapeS15OZvwVLxFewfrOxjyBVPF-TUw5Tw3fM8J79vrn9dfWtvf3z9fvX5trV8ZLn1QginQAspBTi61dutF4DOs1716DiglQ7EKJTQA5d6q5gYtRs0eIteIj8nH49717jUS1I2-5AsThPMuJRkePUGqXkFPzyDkCxMvr5pQzJrDHuI_0zfM8oFl5VTR87GJaWI3tiQIYdlzhHCZBg1h9pmZw61zaG2ocrU2lXtX6j_t78qfTpKWCs9BIwm2YCzRRci2mzcEl7TnwDgZZ0e
CitedBy_id	crossref_primary_10_1007_s11107_011_0320_4 crossref_primary_10_1049_iet_net_2012_0172 crossref_primary_10_4028_www_scientific_net_KEM_474_476_1819 crossref_primary_10_1049_iet_com_2010_0378
Cites_doi	10.1109/26.126711 10.1109/90.234856 10.1145/285237.285254 10.1109/ICPADS.1998.741041 10.1109/TC.2005.164 10.1109/TCOM.1987.1096719 10.1109/90.769767 10.1145/863955.863983 10.1109/JSAC.2003.810495 10.1109/INFCOM.2005.1498567 10.1145/75247.75248 10.1145/383059.383076 10.1145/1088149.1088173 10.1145/1095890.1095897 10.1109/INFCOM.1995.515971 10.1016/S0304-3975(01)00329-2 10.1023/A:1022848304724 10.1109/INFCOM.1999.751673 10.1145/1151659.1159917 10.1109/INFCOM.1996.497885 10.1109/35.668285 10.1109/40.566194 10.1109/INFCOM.2002.1019417 10.1145/161541.161736 10.1109/49.594847 10.1109/90.502236 10.1109/ISCA.1988.5245
ContentType	Journal Article
Copyright	2009 Elsevier Inc. 2015 INIST-CNRS
Copyright_xml	– notice: 2009 Elsevier Inc. – notice: 2015 INIST-CNRS
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.jpdc.2009.08.010
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1096-0848
EndPage	949
ExternalDocumentID	22103437 10_1016_j_jpdc_2009_08_010 S0743731509001579
GroupedDBID	--K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c361t-f444d8a94774ad0b9bbf4aedf1282ed3aec7da4648495379b81469d59afcef7e3
ISICitedReferencesCount	8
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000271541700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0743-7315
IngestDate	Sun Sep 28 06:36:44 EDT 2025 Mon Jul 21 09:16:59 EDT 2025 Tue Nov 18 22:42:22 EST 2025 Sat Nov 29 07:09:37 EST 2025 Fri Feb 23 02:27:55 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	12
Keywords	Multicast Virtual output queued (VOQ) switch Quality of service (QoS) Fair scheduling Packet scheduling Multimedia Input output Packet switching Banking Equity Data transmission Scheduling Bandwidth allocation Distributed system Delay Credit Multiplicity Bandwidth Internet Queue Service quality
Language	English
License	CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c361t-f444d8a94774ad0b9bbf4aedf1282ed3aec7da4648495379b81469d59afcef7e3
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
PQID	34955793
PQPubID	23500
PageCount	11
ParticipantIDs	proquest_miscellaneous_34955793 pascalfrancis_primary_22103437 crossref_citationtrail_10_1016_j_jpdc_2009_08_010 crossref_primary_10_1016_j_jpdc_2009_08_010 elsevier_sciencedirect_doi_10_1016_j_jpdc_2009_08_010
PublicationCentury	2000
PublicationDate	2009-12-01
PublicationDateYYYYMMDD	2009-12-01
PublicationDate_xml	– month: 12 year: 2009 text: 2009-12-01 day: 01
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Journal of parallel and distributed computing
PublicationYear	2009
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	Keshav, Sharma (b10) 1998; 36 McKeown (b13) 1997; 27 Karol, Hluchyj, Morgan (b9) 1987; 35 L. Lao, J. Cui, M. Gerla, D. Maggiorini, A comparative study of multicast protocols: Top, bottom, or in the middle? in: IEEE INFOCOM 2005, vol. 4, Miami, FL, March 2005, pp. 2809–2814 S. Ratnasamy, A. Ermolinskiy, S. Shenker, Revisiting IP multicast, in: ACM SIGCOMM 2006, Pisa, Italy, September 2006, pp. 15–26 Anderson, Owicki, Saxe, Thacker (b1) 1993; 11 J. Bennett, H. Zhang, WF2Q: Worst-case fair weighted fair queueing, in: IEEE INFOCOM’96, San Francisco, CA, March 1996, pp. 120–128 A. Demers, S. Keshav, S. Shenker, Analysis and simulation of a fair queueing algorithm, in: ACM SIGCOMM’89, vol. 19, no. 4, Austin, TX, September 1989, pp. 3–12 S.-T. Chuang, A. Goel, N. McKeown, B. Prabhakar, Matching output queueing with a combined input output queued switch, in: IEEE INFOCOM ’99, New York, March 1999, pp. 1169–1178 B. Prabhakar, N. McKeown, J. Mairesse, Tetris models for multi- cast switches, in: Proc. of the 30th Annual Conf. on Information Sciences and Systems, Princeton, 1996 D. Pan, Y. Yang, Pipelined two step iterative matching algorithms for CIOQ crossbar switches, in: Proc. of 2005 ACM Symposium on Architectures for Networking and Communications Systems, ANCS, Princeton, NJ, October 2005, pp. 41–50 S. Ramabhadran, J. Pasquale, Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay, in: ACM SIGCOMM ’03, Karlsruhe, Germany, August 2003, pp. 239–250 Zhang, Bhuyan (b31) 2003 Mukund, Kumar, Sohoni (b17) 2003; 290 Prabhakar, McKeown, Ahuja (b23) 1997; 15 C. Guo, SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks, in: ACM SIGCOMM ’01, San Diego, CA, August 2001, pp. 211–222 Pan, Yang (b19) 2005; 54 McKeown (b14) 1999; 7 D. Pan, Y. Yang, Credit based fair scheduling for packet switched networks, in: IEEE INFOCOM ’05, Miami, FL, March 2005 Li (b12) 1992; 40 A. Mostefaoui, O. Theel, Shrinking timestamp sizes of event ordering protocols, in: Proc. of 1998 International Conference on Parallel and Distributed Systems, ICPADS, December 1998, pp. 193–200 D. Stiliadis, A. Varma, Providing bandwidth guarantees in an input-buffered crossbar switch, in: IEEE INFOCOM ’95, April 1995, pp. 960–968 R. Guerin, S. Kamat, V. Peris, R. Rajan, Scalable QoS provision through buffer management, in: ACM SIGCOMM ’98, 1998, pp. 29–40 Parekh, Gallager (b22) 1993; 1 McKeown, Izzard, Mekkittikul, Ellesick, Horowitz (b15) 1997; 17 Shreedhar, Varghese (b28) 1996; 4 S. Cheung, C. Pencea, Pipelined sections: A new buffer management discipline for scalable QoS provision, in: IEEE INFOCOM’01, April 2001 Y. Tamir, G. Frazier, High performance multi-queue buffers for VLSI communication switches, in: 15th Annu. Symp. Comput. Arch., June 1988, pp. 343–354 S. Cheung, C. Pencea, BSFQ: Bin sort fair queuing, in: IEEE INFOCOM ’02, New York, June 2002, pp. 1640–1649 Ni, Bhuyan (b18) 2003; 6 J. Renau, et al. Tasking with out-of-order spawn in TLS chip multiprocessors: Microarchitecture and compilation, ACM International Conference on Supercomputing, ICS, 2005, pp. 179–188 10.1016/j.jpdc.2009.08.010_b21 10.1016/j.jpdc.2009.08.010_b20 Shreedhar (10.1016/j.jpdc.2009.08.010_b28) 1996; 4 10.1016/j.jpdc.2009.08.010_b25 10.1016/j.jpdc.2009.08.010_b24 10.1016/j.jpdc.2009.08.010_b27 10.1016/j.jpdc.2009.08.010_b26 Parekh (10.1016/j.jpdc.2009.08.010_b22) 1993; 1 Zhang (10.1016/j.jpdc.2009.08.010_b31) 2003 McKeown (10.1016/j.jpdc.2009.08.010_b15) 1997; 17 McKeown (10.1016/j.jpdc.2009.08.010_b14) 1999; 7 Anderson (10.1016/j.jpdc.2009.08.010_b1) 1993; 11 Li (10.1016/j.jpdc.2009.08.010_b12) 1992; 40 10.1016/j.jpdc.2009.08.010_b7 10.1016/j.jpdc.2009.08.010_b29 10.1016/j.jpdc.2009.08.010_b6 10.1016/j.jpdc.2009.08.010_b8 10.1016/j.jpdc.2009.08.010_b3 Prabhakar (10.1016/j.jpdc.2009.08.010_b23) 1997; 15 10.1016/j.jpdc.2009.08.010_b2 10.1016/j.jpdc.2009.08.010_b5 10.1016/j.jpdc.2009.08.010_b4 10.1016/j.jpdc.2009.08.010_b11 10.1016/j.jpdc.2009.08.010_b16 Keshav (10.1016/j.jpdc.2009.08.010_b10) 1998; 36 Mukund (10.1016/j.jpdc.2009.08.010_b17) 2003; 290 Ni (10.1016/j.jpdc.2009.08.010_b18) 2003; 6 10.1016/j.jpdc.2009.08.010_b30 Karol (10.1016/j.jpdc.2009.08.010_b9) 1987; 35 Pan (10.1016/j.jpdc.2009.08.010_b19) 2005; 54 McKeown (10.1016/j.jpdc.2009.08.010_b13) 1997; 27
References_xml	– reference: D. Pan, Y. Yang, Credit based fair scheduling for packet switched networks, in: IEEE INFOCOM ’05, Miami, FL, March 2005 – volume: 36 start-page: 144 year: 1998 end-page: 151 ident: b10 article-title: Issues and trends in router design publication-title: IEEE Commun. Mag. – reference: C. Guo, SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks, in: ACM SIGCOMM ’01, San Diego, CA, August 2001, pp. 211–222 – reference: A. Demers, S. Keshav, S. Shenker, Analysis and simulation of a fair queueing algorithm, in: ACM SIGCOMM’89, vol. 19, no. 4, Austin, TX, September 1989, pp. 3–12 – reference: S. Ratnasamy, A. Ermolinskiy, S. Shenker, Revisiting IP multicast, in: ACM SIGCOMM 2006, Pisa, Italy, September 2006, pp. 15–26 – volume: 1 start-page: 344 year: 1993 end-page: 357 ident: b22 article-title: A generalized processor sharing approach to flow control in integrated services networks: The single node case publication-title: IEEE/ACM Trans. Netw. – reference: S. Cheung, C. Pencea, Pipelined sections: A new buffer management discipline for scalable QoS provision, in: IEEE INFOCOM’01, April 2001 – volume: 27 year: 1997 ident: b13 article-title: A fast switched backplane for a gigabit switched router publication-title: Business Commun. Rev. – volume: 40 start-page: 97 year: 1992 end-page: 108 ident: b12 article-title: Performance of a nonblocking space-division packet switch with correlated input traffic publication-title: IEEE Trans. Commun. – volume: 11 start-page: 319 year: 1993 end-page: 352 ident: b1 article-title: High speed switch scheduling for local-area networks publication-title: ACM Trans. Comput. Syst. – reference: B. Prabhakar, N. McKeown, J. Mairesse, Tetris models for multi- cast switches, in: Proc. of the 30th Annual Conf. on Information Sciences and Systems, Princeton, 1996 – reference: A. Mostefaoui, O. Theel, Shrinking timestamp sizes of event ordering protocols, in: Proc. of 1998 International Conference on Parallel and Distributed Systems, ICPADS, December 1998, pp. 193–200 – volume: 290 start-page: 221 year: 2003 end-page: 239 ident: b17 article-title: Bounded time-stamping in message-passing systems publication-title: Theoret. Comput. Sci. – reference: S. Cheung, C. Pencea, BSFQ: Bin sort fair queuing, in: IEEE INFOCOM ’02, New York, June 2002, pp. 1640–1649 – reference: Y. Tamir, G. Frazier, High performance multi-queue buffers for VLSI communication switches, in: 15th Annu. Symp. Comput. Arch., June 1988, pp. 343–354 – start-page: 584 year: 2003 end-page: 594 ident: b31 article-title: Deficit round-robin scheduling for input-queued switches publication-title: IEEE J. Sel. Areas Commun. – reference: D. Stiliadis, A. Varma, Providing bandwidth guarantees in an input-buffered crossbar switch, in: IEEE INFOCOM ’95, April 1995, pp. 960–968 – reference: J. Bennett, H. Zhang, WF2Q: Worst-case fair weighted fair queueing, in: IEEE INFOCOM’96, San Francisco, CA, March 1996, pp. 120–128 – reference: J. Renau, et al. Tasking with out-of-order spawn in TLS chip multiprocessors: Microarchitecture and compilation, ACM International Conference on Supercomputing, ICS, 2005, pp. 179–188 – reference: R. Guerin, S. Kamat, V. Peris, R. Rajan, Scalable QoS provision through buffer management, in: ACM SIGCOMM ’98, 1998, pp. 29–40 – reference: S. Ramabhadran, J. Pasquale, Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay, in: ACM SIGCOMM ’03, Karlsruhe, Germany, August 2003, pp. 239–250 – volume: 4 start-page: 375 year: 1996 end-page: 385 ident: b28 article-title: Efficient fair queuing using deficit round robin publication-title: IEEE/ACM Trans. Netw. – reference: L. Lao, J. Cui, M. Gerla, D. Maggiorini, A comparative study of multicast protocols: Top, bottom, or in the middle? in: IEEE INFOCOM 2005, vol. 4, Miami, FL, March 2005, pp. 2809–2814 – volume: 7 start-page: 188 year: 1999 end-page: 201 ident: b14 article-title: The iSLIP scheduling algorithm for input-queued switches publication-title: IEEE/ACM Trans. Netw. – volume: 35 start-page: 1347 year: 1987 end-page: 1356 ident: b9 article-title: Input versus output queueing on a space-division packet switch publication-title: IEEE Trans. Commun. – volume: 54 start-page: 1283 year: 2005 end-page: 1297 ident: b19 article-title: FIFO based multicast scheduling algorithm for VOQ packet switches publication-title: IEEE Trans. Comput. – volume: 6 start-page: 105 year: 2003 end-page: 114 ident: b18 article-title: Fair scheduling for input buffered switches publication-title: Cluster Comput. – reference: D. Pan, Y. Yang, Pipelined two step iterative matching algorithms for CIOQ crossbar switches, in: Proc. of 2005 ACM Symposium on Architectures for Networking and Communications Systems, ANCS, Princeton, NJ, October 2005, pp. 41–50 – volume: 17 start-page: 26 year: 1997 end-page: 33 ident: b15 article-title: The tiny tera: A packet switch core publication-title: IEEE Micro – reference: S.-T. Chuang, A. Goel, N. McKeown, B. Prabhakar, Matching output queueing with a combined input output queued switch, in: IEEE INFOCOM ’99, New York, March 1999, pp. 1169–1178 – volume: 15 start-page: 855 year: 1997 end-page: 866 ident: b23 article-title: Multicast scheduling algorithms for input-queued switches publication-title: IEEE J. Sel. Areas Commun. – volume: 40 start-page: 97 issue: 1 year: 1992 ident: 10.1016/j.jpdc.2009.08.010_b12 article-title: Performance of a nonblocking space-division packet switch with correlated input traffic publication-title: IEEE Trans. Commun. doi: 10.1109/26.126711 – volume: 1 start-page: 344 issue: 3 year: 1993 ident: 10.1016/j.jpdc.2009.08.010_b22 article-title: A generalized processor sharing approach to flow control in integrated services networks: The single node case publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/90.234856 – ident: 10.1016/j.jpdc.2009.08.010_b7 doi: 10.1145/285237.285254 – ident: 10.1016/j.jpdc.2009.08.010_b16 doi: 10.1109/ICPADS.1998.741041 – volume: 54 start-page: 1283 issue: 10 year: 2005 ident: 10.1016/j.jpdc.2009.08.010_b19 article-title: FIFO based multicast scheduling algorithm for VOQ packet switches publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2005.164 – volume: 35 start-page: 1347 year: 1987 ident: 10.1016/j.jpdc.2009.08.010_b9 article-title: Input versus output queueing on a space-division packet switch publication-title: IEEE Trans. Commun. doi: 10.1109/TCOM.1987.1096719 – volume: 7 start-page: 188 issue: 2 year: 1999 ident: 10.1016/j.jpdc.2009.08.010_b14 article-title: The iSLIP scheduling algorithm for input-queued switches publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/90.769767 – ident: 10.1016/j.jpdc.2009.08.010_b25 doi: 10.1145/863955.863983 – start-page: 584 issue: 4 year: 2003 ident: 10.1016/j.jpdc.2009.08.010_b31 article-title: Deficit round-robin scheduling for input-queued switches publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/JSAC.2003.810495 – ident: 10.1016/j.jpdc.2009.08.010_b11 doi: 10.1109/INFCOM.2005.1498567 – ident: 10.1016/j.jpdc.2009.08.010_b6 doi: 10.1145/75247.75248 – ident: 10.1016/j.jpdc.2009.08.010_b20 – ident: 10.1016/j.jpdc.2009.08.010_b8 doi: 10.1145/383059.383076 – ident: 10.1016/j.jpdc.2009.08.010_b27 doi: 10.1145/1088149.1088173 – ident: 10.1016/j.jpdc.2009.08.010_b21 doi: 10.1145/1095890.1095897 – ident: 10.1016/j.jpdc.2009.08.010_b29 doi: 10.1109/INFCOM.1995.515971 – ident: 10.1016/j.jpdc.2009.08.010_b24 – volume: 290 start-page: 221 issue: 1 year: 2003 ident: 10.1016/j.jpdc.2009.08.010_b17 article-title: Bounded time-stamping in message-passing systems publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(01)00329-2 – volume: 6 start-page: 105 issue: 2 year: 2003 ident: 10.1016/j.jpdc.2009.08.010_b18 article-title: Fair scheduling for input buffered switches publication-title: Cluster Comput. doi: 10.1023/A:1022848304724 – ident: 10.1016/j.jpdc.2009.08.010_b5 doi: 10.1109/INFCOM.1999.751673 – ident: 10.1016/j.jpdc.2009.08.010_b26 doi: 10.1145/1151659.1159917 – ident: 10.1016/j.jpdc.2009.08.010_b2 doi: 10.1109/INFCOM.1996.497885 – volume: 36 start-page: 144 issue: 5 year: 1998 ident: 10.1016/j.jpdc.2009.08.010_b10 article-title: Issues and trends in router design publication-title: IEEE Commun. Mag. doi: 10.1109/35.668285 – volume: 17 start-page: 26 issue: 1 year: 1997 ident: 10.1016/j.jpdc.2009.08.010_b15 article-title: The tiny tera: A packet switch core publication-title: IEEE Micro doi: 10.1109/40.566194 – ident: 10.1016/j.jpdc.2009.08.010_b3 doi: 10.1109/INFCOM.2002.1019417 – volume: 11 start-page: 319 issue: 4 year: 1993 ident: 10.1016/j.jpdc.2009.08.010_b1 article-title: High speed switch scheduling for local-area networks publication-title: ACM Trans. Comput. Syst. doi: 10.1145/161541.161736 – volume: 15 start-page: 855 issue: 5 year: 1997 ident: 10.1016/j.jpdc.2009.08.010_b23 article-title: Multicast scheduling algorithms for input-queued switches publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/49.594847 – volume: 4 start-page: 375 issue: 3 year: 1996 ident: 10.1016/j.jpdc.2009.08.010_b28 article-title: Efficient fair queuing using deficit round robin publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/90.502236 – ident: 10.1016/j.jpdc.2009.08.010_b30 doi: 10.1109/ISCA.1988.5245 – ident: 10.1016/j.jpdc.2009.08.010_b4 – volume: 27 issue: 12 year: 1997 ident: 10.1016/j.jpdc.2009.08.010_b13 article-title: A fast switched backplane for a gigabit switched router publication-title: Business Commun. Rev.
SSID	ssj0011578
Score	1.9295626
Snippet	Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	939
SubjectTerms	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Fair scheduling Multicast Packet scheduling Quality of service (QoS) Software Virtual output queued (VOQ) switch
Title	Bandwidth guaranteed multicast scheduling for virtual output queued packet switches
URI	https://dx.doi.org/10.1016/j.jpdc.2009.08.010 https://www.proquest.com/docview/34955793
Volume	69
WOSCitedRecordID	wos000271541700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLag4wEJcUeUy_ADb1GmJHYufgyo3ISqSWyoe4oc24GWKq2aZNvP5zi2063TBjzw0KiyHKf19-WcY_tcEHobhSJUCSn9ICkjn3Ie-FzHylAJbCkDlpk47u9f0-k0m83YoT1ob_pyAmldZ-fnbP1foYY2AFuHzv4D3MOg0ADfAXS4Auxw_Svg3_Fans1l-9P7AfDriQObsvcbFLxpPVjNgnZZOgfK0_mmjyBZde260zGWqoPusJD-paDv2VyD2lxjweq04culMskGpM7Aq4tnqT5ODgZzSlGbyZPpR-8wH459To7zqf54J7lNaOU2HtiOE4eLiLkgsHS605SY8EwnXU0hFsei6IKsZCaLkVW7zGQuvSLRzebC4mCxlsKmF80OAusKeyl99o5aG5wNI1jVEkrS22gvSmOWjdBe_nky-zIcNoWxUdju59vYKuMGuPvc6-yXe2vewFtVmXIoVzR7b64cPUT3LUo4N_x4hG6p-jF6YNcc2Er0BppcWQ_X9gR9GxiEtwzCA4PwlkEYGIQtg7BhEDYMwoZB2DHoKTr-MDl6_8m3tTd8QZKw9StKqcw4o7A84DIoWVlWlCtZgT0TKUm4EqnkNKGZdlBOWam3kpmMGa-EqlJFnqFRvarVc4QJT8FmTgRPSEjjKsj0Zm6SxIIJUfEsHKPQzWghbGJ6XR9lWTgPxEWhUdAVU1mhi6aGwRh5wz1rk5blxt6xA6qwhqUxGAtg2Y337V9CdXiUo9QYvXEwFyCW9Vkbr9WqawoC0xLD_3zxpyFeorvbl-sVGrWbTr1Gd8RpO282-5aqvwHJ67B6
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Bandwidth+guaranteed+multicast+scheduling+for+virtual+output+queued+packet+switches&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=DENG+PAN&rft.au=YUANYUAN+YANG&rft.date=2009-12-01&rft.pub=Elsevier&rft.issn=0743-7315&rft.volume=69&rft.issue=12&rft.spage=939&rft.epage=949&rft_id=info:doi/10.1016%2Fj.jpdc.2009.08.010&rft.externalDBID=n%2Fa&rft.externalDocID=22103437
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon