File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.jnca.2011.10.011
- Scopus: eid_2-s2.0-82155166277
- WOS: WOS:000298338600042
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Load-balanced three-stage switch
Title | Load-balanced three-stage switch | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Authors | |||||||||||
Keywords | Load-Balanced Switch Ring Fairness Three-Stage Switch Two-Stage Switch | ||||||||||
Issue Date | 2012 | ||||||||||
Publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jnca | ||||||||||
Citation | Journal Of Network And Computer Applications, 2012, v. 35 n. 1, p. 502-509 How to Cite? | ||||||||||
Abstract | A load-balanced two-stage switch is scalable and can provide close to 100% throughput. Its major problem is that packets can be mis-sequenced when they arrive at outputs. In a recent work, the packet mis-sequencing problem is elegantly solved by a feedback-based switch architecture. In this paper, we extend the feedback-based switch from two-stage to three-stage for further cutting down average packet delay while still ensuring in-order packet delivery and close to 100% throughput. The basic idea is to use the third stage switch to map heavy flows to experience less middle-stage delays. To identity heavy flows, an adaptive traffic estimation algorithm is proposed. To ensure maxmin fairness in bandwidth allocation under any inadmissible traffic pattern, an efficient fair scheduler is devised. © 2011 Elsevier Ltd. All rights reserved. | ||||||||||
Persistent Identifier | http://hdl.handle.net/10722/155702 | ||||||||||
ISSN | 2023 Impact Factor: 7.7 2023 SCImago Journal Rankings: 2.417 | ||||||||||
ISI Accession Number ID |
Funding Information: This work was supported in part by Zhejiang Provincial Natural Science Foundation of China (No. Y1100388), Zhejiang Provincial Public Technology Research of China (No. 2010C31071), Fundamental Research Funds for the Central Universities (No. 2010QNA5032), National Science and Technology Major Project (No. 2011ZX03003-003-03). | ||||||||||
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hu, B | en_US |
dc.contributor.author | Yeung, KL | en_US |
dc.contributor.author | Zhang, Z | en_US |
dc.date.accessioned | 2012-08-08T08:34:53Z | - |
dc.date.available | 2012-08-08T08:34:53Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | Journal Of Network And Computer Applications, 2012, v. 35 n. 1, p. 502-509 | en_US |
dc.identifier.issn | 1084-8045 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155702 | - |
dc.description.abstract | A load-balanced two-stage switch is scalable and can provide close to 100% throughput. Its major problem is that packets can be mis-sequenced when they arrive at outputs. In a recent work, the packet mis-sequencing problem is elegantly solved by a feedback-based switch architecture. In this paper, we extend the feedback-based switch from two-stage to three-stage for further cutting down average packet delay while still ensuring in-order packet delivery and close to 100% throughput. The basic idea is to use the third stage switch to map heavy flows to experience less middle-stage delays. To identity heavy flows, an adaptive traffic estimation algorithm is proposed. To ensure maxmin fairness in bandwidth allocation under any inadmissible traffic pattern, an efficient fair scheduler is devised. © 2011 Elsevier Ltd. All rights reserved. | en_US |
dc.language | eng | en_US |
dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jnca | en_US |
dc.relation.ispartof | Journal of Network and Computer Applications | en_US |
dc.subject | Load-Balanced Switch | en_US |
dc.subject | Ring Fairness | en_US |
dc.subject | Three-Stage Switch | en_US |
dc.subject | Two-Stage Switch | en_US |
dc.title | Load-balanced three-stage switch | en_US |
dc.type | Article | en_US |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_US |
dc.identifier.authority | Yeung, KL=rp00204 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/j.jnca.2011.10.011 | en_US |
dc.identifier.scopus | eid_2-s2.0-82155166277 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-82155166277&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 35 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.spage | 502 | en_US |
dc.identifier.epage | 509 | en_US |
dc.identifier.isi | WOS:000298338600042 | - |
dc.publisher.place | United Kingdom | en_US |
dc.identifier.scopusauthorid | Hu, B=36617158500 | en_US |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_US |
dc.identifier.scopusauthorid | Zhang, Z=35263460700 | en_US |
dc.identifier.issnl | 1084-8045 | - |