Distributed Job Scheduling based on Multiple Constraints Anycast Routing

— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resources located in the access- or core network, sounds very promising. In a consumer-oriented environment, characterized by a large diversity in connected devices, a transparent networkbased request processing strategy offers a clear flexibility advantage, as the installation and configuration of extra software components on all client devices can be avoided. In this work, this is achieved by linking computational resources to an anycast group, which allows intermediate router nodes to decide upon the target server. It is shown in the paper that the anycast routing problem can be reduced to unicast routing. Consequently, unicast multiple constraints routing algorithms can be applied to compute an optimal path based on several server selection criteria, including server load, path delay, path cost, etc. For this...

• Type: Conference
• Year: 2006
• Where: BROADNETS
• Authors: Tim Stevens, Marc De Leenheer, Filip De Turck, Bart Dhoedt, Piet Demeester
• Keywords: Anycast Routing Problem, BROADNETS 2006, Computational Resources, Constraints Routing Algorithms