Delay control and parallel admission algorithms for real-time anycast flow
Data(s) |
01/01/2004
|
---|---|
Resumo |
An anycast flow is a flow that can be connected to any one of the members in a group of designated (replicated) servers (called anycast group). In this paper, we derive a set of formulas for calculating the end-to-end delay bound for the anycast flows and present novel admission control algorithms for anycast flows with real-time constraints. Given such an anycast group, our algorithms can effectively select the paths for anycast flows' admission and connection based on the least end-to-end delay bounds evaluated. We also present a parallel admission control algorithm that can effectively calculate the available paths with a short delay bound for different destinations in the anycast group so that a best path with the shortest delay bound can be chosen.<br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Kluwer Academic Publishers |
Relação |
http://dro.deakin.edu.au/eserv/DU:30008658/n20040044.pdf http://dx.doi.org/10.1023/B:SUPE.0000026851.92978.ce |
Direitos |
2004, Kluwer Academic Publishers |
Palavras-Chave | #anycast flow #delay control #parallel admission algorithm |
Tipo |
Journal Article |