File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Minimum delay scheduling for performance guaranteed switches with optical fabrics

TitleMinimum delay scheduling for performance guaranteed switches with optical fabrics
Authors
KeywordsOptical switch
Performance guaranteed switching
Reconfiguration overhead
Scheduling
Speedup
Issue Date2009
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=50
Citation
Journal Of Lightwave Technology, 2009, v. 27 n. 16, p. 3453-3465 How to Cite?
AbstractWe consider traffic scheduling in performance guaranteed switches with optical fabrics to ensure 100% throughput and bounded packet delay. Each switch reconfiguration consumes a constant period of time called reconfiguration overhead, during which no packet can be transmitted across the switch. To minimize the packet delay bound for an arbitrary traffic matrix, the number of switch configurations in the schedule should be no larger than the switch size. This is called minimum delay scheduling, where the ideal minimum packet delay bound is determined solely by the total overhead of the switch reconfigurations. A speedup in the switch determines the actual packet delay bound, which decreases toward the ideal bound as the speedup increases. Our objective is to minimize the required speedup S schedule under a given actual packet delay bound. We propose a novel minimum delay scheduling algorithm quasi largest-entry-first (QLEF) to solve this problem. Compared with the existing minimum delay scheduling algorithms MIN and α- i-SCALE, QLEF dramatically cuts down the required S schedule bound. For example, QLEF only requires S schedule = 17.89 for N = 450, whereas MIN and α i-SCALE require S schedule = 37.13 and 27.82, respectively. This gives a significant performance gain of 52% over MIN and 36% over α i-SCALE. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/58794
ISSN
2015 Impact Factor: 2.567
2015 SCImago Journal Rankings: 2.006
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorHo, PHen_HK
dc.contributor.authorJiang, Xen_HK
dc.date.accessioned2010-05-31T03:37:01Z-
dc.date.available2010-05-31T03:37:01Z-
dc.date.issued2009en_HK
dc.identifier.citationJournal Of Lightwave Technology, 2009, v. 27 n. 16, p. 3453-3465en_HK
dc.identifier.issn0733-8724en_HK
dc.identifier.urihttp://hdl.handle.net/10722/58794-
dc.description.abstractWe consider traffic scheduling in performance guaranteed switches with optical fabrics to ensure 100% throughput and bounded packet delay. Each switch reconfiguration consumes a constant period of time called reconfiguration overhead, during which no packet can be transmitted across the switch. To minimize the packet delay bound for an arbitrary traffic matrix, the number of switch configurations in the schedule should be no larger than the switch size. This is called minimum delay scheduling, where the ideal minimum packet delay bound is determined solely by the total overhead of the switch reconfigurations. A speedup in the switch determines the actual packet delay bound, which decreases toward the ideal bound as the speedup increases. Our objective is to minimize the required speedup S schedule under a given actual packet delay bound. We propose a novel minimum delay scheduling algorithm quasi largest-entry-first (QLEF) to solve this problem. Compared with the existing minimum delay scheduling algorithms MIN and α- i-SCALE, QLEF dramatically cuts down the required S schedule bound. For example, QLEF only requires S schedule = 17.89 for N = 450, whereas MIN and α i-SCALE require S schedule = 37.13 and 27.82, respectively. This gives a significant performance gain of 52% over MIN and 36% over α i-SCALE. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=50en_HK
dc.relation.ispartofJournal of Lightwave Technologyen_HK
dc.subjectOptical switchen_HK
dc.subjectPerformance guaranteed switchingen_HK
dc.subjectReconfiguration overheaden_HK
dc.subjectSchedulingen_HK
dc.subjectSpeedupen_HK
dc.titleMinimum delay scheduling for performance guaranteed switches with optical fabricsen_HK
dc.typeArticleen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/JLT.2008.2005552en_HK
dc.identifier.scopuseid_2-s2.0-68349157355en_HK
dc.identifier.hkuros150303en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-68349157355&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume27en_HK
dc.identifier.issue16en_HK
dc.identifier.spage3453en_HK
dc.identifier.epage3465en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridWu, B=24605804500en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridHo, PH=7402211578en_HK
dc.identifier.scopusauthoridJiang, X=7404627101en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats