A scalable protocol for deadlock and livelock free co-allocation of resources in Internet computing

Computing over the Internet is becoming increasingly popular. With the emerging infrastructures such as 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 becoming pervasive, it also presents a number of new challenges in designing efficient resource allocation protocol that provides 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. Motivated by this, this paper develops a new scalable protocol for fast co-allocation of Internet resources. The proposed protocol is free from deadlock and livelock, and seeks to effectively exploit the available alternative resource co-allocation schemes through parallelization of requests for required resources. Experimental results demonstrate that the proposed protocol yields a significant performance improvement over the existing deadlock prevention protocol.