File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.1999.765516
- Scopus: eid_2-s2.0-0141896871
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A resequencing model for high speed networks
Title | A resequencing model for high speed networks |
---|---|
Authors | |
Keywords | Communications |
Issue Date | 1999 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104 |
Citation | The 1999 IEEE International Conference on Communications, Vancouver, BC., Canada, 6-10 June 1999. In IEEE International Conference on Communications, 1999, v. 2, p. 1239-1243 How to Cite? |
Abstract | In this paper, we propose a framework to study the resequencing mechanism in high speed networks. This framework allows us to estimate the packet resequencing delay, the total packet delay, and the resequencing buffer occupancy distributions when data traffic is dispersed on multiple disjoint paths. In contrast to most of the existing work, the estimation of the end-to-end path delay distribution is decoupled from the queueing model for resequencing. This leads to a simple yet general model, which can be used with other measurement-based tools for estimating the end-to-end path delay distribution to find an optimal split of traffic. We consider a multiple-node M/M/1 tandem network as a path model. When end-to-end path delays are Gaussian distributed, our results show that the packet resequencing delay, the total packet delay, and the resequencing buffer occupancy drop when the traffic is spread over a larger number of homogeneous paths, although the network performance improvement quickly saturates when the number of paths used increases. We find that the number of paths used in multipath routing should be small, say up to three. Besides, an optimal split of traffic occurs at paths with equal loads. |
Persistent Identifier | http://hdl.handle.net/10722/46090 |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Leung, KC | en_HK |
dc.contributor.author | Li, VOK | en_HK |
dc.date.accessioned | 2007-10-30T06:42:20Z | - |
dc.date.available | 2007-10-30T06:42:20Z | - |
dc.date.issued | 1999 | en_HK |
dc.identifier.citation | The 1999 IEEE International Conference on Communications, Vancouver, BC., Canada, 6-10 June 1999. In IEEE International Conference on Communications, 1999, v. 2, p. 1239-1243 | en_HK |
dc.identifier.issn | 1044-4556 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/46090 | - |
dc.description.abstract | In this paper, we propose a framework to study the resequencing mechanism in high speed networks. This framework allows us to estimate the packet resequencing delay, the total packet delay, and the resequencing buffer occupancy distributions when data traffic is dispersed on multiple disjoint paths. In contrast to most of the existing work, the estimation of the end-to-end path delay distribution is decoupled from the queueing model for resequencing. This leads to a simple yet general model, which can be used with other measurement-based tools for estimating the end-to-end path delay distribution to find an optimal split of traffic. We consider a multiple-node M/M/1 tandem network as a path model. When end-to-end path delays are Gaussian distributed, our results show that the packet resequencing delay, the total packet delay, and the resequencing buffer occupancy drop when the traffic is spread over a larger number of homogeneous paths, although the network performance improvement quickly saturates when the number of paths used increases. We find that the number of paths used in multipath routing should be small, say up to three. Besides, an optimal split of traffic occurs at paths with equal loads. | 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 | - |
dc.rights | ©1999 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 | Communications | en_HK |
dc.title | A resequencing model for high speed networks | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=2&spage=1239&epage=1243&date=1999&atitle=A+resequencing+model+for+high+speed+networks | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICC.1999.765516 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0141896871 | - |
dc.identifier.hkuros | 44315 | - |
dc.identifier.volume | 2 | - |
dc.identifier.spage | 1239 | - |
dc.identifier.epage | 1243 | - |
dc.identifier.issnl | 1044-4556 | - |