Name
Abstract | ||
|---|---|---|
Abstract: In this paper we propose a solution to the problem of calculating deterministic end-to-end delay bounds in arbitrary topology networks, which employ the Generalized Processor Sharing (GPS) discipline at each node. We give a general framework under network calculus [1] by extending the service curve model of GPS and constructing the end-to-end service curve for each session, from which exact values of delay and backlog bounds can be computed. Network internal traffic characterization and traffic shaping are applied to support local performance bound computation. Sessions are allowed to be arbitrary weighted and virtual feedback is handled by the iterative approach of [2]. Numerical examples are shown to illustrate our algorithmic approach for per-session end-to-end delay bound computation. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/ISCC.2001.935388 | ISCC |
Keywords | Field | DocType |
arbitrary topology network,deterministic end-to-end delay bound,algorithmic approach,generalized processor,backlog bound,iterative approach,per-session end-to-end delay,end-to-end delay bound calculation,service curve model,network internal traffic characterization,network calculus,end-to-end service curve,computer networks,network topology,global positioning system,iterative methods,computer network,end to end delay,generalized processor sharing,calculus,network nodes,feedback,traffic shaping,broadband networks | End-to-end delay,Iterative method,Computer science,Computer network,Network topology,Generalized processor sharing,Global Positioning System,Network calculus,Traffic shaping,Distributed computing,Computation | Conference |
ISSN | Citations | PageRank |
1530-1346 | 5 | 0.57 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| p barta | 1 | 5 | 0.57 |
| Felician Nemeth | 2 | 34 | 4.34 |
| Róbert Szabó | 3 | 116 | 16.29 |
| J. J. Bíró | 4 | 13 | 2.48 |