发布求助
文献互助 智能选刊 最新文献

Proceedings. Eleventh International Conference on Computer Communications and Networks最新文献

筛选
英文 中文
HySOR: group key management with collusion-scalability tradeoffs using a hybrid structuring of receivers HySOR:使用接收器的混合结构进行合算可伸缩性权衡的组密钥管理
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043066
Jinliang Fan, P. Judge, M. Ammar
{"title":"HySOR: group key management with collusion-scalability tradeoffs using a hybrid structuring of receivers","authors":"Jinliang Fan, P. Judge, M. Ammar","doi":"10.1109/ICCCN.2002.1043066","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043066","url":null,"abstract":"One problem in securing group communication is the scalability of group key management in dynamic multicast sessions. The main challenge arises when a member leaves the multicast session and a rekeying of the group is required to prevent the departing member from accessing the information being multicast after they leave. Recent research developed the logical key hierarchy (LKH) protocol which uses a tree structuring of receivers and requires O(log(n)) rekeying messages when a member leaves. It has also been demonstrated that /spl Omega/(log(n)) is the best one can achieve if strict confidentiality and non-collusion are required. While strict non-collusion is required for some highly sensitive data, we argue that some commercial content delivery applications will be extremely cost sensitive and willing to tolerate some small level of collusion. In this paper we consider the question of how one might trade off the message cost of rekeying with some increased vulnerability to collusion. We consider a range of protocols. In one extreme is LKH which is completely immune from collusion. On the other extreme is a protocol based on the linear ordering of receivers (LORE), which requires O(1) messages for rekeying but in which any two receivers can collude. We describe a scheme using a hybrid structuring of receivers (HySOR) which is tunable between the LKH and LORE extremes and by which one can trade off some vulnerability to collusion for a decrease in rekeying message cost. We provide analytical as wen as simulation results to investigate the performance of HySOR and its tunability along the collusion/scalability spectrum.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127078179","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}
引用次数: 22
An efficient path selection algorithm for on-demand link-state hop-by-hop routing 一种有效的按需链路状态逐跳路由选择算法
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043125
Soumya Roy, J. Garcia-Luna-Aceves
{"title":"An efficient path selection algorithm for on-demand link-state hop-by-hop routing","authors":"Soumya Roy, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2002.1043125","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043125","url":null,"abstract":"Traditional routing protocols based on link-state information form a network topology through the exchange of link-state information by flooding or by reporting partial topology information and compute shortest routes to each reachable destination using a path-selection algorithm like Dijkstra's algorithm or the Bellman-Ford algorithm. However, in an on-demand link-state routing protocol, no one node needs to know the paths to every other node in the network. Accordingly, when a node chooses a next hop for a given destination, it must be true that the next hop has reported a path to the same destination; otherwise, packets sent through that node would be dropped. We present a new path-selection algorithm that unlike traditional shortest path algorithms, computes shortest paths with the above on-demand routing constraint.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116844292","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}
引用次数: 9
Performance analysis of software agent communication in slow wireless networks 慢速无线网络中软件代理通信性能分析
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043091
Heikki Helin, M. Laukkanen
{"title":"Performance analysis of software agent communication in slow wireless networks","authors":"Heikki Helin, M. Laukkanen","doi":"10.1109/ICCCN.2002.1043091","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043091","url":null,"abstract":"In wireless environments, the communication should be tailored to provide an efficient use of scarce and fluctuating data communication resources. In this paper we consider software agent communication in these environments. We introduce a layered model of agent communication in the Foundation for Intelligent Physical Agents (FIPA) agent architecture context, and provide a performance analysis of the most important layers of this model.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130378088","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}
引用次数: 13
Optimizing flow control for buffered switches 优化流量控制缓冲开关
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043103
F. Gramsamer, M. Gusat, R. Luijten
{"title":"Optimizing flow control for buffered switches","authors":"F. Gramsamer, M. Gusat, R. Luijten","doi":"10.1109/ICCCN.2002.1043103","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043103","url":null,"abstract":"We address a problem often neglected in the presentation of credit flow control (FC) schemes for buffered switches, namely the issue of FC bandwidth and FC optimization, i.e. how many and which credits to return per packet cycle. Under the assumption of bursty traffic with uniform destinations, we show via simulations that, independent of switch size and without loss in performance, the number of credits to be returned can be reduced to one. We further introduce the notion of credit contention and credit scheduling. We analyze four credit scheduling strategies under varying system and buffer size. Our results demonstrate that, with a proper credit scheduler in place, contention resolution is resolved much faster than with conventional schemes. Our findings suggest that scheduling of credits is a means for the switch to determine its future arrivals during contention phases.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124197692","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}
引用次数: 8
Facilitating match-making service in ad hoc and sensor networks using pseudo quorum 利用伪仲裁促进自组网和传感器网络中的配对服务
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043037
I. Aydin, Chien-Chung Shen
{"title":"Facilitating match-making service in ad hoc and sensor networks using pseudo quorum","authors":"I. Aydin, Chien-Chung Shen","doi":"10.1109/ICCCN.2002.1043037","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043037","url":null,"abstract":"In a match-making system, sources (producers) advertise generated data without any particular destination in mind. Destinations (consumers) are determined based on their interests (via subscriptions) in receiving the produced data. Advertisements and subscriptions are matched by the underlying network service, so that routing is based on the content of messages. We propose to facilitate a match-making capability in ad hoc and sensor networks by adapting the idea of a quorum system. A quorum system is formed by organizing nodes into subsets called quorums, where every two quorums intersect and no quorum includes another quorum. To accommodate node mobility and network scale, we propose that producers and consumers systematically forward their advertisement and subscription messages to form 'pseudo' quorums, where they are matched at intersecting nodes. Simulation results show that the pseudo quorum based matchmaking system achieves a very high matching rate with much less messaging overhead as compared to that of event and query flooding.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"26 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134560379","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}
引用次数: 62
A triple layer location management strategy for wireless cellular networks 无线蜂窝网络的三层位置管理策略
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043111
Guangbin Fan, I. Stojmenovic, Jingyuan Zhang
{"title":"A triple layer location management strategy for wireless cellular networks","authors":"Guangbin Fan, I. Stojmenovic, Jingyuan Zhang","doi":"10.1109/ICCCN.2002.1043111","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043111","url":null,"abstract":"Location areas is a popular location management scheme in cellular networks. In the location areas scheme, a mobile terminal updates its location whenever it moves into a cell that belongs to a new location area. However, no matter how the location areas are designed, the location update ping-pong effect exists when a mobile terminal moves back and forth between two location areas. The paper defines a new kind of ping-pong effect, referred to as the generalized ping-pong effect, and shows that it accounts for a non-negligible portion of the total location update cost. Although several strategies have been proposed to reduce the ping-pong effect in the literature, they either fail to eliminate the generalized ping-pong effect or introduce a larger paging cost. The paper proposes a triple-layer location management strategy to eliminate the generalized ping-pong effect, therefore greatly reducing the total location update cost. Simulation results show that the triple-layer strategy outperforms the existing schemes designed to reduce the ping-pong effect.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133744845","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}
引用次数: 19
A novel MAC layer protocol for space division multiple access in wireless ad hoc networks 一种新的无线自组织网络空分多址的MAC层协议
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043136
Dhananjay Lal, Rishi Toshniwal, R. Radhakrishnan, D. Agrawal, J. Caffery
{"title":"A novel MAC layer protocol for space division multiple access in wireless ad hoc networks","authors":"Dhananjay Lal, Rishi Toshniwal, R. Radhakrishnan, D. Agrawal, J. Caffery","doi":"10.1109/ICCCN.2002.1043136","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043136","url":null,"abstract":"Recently, MAC protocols using directional antennas for wireless ad hoc networks that are based on and similar to IEEE 802.11 type WLAN have been proposed. These protocols, however, are unable to attain substantial performance improvements because they do not enable the nodes to perform multiple simultaneous transmissions/receptions. In this paper, we propose a MAC layer protocol that exploits space division multiple access, thus using the property of directional reception to receive more than one packet from spatially separated transmitter nodes (equipped with smart antenna systems). Our simulation results show that drastic throughput improvements may be achieved through this scheme.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114928649","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}
引用次数: 82
Effect of delay spike on SCTP, TCP Reno, and Eifel in a wireless mobile environment 无线移动环境中延迟尖峰对SCTP、TCP Reno和eiffel的影响
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043128
S. Fu, Mohammed Atiquzzaman, W. Ivancic
{"title":"Effect of delay spike on SCTP, TCP Reno, and Eifel in a wireless mobile environment","authors":"S. Fu, Mohammed Atiquzzaman, W. Ivancic","doi":"10.1109/ICCCN.2002.1043128","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043128","url":null,"abstract":"Eifel has been proposed as a solution to enhance the performance of TCP during delay spikes in a wireless mobile environment. This paper evaluates and compares the performance of SCTP, TCP, and Eifel during delay spikes. We have shown that although Eifel performs better than TCP Reno and SCTP when there are no packet losses, the opposite is true when packets are lost in the presence of delay spikes. Our results also show that a higher link bandwidth does not always increase the data throughput of SCTP, TCP Reno, and Eifel.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127184343","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}
引用次数: 43
Multicast virtual topologies in WDM paths and rings with splitting loss 具有分割损耗的WDM路径和环中的组播虚拟拓扑
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043085
R. Libeskind-Hadas, Jeff Hartline, K. Dresner, Ethan W. Drucker, K. J. Ray
{"title":"Multicast virtual topologies in WDM paths and rings with splitting loss","authors":"R. Libeskind-Hadas, Jeff Hartline, K. Dresner, Ethan W. Drucker, K. J. Ray","doi":"10.1109/ICCCN.2002.1043085","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043085","url":null,"abstract":"This paper addresses the problem of constructing optimal virtual topologies for multicast communication in optical networks employing wavelength-division multiplexing (WDM). For concreteness, we use the average hop distance as the metric of optimality. WDM networks supporting multicast communication typically employ multicast-capable switches which permit a path entering a switch on an incoming wavelength to be replicated or \"split\" optically to one or more output links. This splitting incurs a power loss which is frequently neglected in existing heuristics and algorithms. In this paper we show that the problem of finding optimal virtual topologies with splitting loss constraints can be solved in polynomial time in directed paths and rings, although the problem is NP-complete for general topologies.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127233637","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}
引用次数: 9
An analytical model for virtual topology reconfiguration in optical networks and a case study 光网络中虚拟拓扑重构的分析模型及实例研究
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043082
Xi Yang, B. Ramamurthy
{"title":"An analytical model for virtual topology reconfiguration in optical networks and a case study","authors":"Xi Yang, B. Ramamurthy","doi":"10.1109/ICCCN.2002.1043082","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043082","url":null,"abstract":"An analytical model for virtual topology reconfiguration (VTR) in optical networks is developed. It aims at the optical networks with a circuit-based data plane and an IP-like control plane. By identifying and analyzing the important factors impacting the network performance due to VTR operations on both planes, we can compare the benefits and penalties of different VTR algorithms and policies. The best VTR scenario can be adaptively chosen from a set of such algorithms and policies according to the real-time network situations. For this purpose, a cost model integrating all these factors is created to provide a comparison criterion independent of any specific VTR algorithm and policy. A case study based on simulation experiments is conducted to illustrate the application of our models.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130532426","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}
引用次数: 14
下一页 尾页
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学术官方微信