A Scalable Protocol for Deadlock and Livelock Free Co-Allocation of Resources in Internet Computing

• Authors: Jonghun Park
• Venue: SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
• Year: 2003

Computing over the Internet is becoming increasingly popular. With the emerging infra-structures suchas Computational Grids, it is possible to develop applications that support various Internet-wide collaborations through seamlessly harnessing appropriate Internet resources. Yet, as Internet computing is becomingpervasive, it also presents a number of new challengesin designing efficient resource allocation protocol thatprovides clear directives on the acquisition of shared resources. In particular, the problem of co-allocating distributed Internet resources that span multiple administrative domains is complicated by the need for scalability, the availability of alternative co-allocation schemes,and the possibility of deadlock and livelock. Motivatedby this, this paper develops a new scalable protocol forfast co-allocation of Internet resources. The proposedprotocol is free from deadlock and livelock, and seeks toeffectively exploit the available alternative resource co-allocation schemes through parallelization of requestsfor required resources. Experimental results demonstrate that the proposed protocol yields a significant performance improvement over the existing deadlock prevention protocol.