File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Traffic scheduling in non-blocking optical packet switches with minimum delay

TitleTraffic scheduling in non-blocking optical packet switches with minimum delay
Authors
KeywordsOptical packet switch (OPS)
Performance guaranteed scheduling
Reconfiguration overhead
Speedup
Issue Date2005
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308
Citation
The 2005 IEEE Global Telecommunications Conference (Globecom 2005), St. Louis, MO., 28 November-2 December 2005. In Conference Proceedings, 2005, v. 4, p. 2041-2045 How to Cite?
AbstractFor performance guaranteed OPS switches with reconfiguration overhead, it has been shown that packet delay can be minimized by using N switch configurations (where N is the switch size) to schedule the traffic. However, this usually involves an exorbitant speedup requirement, which makes it impractical under current technology. In this paper, a new minimum-delay scheduling algorithm QLEF (Quasi Largest-Entry-First) is proposed. We prove that QLEF pushes the required speedup bound to the lowest known level. As an example, when N=950, QLEF only requires a speedup of S schedule=21.33 instead of 42.25 for MIN [5] and 30.27 for α i-SCALE [8]. This gives a 50% improvement over MIN and 30% over α i-SCALE. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/45947
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2007-10-30T06:39:13Z-
dc.date.available2007-10-30T06:39:13Z-
dc.date.issued2005en_HK
dc.identifier.citationThe 2005 IEEE Global Telecommunications Conference (Globecom 2005), St. Louis, MO., 28 November-2 December 2005. In Conference Proceedings, 2005, v. 4, p. 2041-2045en_HK
dc.identifier.issn1054-5921en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45947-
dc.description.abstractFor performance guaranteed OPS switches with reconfiguration overhead, it has been shown that packet delay can be minimized by using N switch configurations (where N is the switch size) to schedule the traffic. However, this usually involves an exorbitant speedup requirement, which makes it impractical under current technology. In this paper, a new minimum-delay scheduling algorithm QLEF (Quasi Largest-Entry-First) is proposed. We prove that QLEF pushes the required speedup bound to the lowest known level. As an example, when N=950, QLEF only requires a speedup of S schedule=21.33 instead of 42.25 for MIN [5] and 30.27 for α i-SCALE [8]. This gives a 50% improvement over MIN and 30% over α i-SCALE. © 2005 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308en_HK
dc.relation.ispartofIEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)en_HK
dc.rights©2005 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.subjectOptical packet switch (OPS)en_HK
dc.subjectPerformance guaranteed schedulingen_HK
dc.subjectReconfiguration overheaden_HK
dc.subjectSpeedupen_HK
dc.titleTraffic scheduling in non-blocking optical packet switches with minimum delayen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1054-5921&volume=4&spage=2041&epage=2045&date=2005&atitle=Traffic+scheduling+in+non-blocking+optical+packet+switches+with+minimum+delayen_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/GLOCOM.2005.1578024en_HK
dc.identifier.scopuseid_2-s2.0-33846632791en_HK
dc.identifier.hkuros123432-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33846632791&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume4en_HK
dc.identifier.spage2041en_HK
dc.identifier.epage2045en_HK
dc.identifier.scopusauthoridWu, B=24605804500en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.customcontrol.immutablesml 151016 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats