13TH IEEE International Conference on Network Protocols (ICNP'05)最新文献

筛选
英文 中文
Optimizing event distribution in publish/subscribe systems in the presence of policy-constraints and composite events 在存在策略约束和组合事件的情况下,优化发布/订阅系统中的事件分布
13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.31
Weifeng Chen, J. Kurose, D. Towsley, Zihui Ge
{"title":"Optimizing event distribution in publish/subscribe systems in the presence of policy-constraints and composite events","authors":"Weifeng Chen, J. Kurose, D. Towsley, Zihui Ge","doi":"10.1109/ICNP.2005.31","DOIUrl":"https://doi.org/10.1109/ICNP.2005.31","url":null,"abstract":"In the publish/subscribe paradigm, information is disseminated from publishers to subscribers that are interested in receiving the information. In practice, information dissemination is often restricted by policy constraints due to concerns such as security or confidentiality agreement. Meanwhile, to avoid overwhelming subscribers by the vast amount of primitive information, primitive pieces of information can be combined at so-called brokers in the network, a process called composition. Information composition provides subscribers the desirable ability to express interests in an efficiently selective way. In this paper, we formulate the min-cost event distribution problem in pub/sub systems with policy constraints and information composition. Our goal is to minimize the total cost of event transmission while satisfying policy constraints and enabling information composition. This optimization problem is shown to be NP-complete. Our simulation study shows that our heuristics work efficiently, especially in a policy-constrained system. We also find that by increasing the number of broker nodes in a pub/sub system, we are able to reduce the total cost of event delivery.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114779430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Landmark guided forwarding 地标引导转船
13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.21
Menghow Lim, A. Chesterfield, J. Crowcroft, J. Chesterfield
{"title":"Landmark guided forwarding","authors":"Menghow Lim, A. Chesterfield, J. Crowcroft, J. Chesterfield","doi":"10.1109/ICNP.2005.21","DOIUrl":"https://doi.org/10.1109/ICNP.2005.21","url":null,"abstract":"In this paper we focus on the problems of maintaining ad hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The common approach among existing wireless ad hoc routing solutions is to establish a global optimal path between a source and a destination. We argue that establishing a globally optimal path is both unreliable and unsustainable as the network diameter, traffic volume and number of nodes all increase in the presence of moderate node mobility. To address this we propose landmark guided forwarding (LGF), a protocol that provides a hybrid solution of topological and geographical routing algorithms. We demonstrate that LGF is adaptive to unstable connectivity and scalable to large networks. Our results indicate therefore that landmark guided forwarding converges much faster, scales better and adapts well within a dynamic wireless ad hoc environment in comparison to existing solutions","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128719407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Priority pricing in utility fair networks 公用事业公平网络中的优先定价
13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.33
T. Harks, T. Poschwatta
{"title":"Priority pricing in utility fair networks","authors":"T. Harks, T. Poschwatta","doi":"10.1109/ICNP.2005.33","DOIUrl":"https://doi.org/10.1109/ICNP.2005.33","url":null,"abstract":"This paper deals with a new pricing approach in utility fair networks, where the user's application is associated with a utility function. We allow users to have concave as well as non-concave utility functions. Bandwidth is allocated such that utility values of applications are shared fairly. In this work, we derive a fairness measure for utility functions that takes their specific shape into account. Based on this fairness measure, we present a simple pricing mechanism: the user announces his utility function and the network charges in accordance with the fairness measure. Then, we apply our pricing mechanism to a content provider's network. In our model customers want to scale their utilities to achieve their goals (e.g. file download, multimedia streaming) in a cost optimal way. In this regard, we formulate a download problem with predefined, deadline as an optimal control problem and account for dynamic changes of the state of congestion by using (online) model predictive control techniques. Finally, we develop online control strategies and implement them in a user agent (UA) that automatically scales the utilities.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127542519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 32
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信