Erlang capacity and uniform approximations for shared unbuffered resources
IEEE/ACM Transactions on Networking (TON)
Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of multi-path routing
IEEE/ACM Transactions on Networking (TON)
A framework for scalable global IP-anycast (GIA)
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A Routing Protocol for Anycast Messages
IEEE Transactions on Parallel and Distributed Systems
Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
Connection Establishment for Multi-Party Real-Time Communication
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Measurement-Based Usage Charges in Comminucations Networks
Operations Research
Static priority scheduling for ATM networks
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Multi-Path Routing combined with Resource Reservation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
ATM network design and optimization: a multirate loss network framework
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Integrated routing algorithms for anycast messages
IEEE Communications Magazine
QoS routing for anycast communications: motivation and an architecture for DiffServ networks
IEEE Communications Magazine
A Mutual Anonymous Peer-to-Peer Protocol Design
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering
IEEE Transactions on Parallel and Distributed Systems
An adaptive admission control policy for geographically distributed web systems
Proceedings of the 2nd international conference on Scalable information systems
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
An efficient anycast scheme for discovering K services in mobile ad-hoc networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A distributed k-anycast routing protocol based on mobile agents
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Next generation networks architecture and layered end-to-end qos control
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
A random walk based anonymous peer-to-peer protocol design
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
Anycasting has recently become an important research topic, especially for replicated servers. With anycasting, applications can request the "nearest驴 server for provision of desired (multimedia) service. In this paper, we study efficient Distributed Admission Control (DAC) for anycast flows. We focus on algorithms that perform destination selection and efficient path establishment. Taking advantage of anycasting, our distributed algorithms differ from each other in their dependence on system status information. Performance data obtained through mathematical analysis and simulations show that, in terms of admission probabilities, DAC systems that are based on local status information have performance levels close to those that utilize global and dynamic status information. This renders our DAC algorithms useful not only for the network layer, but also for the application layer admission control for anycast flows.