Introduction to Algorithms
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
IP Anycast: Point-to-(Any) Point Communication
IEEE Internet Computing
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
An Integrated Anycast End-to-End QoS Routing on DiffServ Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
QoS routing for anycast communications: motivation and an architecture for DiffServ networks
IEEE Communications Magazine
QoS routing granularity in MPLS networks
IEEE Communications Magazine
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
A survey of anycast in IPv6 networks
IEEE Communications Magazine
Load balancing routing with bandwidth-delay guarantees
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
ANFIS and agent based bandwidth and delay aware anycast routing in mobile ad hoc networks
Journal of Network and Computer Applications
Hi-index | 0.24 |
Anycast is the point-to-point communication between a single client and the nearest destination server identified by an anycast address in traditional best-effort networks such as the Internet. Conversely, an anycast service in a QoS-based network is required to choose a path with bandwidth guarantees and to select a server with capacity guarantees. This paper proposes an approach which integrates both a network layer anycasting service and an application layer anycasting service to select a path and server that satisfies the client QoS constraint in DiffServ networks. In order to perform a path selection algorithm, the proposed protocol uses the idea of residual capacity to select all paths which match the client bandwidth requirement. In order to perform the server selection process, each server resource management (SRM) uses the server weight of each server to select the best server that has sufficient capacity for the client request. Furthermore, the design of multiple SRMs eliminates the single-point-of-failure problem and increases reliability in a DiffServ network. The simulation results have shown that the proposed protocol has much faster server response times and has the lowest request blocking rate compared to other existing protocols, especially in the case where the traffic load is high.