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

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
Measurement-based end to end latency performance prediction for SLA verification 基于测量的端到端延迟性能预测，用于SLA验证
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043100
C. M. Leung, J. Schormans
{"title":"Measurement-based end to end latency performance prediction for SLA verification","authors":"C. M. Leung, J. Schormans","doi":"10.1109/ICCCN.2002.1043100","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043100","url":null,"abstract":"End-to-end delay is one of the important metrics used to define perceived quality of service. Measurement is a fundamental tool of network management to assess the performance of the network. The conventional approach to measure the performance metrics is on an intrusive basis that may cause extra-burden to the network. In contrast to this, our scheme can be considered as non-intrusive. The main idea relies on the knowledge of the queuing behaviour. The queue length is non-intrusively monitored, and then we capture the parameters of the queue state distribution of every queue along the path in order to deduce the end-to-end delay performance.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"47 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":"134244450","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
Minimizing end-to-end delays in Bluetooth scatternet with a slave/slave bridge 使用从/从桥接最小化蓝牙散射网的端到端延迟
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043139
V. Mišić, J. Misic
{"title":"Minimizing end-to-end delays in Bluetooth scatternet with a slave/slave bridge","authors":"V. Mišić, J. Misic","doi":"10.1109/ICCCN.2002.1043139","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043139","url":null,"abstract":"Using the theory of queues with vacations, we analyze the end-to-end packet delays, for both intra- and inter-piconet traffic, in a Bluetooth scatternet formed by two piconets connected with a slave/slave bridge. We analyze the impact of different values of scatternet parameters and investigate the possibility of choosing some of those, in particular the time interval between bridge exchanges, so as to minimize the aforementioned delays. We show that the minimization of delay should be based on inter-piconet traffic, since the intra-piconet traffic delay is less sensitive to the actual value of the time interval between bridge exchanges.","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":"132995157","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}
引用次数: 18
Enhancing security via stochastic routing 通过随机路由增强安全性
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043046
S. Bohacek, J. Hespanha, K. Obraczka, Junsoo Lee, Chansook Lim
{"title":"Enhancing security via stochastic routing","authors":"S. Bohacek, J. Hespanha, K. Obraczka, Junsoo Lee, Chansook Lim","doi":"10.1109/ICCCN.2002.1043046","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043046","url":null,"abstract":"Shortest path routing leaves connections at risk of interception and eavesdropping since the path over which data packets travel is fairly predictable and easy to determine. To improve routing security, we propose a proactive mechanism, which we call secure stochastic routing, that explores the existence of multiple routes and forces packets to take alternative paths probabilistically. We investigate game theoretic techniques to develop routing policies which make interception and eavesdropping maximally difficult. Through simulations, we validate our theoretical results and show how the resulting routing algorithms perform in terms of the security/delay/throughput trade-off. We observe that a beneficial side-effect of these algorithms is an increase in throughput, as they make use of multiple paths. The Internet was designed to use redundancy to enhance reliability. We suggest that, through stochastic methods, redundancy be used to increase security.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"10 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":"121169235","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}
引用次数: 68
An adaptive MAC protocol with enhanced QoS-guarantee capability for 3.5G TD-CDMA-based wireless communication systems 基于3.5G td - cdma的无线通信系统中具有增强qos保障能力的自适应MAC协议
Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043113
C. Yeh
{"title":"An adaptive MAC protocol with enhanced QoS-guarantee capability for 3.5G TD-CDMA-based wireless communication systems","authors":"C. Yeh","doi":"10.1109/ICCCN.2002.1043113","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043113","url":null,"abstract":"We propose a differentiated CDMA (D-CDMA) protocol for 3.5/sup th/-generation (3.5G) wireless cellular networks. D-CDMA employs an adaptive channel access scheme and a differentiated frame structure to support QoS differentiation and guarantee. From our simulation and analytical results, we show that D-CDMA with penalty-based adaptable reservation and admission (PARA) can achieve smaller blocking rate, given an arrival rate, and higher throughput, given a blocking rate objective, as compared to previous protocols without PARA.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"12 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":"121186607","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}
引用次数: 5
下一页 尾页
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学术官方微信