File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Scheduling optical packet switches with minimum number of configurations

TitleScheduling optical packet switches with minimum number of configurations
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=1000104
Citation
Ieee International Conference On Communications, 2005, v. 3, p. 1830-1835 How to Cite?
AbstractIn order to achieve the minimum traffic delay in a performance guaranteed optical packet switch (OPS) with reconfiguration overhead, the switch fabric has to use the minimum number of configurations (i.e. N configurations where N is the switch size) for traffic scheduling. This requires a very high speedup in the switch fabric to compensate for the loss in scheduling efficiency. The high speedup requirement makes the idea of using N configurations (to schedule the traffic) impractical under current technology. In this paper, we propose a new scheduling algorithm called α i-SCALE to lower the speedup required. Compared with the existing MIN algorithm [5], α i- SCALE succeeds in pushing the speedup bound (i.e. worst-case speedup requirement) to a much lower level. For example, when N=200, the speedup bound required to compensate the loss in scheduling efficiency is 30.75 for MIN, whereas 23.45 is sufficient for our α i-SCALE. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/54059
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2009-04-03T07:35:40Z-
dc.date.available2009-04-03T07:35:40Z-
dc.date.issued2005en_HK
dc.identifier.citationIeee International Conference On Communications, 2005, v. 3, p. 1830-1835en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/54059-
dc.description.abstractIn order to achieve the minimum traffic delay in a performance guaranteed optical packet switch (OPS) with reconfiguration overhead, the switch fabric has to use the minimum number of configurations (i.e. N configurations where N is the switch size) for traffic scheduling. This requires a very high speedup in the switch fabric to compensate for the loss in scheduling efficiency. The high speedup requirement makes the idea of using N configurations (to schedule the traffic) impractical under current technology. In this paper, we propose a new scheduling algorithm called α i-SCALE to lower the speedup required. Compared with the existing MIN algorithm [5], α i- SCALE succeeds in pushing the speedup bound (i.e. worst-case speedup requirement) to a much lower level. For example, when N=200, the speedup bound required to compensate the loss in scheduling efficiency is 30.75 for MIN, whereas 23.45 is sufficient for our α 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=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
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.subjectOptical packet switch(OPS)en_HK
dc.subjectPerformance guaranteed schedulingen_HK
dc.subjectReconfiguration overheaden_HK
dc.subjectSpeedupen_HK
dc.titleScheduling optical packet switches with minimum number of configurationsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=3&spage=1830&epage=1835&date=2005&atitle=Scheduling+optical+packet+switches+with+minimum+number+of+configurationsen_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/ICC.2005.1494657en_HK
dc.identifier.scopuseid_2-s2.0-24144472969en_HK
dc.identifier.hkuros101366-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-24144472969&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3en_HK
dc.identifier.spage1830en_HK
dc.identifier.epage1835en_HK
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