File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Minimum delay scheduling in scalable hybrid electronic/optical packet switches

TitleMinimum delay scheduling in scalable hybrid electronic/optical packet switches
Authors
KeywordsMinimum delay scheduling
Performance guaranteed switching
Reconfiguration overhead
Speedup bound
Issue Date2006
PublisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308
Citation
Proceedings of the Global Telecommunications Conference, 2006 (GLOBECOM 2006), San Francisco, CA, USA, 27 November - 1 December 2006 How to Cite?
AbstractA hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bounded packet delay), at the cost of speedup. In particular, minimum delay performance can be achieved if an algorithm can always find a schedule of no more than N configurations for any input traffic matrix, where N is the switch size. Various minimum delay scheduling algorithms (MIN, α i-SCALE and QLEF) are proposed. Among them, QLEF requires the lowest speedup bound. In this paper, we show that the existing speedup bound for QLEF is not tight enough. A new bound which is 10% lower than the existing one is derived. © 2006 IEEE.
DescriptionIn Session: Next Generation Networks: NXG-05: Switching and Routing-I: article no. NXG05-6
Persistent Identifierhttp://hdl.handle.net/10722/99457
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2010-09-25T18:31:04Z-
dc.date.available2010-09-25T18:31:04Z-
dc.date.issued2006en_HK
dc.identifier.citationProceedings of the Global Telecommunications Conference, 2006 (GLOBECOM 2006), San Francisco, CA, USA, 27 November - 1 December 2006en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99457-
dc.descriptionIn Session: Next Generation Networks: NXG-05: Switching and Routing-I: article no. NXG05-6-
dc.description.abstractA hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bounded packet delay), at the cost of speedup. In particular, minimum delay performance can be achieved if an algorithm can always find a schedule of no more than N configurations for any input traffic matrix, where N is the switch size. Various minimum delay scheduling algorithms (MIN, α i-SCALE and QLEF) are proposed. Among them, QLEF requires the lowest speedup bound. In this paper, we show that the existing speedup bound for QLEF is not tight enough. A new bound which is 10% lower than the existing one is derived. © 2006 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308-
dc.relation.ispartofGlobecom. IEEE Conference and Exhibitionen_HK
dc.rights©2006 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.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectMinimum delay schedulingen_HK
dc.subjectPerformance guaranteed switchingen_HK
dc.subjectReconfiguration overheaden_HK
dc.subjectSpeedup bounden_HK
dc.titleMinimum delay scheduling in scalable hybrid electronic/optical packet switchesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/GLOCOM.2006.346en_HK
dc.identifier.scopuseid_2-s2.0-50949131110en_HK
dc.identifier.hkuros134481en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-50949131110&selection=ref&src=s&origin=recordpageen_HK
dc.description.otherProceedings of the Global Telecommunications Conference, 2006 (GLOBECOM 2006), San Francisco, CA, USA, 27 November - 1 December 2006-
dc.identifier.scopusauthoridWu, B=24605804500en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats