Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/803
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWang, J-
dc.creatorCao, J-
dc.creatorLi, J-
dc.creatorWu, J-
dc.date.accessioned2014-12-11T08:23:06Z-
dc.date.available2014-12-11T08:23:06Z-
dc.identifier.isbn0-7695-2636-5-
dc.identifier.urihttp://hdl.handle.net/10397/803-
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.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.en_US
dc.rightsThis 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.en_US
dc.subjectBandwidthen_US
dc.subjectComputer simulationen_US
dc.subjectInformation managementen_US
dc.subjectInterneten_US
dc.subjectSchedulingen_US
dc.subjectTelecommunication systemsen_US
dc.titleAchieving bounded delay on message delivery in publish/subscribe systemsen_US
dc.typeConference Paperen_US
dc.identifier.doi10.1109/ICPP.2006.16-
dcterms.abstractPublish/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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationICPP 2006 : International Conference on Parallel Processing : 14-18 August 2006, Columbus, Ohio, p. 407-414-
dcterms.issued2006-
dc.identifier.isiWOS:000241495500045-
dc.identifier.scopus2-s2.0-34547492214-
dc.identifier.rosgroupidr34982-
dc.description.ros2006-2007 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryVoR alloweden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
bounded-delay_06.pdf161.93 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

168
Last Week
1
Last month
Citations as of Jul 7, 2024

Downloads

96
Citations as of Jul 7, 2024

SCOPUSTM   
Citations

8
Last Week
0
Last month
0
Citations as of Jul 11, 2024

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Jul 11, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.