We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
Bo Zhang, Kai Han, Binoy Ravindran, E. Douglas Jen...
This paper describes the Stanford P2P Multicast (SPPM) streaming system that employs an overlay architecture specifically designed for low delay video applications. In order to p...
Pierpaolo Baccichet, Jeonghun Noh, Eric Setton, Be...
Most space-sharing resources presently operated by high performance computing centers employ some sort of batch queueing system to manage resource allocation to multiple users. In...
A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content...
Many real-time database systems are now being used in safety-critical applications, in which human lives or expensive machinery may be at stake. Transactions in real-time database...
Sang Hyuk Son, Robert C. Beckinger, David A. Baker