During an off-peak hour of a day, a Mobile Terminal (MT) can stay in idle mode for long time as there is no incoming or outgoing packet. An idle MT can move from one location to another and the wireless access network keeps tracking the idle MT. Idle MTs need to assist the wireless access network for location update; so that, on call arrival the network can route the call successfully. Mean whi...

We consider a queueing loss system with heterogeneous skill based servers with arbitrary service distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. An arrival can only be assigned to a server that is both idle and eligible. Assuming exchangeable eligibility vectors and an idle time ordering assignment policy, th...

In this paper we present a brokerage system for using idle computing resources as a micro-currency for Web services hardly quantifyable with real currencies as downloading stock charts or accessing a search engine. The Locust (LOw cost Computing Utilizing Skimmed idle Time) system acts as a Broker for micro-payable services by demanding a part of the user’s idle computing resources in exchange ...

Shortest path computation is required by a large number of applications such as VLSI, transportation and communication networks. These applications, which are often very complex and have sparse networks, generally use parallel labeling shortest path algorithms. Such algorithms, when implemented on a distributed memory machine, require termination detection methods; these methods consist of some...