File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: An Efficient Queueing Policy for Input-Buffered Packet Switches

TitleAn Efficient Queueing Policy for Input-Buffered Packet Switches
Authors
KeywordsCommunications
Issue Date2000
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
The 2000 IEEE International Conference on Communications (ICC 2000), New Orleans, LA., 18-22 June 2000. In Conference Prceedings, 2000, v. 3, p. 1753-1757 How to Cite?
AbstractAn efficient self-adaptive packet queueing policy, called Queueing with Output Address Grouping (QOAG), is proposed for optimizing the performance of an input buffered packet switch. Each input port of the N×N switch under consideration has Q queues and each queue has B packet buffers, where 1
Persistent Identifierhttp://hdl.handle.net/10722/46200
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLiu, NHen_HK
dc.contributor.authorYeung, LKen_HK
dc.date.accessioned2007-10-30T06:44:39Z-
dc.date.available2007-10-30T06:44:39Z-
dc.date.issued2000en_HK
dc.identifier.citationThe 2000 IEEE International Conference on Communications (ICC 2000), New Orleans, LA., 18-22 June 2000. In Conference Prceedings, 2000, v. 3, p. 1753-1757en_HK
dc.identifier.issn1044-4556en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46200-
dc.description.abstractAn efficient self-adaptive packet queueing policy, called Queueing with Output Address Grouping (QOAG), is proposed for optimizing the performance of an input buffered packet switch. Each input port of the N×N switch under consideration has Q queues and each queue has B packet buffers, where 1<Q<N. Using QOAG, a packet arriving at an input port is assigned to the queue which has some backlog packets with the same output address as that of the new packet. If the output address of the new packet is different from all current buffered packets in all queues, it is assigned to the shortest queue. The performance of QOAG is compared with the Odd-Even queueing policy of Kolias and Kleinrock (see Proceedings of IEEE ICC '96, p.1674-79, 1996) by simulations. The Zipf distribution version II is used to model the non-uniform packet output distributions. We found that for a 16×16 switch with B=20 buffers at each queue and input load p=0.7, the mean packet delays are 58.1 and 91.2 time slots and the mean throughputs are 0.474 and 0.355 for using QOAG and Odd-Even queueing respectively. This represents a 57% cut in mean packet delay and 25% increase in throughput when QOAG is used.en_HK
dc.format.extent467402 bytes-
dc.format.extent8014 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communications (ICC)-
dc.rights©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCommunicationsen_HK
dc.titleAn Efficient Queueing Policy for Input-Buffered Packet Switchesen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=3&spage=1753&epage=1757&date=2000&atitle=An+Efficient+Queueing+Policy+for+Input-Buffered+Packet+Switchesen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICC.2000.853796en_HK
dc.identifier.hkuros53732-
dc.customcontrol.immutablesml 151015 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats