Please use this identifier to cite or link to this item:
|Title:||Achieving bounded delay on message delivery in publish/subscribe systems|
|Publisher:||IEEE Computer Society|
|Source:||ICPP 2006 : International Conference on Parallel Processing : 14-18 August 2006, Columbus, Ohio, p. 407-414 How to cite?|
|Abstract:||Publish/subscribe (pub/sub) systems are very suitable for the dissemination of dynamic information over the Internet. As dynamic information is usually characterized by a short lifetime, both publishers and subscribers may specify the delay requirement on message delivery. Although existing pub/sub systems can easily be extended so that publishers and subscribers can specify their delay requirements, it remains a challenging problem to improve the efficiency of pub/sub systems so that as many messages can be successfully delivered as possible, while the network traffic does not increase significantly. In this paper, we propose an efficient approach for pub/sub systems to achieve bounded delay on message delivery. Three message scheduling strategies are proposed for the system to make use of available bandwidth efficiently. Simulation results show that our strategies enable subscribers to receive significantly more valid messages than traditional strategies, while the network traffic just increases slightly.|
|Rights:||© 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of May 20, 2016
WEB OF SCIENCETM
Citations as of May 18, 2016
Checked on May 22, 2016
Checked on May 22, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.