File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/GLOCOM.2006.346
- Scopus: eid_2-s2.0-50949131110
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Minimum delay scheduling in scalable hybrid electronic/optical packet switches
Title | Minimum delay scheduling in scalable hybrid electronic/optical packet switches |
---|---|
Authors | |
Keywords | Minimum delay scheduling Performance guaranteed switching Reconfiguration overhead Speedup bound |
Issue Date | 2006 |
Publisher | IEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308 |
Citation | Proceedings of the Global Telecommunications Conference, 2006 (GLOBECOM 2006), San Francisco, CA, USA, 27 November - 1 December 2006 How to Cite? |
Abstract | A hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bounded packet delay), at the cost of speedup. In particular, minimum delay performance can be achieved if an algorithm can always find a schedule of no more than N configurations for any input traffic matrix, where N is the switch size. Various minimum delay scheduling algorithms (MIN, α i-SCALE and QLEF) are proposed. Among them, QLEF requires the lowest speedup bound. In this paper, we show that the existing speedup bound for QLEF is not tight enough. A new bound which is 10% lower than the existing one is derived. © 2006 IEEE. |
Description | In Session: Next Generation Networks: NXG-05: Switching and Routing-I: article no. NXG05-6 |
Persistent Identifier | http://hdl.handle.net/10722/99457 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wu, B | en_HK |
dc.contributor.author | Yeung, KL | en_HK |
dc.date.accessioned | 2010-09-25T18:31:04Z | - |
dc.date.available | 2010-09-25T18:31:04Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | Proceedings of the Global Telecommunications Conference, 2006 (GLOBECOM 2006), San Francisco, CA, USA, 27 November - 1 December 2006 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/99457 | - |
dc.description | In Session: Next Generation Networks: NXG-05: Switching and Routing-I: article no. NXG05-6 | - |
dc.description.abstract | A hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bounded packet delay), at the cost of speedup. In particular, minimum delay performance can be achieved if an algorithm can always find a schedule of no more than N configurations for any input traffic matrix, where N is the switch size. Various minimum delay scheduling algorithms (MIN, α i-SCALE and QLEF) are proposed. Among them, QLEF requires the lowest speedup bound. In this paper, we show that the existing speedup bound for QLEF is not tight enough. A new bound which is 10% lower than the existing one is derived. © 2006 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.publisher | IEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308 | - |
dc.relation.ispartof | Globecom. IEEE Conference and Exhibition | en_HK |
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. | - |
dc.subject | Minimum delay scheduling | en_HK |
dc.subject | Performance guaranteed switching | en_HK |
dc.subject | Reconfiguration overhead | en_HK |
dc.subject | Speedup bound | en_HK |
dc.title | Minimum delay scheduling in scalable hybrid electronic/optical packet switches | en_HK |
dc.type | Conference_Paper | 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 | - |
dc.identifier.doi | 10.1109/GLOCOM.2006.346 | en_HK |
dc.identifier.scopus | eid_2-s2.0-50949131110 | en_HK |
dc.identifier.hkuros | 134481 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-50949131110&selection=ref&src=s&origin=recordpage | en_HK |
dc.description.other | Proceedings of the Global Telecommunications Conference, 2006 (GLOBECOM 2006), San Francisco, CA, USA, 27 November - 1 December 2006 | - |
dc.identifier.scopusauthorid | Wu, B=24605804500 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |