A bandwidth-sensitive update scheduling method for Internet push

We present the BUS (Bandwidth-sensitive Update Scheduling) method for WWW push proxies that actively sets different update schedules for various WWW push channels. Based on open protocols describing push objects, BUS optimizes the currency of the objects it delivers to the clients under the constraint of the available bandwidth. As a result, push traffic overflow is minimized with adequate gateway bandwidth reserved for critical non-push traffic. The BUS method also provides a mechanism to monitor client interest and conducts a dynamic proxy update for given channels if the client requests for these channels increase suddenly. In contrast to fixed schedule approaches, this dynamic update mechanism can better capture the dynamic changes (such as the financial activities) that are of interest to many clients.

[1]  Naoki Katoh,et al.  Resource Allocation Problems , 1998 .

[2]  Paula Sullenger,et al.  Push Technology , 2000 .

[3]  P. Borsook.  Data communications , 1994, IEEE Spectrum.

[4]  Fred Halsall,et al.  Data communications, computer networks and open systems (3. ed.) , 1995, Electronic-systems engineering series.

[5]  K. Tsukada,et al.  Data communications , 1981, IEEE Communications Magazine.

[6]  Adam Dingle,et al.  Web Cache Coherence , 1996, Comput. Networks.

[7]  Hermann A. Maurer,et al.  On Second Generation Hypermedia Systems , 1994, J. Univers. Comput. Sci..

[8]  Peter Parnes,et al.  The mWeb Presentation Framework , 1997, Comput. Networks.

[9]  Jacob R. Lorch,et al.  Making World Wide Web Caching Servers Cooperate , 1996, World Wide Web J..