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 network-based 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 purpose, we envision the SAMCRA algorithm. A new evaluation ordering strategy for previously computed sub-paths is introduced, which guarantees optimality for the complete SAMCRA path between source and destination. Simulation results show that an effective distribution of the job scheduling requests over the available resources can be achieved by applying the described algorithm