dc.creator | Tsoukatos, K. P. | en |
dc.creator | Makowski, A. M. | en |
dc.date.accessioned | 2015-11-23T10:52:27Z | |
dc.date.available | 2015-11-23T10:52:27Z | |
dc.date.issued | 2004 | |
dc.identifier.issn | 5361486 | |
dc.identifier.uri | http://hdl.handle.net/11615/34082 | |
dc.description.abstract | In communication networks, packets from the same source-destination pair may be routed along several paths and arrive at their receiver out of order. This often necessitates the use of a resequencing buffer at the destination. We consider such a network of parallel links with general packet arrival and service processes, and resequencing. We establish stochastic comparisons for the end-to-end delay (including the time at the resequencing buffer) in the heavy and light traffic regimes, between two different static scheduling mechanisms, namely Bernoulli and Round-Robin routing. The results show that Round-Robin outperforms Bernoulli routing, as yet another instance of the folk theorem that "determinism minimizes delays.". | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-4143049164&partnerID=40&md5=01bc5791d0dc88ac92e55e718373f372 | |
dc.subject | Bernoulli equations | en |
dc.subject | Buffer | en |
dc.subject | Resequencing | en |
dc.subject | Stochastic comparisons | en |
dc.subject | Computer simulation | en |
dc.subject | Mathematical models | en |
dc.subject | Poisson distribution | en |
dc.subject | Routers | en |
dc.subject | Servers | en |
dc.subject | Signal receivers | en |
dc.subject | Statistics | en |
dc.subject | Stochastic control systems | en |
dc.subject | Telecommunication links | en |
dc.subject | Telecommunication traffic | en |
dc.subject | Packet networks | en |
dc.title | Stochastic comparisons for a static routing problem with resequencing | en |
dc.type | conferenceItem | en |