File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Can we schedule traffic more efficiently in optical packet switches?

TitleCan we schedule traffic more efficiently in optical packet switches?
Authors
KeywordsConjecture
Optical packet switch (OPS)
Performance guaranteed switching
Scheduling
Issue Date2006
PublisherIEEE.
Citation
2006 Workshop On High Performance Switching And Routing, Hpsr 2006, 2006, p. 181-186 How to Cite?
AbstractWe consider traffic scheduling in non-blocking electronic-buffered optical packet switches (OPS) with bounded packet delay. Due to the reconfiguration overhead of the switch fabric, the two commonly used optimization objectives, minimizing packet delay and minimizing switch speedup, conflict with each other. Intelligent scheduling algorithms have been designed to provide tradeoff between these two objectives. In this paper, we propose a more efficient approach to schedule OPS traffic, resulting in significantly reduced speedup and/or packet delay. However, our approach is based on a very interesting conjecture, which has not been strictly proved so far. We would like to put forward this conjecture as an open question, and call for a proof or disproof. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/45951
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorWang, Xen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2007-10-30T06:39:18Z-
dc.date.available2007-10-30T06:39:18Z-
dc.date.issued2006en_HK
dc.identifier.citation2006 Workshop On High Performance Switching And Routing, Hpsr 2006, 2006, p. 181-186en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45951-
dc.description.abstractWe consider traffic scheduling in non-blocking electronic-buffered optical packet switches (OPS) with bounded packet delay. Due to the reconfiguration overhead of the switch fabric, the two commonly used optimization objectives, minimizing packet delay and minimizing switch speedup, conflict with each other. Intelligent scheduling algorithms have been designed to provide tradeoff between these two objectives. In this paper, we propose a more efficient approach to schedule OPS traffic, resulting in significantly reduced speedup and/or packet delay. However, our approach is based on a very interesting conjecture, which has not been strictly proved so far. We would like to put forward this conjecture as an open question, and call for a proof or disproof. © 2006 IEEE.en_HK
dc.format.extent199039 bytes-
dc.format.extent2769 bytes-
dc.format.extent8014 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartof2006 Workshop on High Performance Switching and Routing, HPSR 2006en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
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.en_HK
dc.subjectConjectureen_HK
dc.subjectOptical packet switch (OPS)en_HK
dc.subjectPerformance guaranteed switchingen_HK
dc.subjectSchedulingen_HK
dc.titleCan we schedule traffic more efficiently in optical packet switches?en_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_versionen_HK
dc.identifier.doi10.1109/HPSR.2006.1709703en_HK
dc.identifier.scopuseid_2-s2.0-41549105909en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-41549105909&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage181en_HK
dc.identifier.epage186en_HK
dc.identifier.scopusauthoridWu, B=24605804500en_HK
dc.identifier.scopusauthoridWang, X=9246057600en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats