File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2005.1494657
- Scopus: eid_2-s2.0-24144472969
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Scheduling optical packet switches with minimum number of configurations
Title | Scheduling optical packet switches with minimum number of configurations |
---|---|
Authors | |
Keywords | Optical packet switch(OPS) Performance guaranteed scheduling Reconfiguration overhead Speedup |
Issue Date | 2005 |
Publisher | IEEE. 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? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/54059 |
ISSN | 2023 SCImago Journal Rankings: 0.861 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wu, B | en_HK |
dc.contributor.author | Yeung, KL | en_HK |
dc.date.accessioned | 2009-04-03T07:35:40Z | - |
dc.date.available | 2009-04-03T07:35:40Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Ieee International Conference On Communications, 2005, v. 3, p. 1830-1835 | en_HK |
dc.identifier.issn | 0536-1486 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/54059 | - |
dc.description.abstract | In 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.language | eng | en_HK |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104 | en_HK |
dc.relation.ispartof | IEEE International Conference on Communications | 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. | - |
dc.subject | Optical packet switch(OPS) | en_HK |
dc.subject | Performance guaranteed scheduling | en_HK |
dc.subject | Reconfiguration overhead | en_HK |
dc.subject | Speedup | en_HK |
dc.title | Scheduling optical packet switches with minimum number of configurations | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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+configurations | en_HK |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_HK |
dc.identifier.authority | Yeung, KL=rp00204 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICC.2005.1494657 | en_HK |
dc.identifier.scopus | eid_2-s2.0-24144472969 | en_HK |
dc.identifier.hkuros | 101366 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-24144472969&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 3 | en_HK |
dc.identifier.spage | 1830 | en_HK |
dc.identifier.epage | 1835 | en_HK |
dc.identifier.scopusauthorid | Wu, B=24605804500 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.issnl | 0536-1486 | - |