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

筛选
英文 中文
Call admission control using differentiated outage probabilities in multimedia DS-CDMA networks with imperfect power control 具有不完全功率控制的多媒体DS-CDMA网络中基于差分中断概率的呼叫接纳控制
Tao Shu, Z. Niu
{"title":"Call admission control using differentiated outage probabilities in multimedia DS-CDMA networks with imperfect power control","authors":"Tao Shu, Z. Niu","doi":"10.1109/ICCCN.2002.1043088","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043088","url":null,"abstract":"A key problem under imperfect power control in multimedia DS-CDMA networks is how to guarantee the differentiated outage probabilities of different traffic classes resulted by the uncertainty of received powers. In addition, in order to utilize the scarce wireless resource efficiently, as many users as possible should be admitted into the network while providing guaranteed quality-of-service support for them. In this work, a call admission control scheme, differentiated outage probabilities CAC or DOP-CAC, is proposed to achieve the above goals for imperfectly power controlled multimedia CDMA networks. Two important features of CDMA system are considered in our scheme: one is the power multiplexing among bursty traffic and the other is the power allocation scheme employed at the physical layer. The validation and efficiency of DOP-CAC are verified by numerical examples.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"49 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":"129598934","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
Enhancing security via stochastic routing 通过随机路由增强安全性
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协议
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
Analysis of multi-rate traffic in WDM grooming networks WDM疏导网络中多速率业务分析
R. Srinivasan, Arun Kumar Somani
{"title":"Analysis of multi-rate traffic in WDM grooming networks","authors":"R. Srinivasan, Arun Kumar Somani","doi":"10.1109/ICCCN.2002.1043081","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043081","url":null,"abstract":"Traffic grooming in optical networks employing wavelength division multiplexing has gained prominence due to the prevailing sub-wavelength capacity requirements of users. One approach to achieving wavelength sharing is through time division multiplexing. Connection requests can have a varying number of time slot requirements. Analytical modeling for computing the blocking performance of establishing multi-rate connections in WDM grooming networks involves extensive combinatorial complexity and thus requires prohibitively large state-space for solution. In this paper, we develop an analytical model that employs an approximation to the exact distribution of number of calls of a certain bandwidth requirement on a wavelength. We validate the approximation through simulation results for two different networks that have high and low link-load correlation. It is observed that up to an order of magnitude performance improvement is obtained by improving the grooming capability in the network for calls that require two time slots.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"7 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":"126746977","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}
引用次数: 16
An intelligent multicast protocol for satellite-terrestrial broadband network 卫星-地面宽带网络智能组播协议
Chao-Hsu Chang, E. Wu
{"title":"An intelligent multicast protocol for satellite-terrestrial broadband network","authors":"Chao-Hsu Chang, E. Wu","doi":"10.1109/ICCCN.2002.1043058","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043058","url":null,"abstract":"Multimedia applications have been desirable and attract a rapidly increasing number of network subscribers. However, their generated enormous amount of Internet traffic usually congests the network to cause the degradation of network utilization. Although multicast provides an efficient way for distributing multimedia information to a set of destinations simultaneously, the congestion still degrades the desired QoS (quality of service) of the on-going multicast connections especially if the group of multicast destinations is large and scattered. Hence, this paper proposes a novel adaptive multicast routing (AMRST) approach for satellite-terrestrial network (ST network) to provide reliable and adaptive multicast services to global subscribers. This approach decomposes the multicast delivery problem into two parts, (1) the construction of the multicast tree and (2) the maintenance of dynamic membership. The virtual hierarchical routing tree (VHRT) is proposed for constructing an efficient multicast tree and the re-routing scheme is for maintaining the multicast tree in an optimal routing cost once the membership, such as member joining or leaving, changes dynamically. The AMRST not only keeps the benefits of the traditional terrestrial multicast but also further promotes the multicasting performance by employing the satellite broadcasting capability. The simulation results demonstrate that the AMRST has excellent performance for the satellite-terrestrial network.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"81 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":"124426843","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}
引用次数: 2
A multilevel hierarchical distributed IP mobility management scheme for wide area networks 一种面向广域网的多层分层分布式IP移动管理方案
K. Kawano, K. Kinoshita, K. Murakami
{"title":"A multilevel hierarchical distributed IP mobility management scheme for wide area networks","authors":"K. Kawano, K. Kinoshita, K. Murakami","doi":"10.1109/ICCCN.2002.1043109","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043109","url":null,"abstract":"Hierarchical Mobile IPv6 (HMIPv6) has been proposed as one solution to accommodate the frequent movements of mobile terminals (MTs) in IP-based mobile communication networks. HMIPv6 utilizes a mobility anchor point (MAP) that allows the network to manage the mobility of MTs without causing any overflow of outgoing and incoming messages beyond the network perimeter. However, there is a problem in applying HMIPv6 to a wide area network having a multilevel hierarchy. The distribution of several MAPs within such a network can be used as a means of optimizing the different mobility scenarios experienced by MTs. However, HMIPv6 allows MTs to select their own MAP, so with HMIPv6, the MTs may not select the MAP that would be chosen in an optimized scheme. This may cause load concentration at a particular MAP and/or overflow of signaling messages to and from outside networks. An effective IP mobility management method is proposed that focuses on the speed of movement of the MTs. It reduces the number of signaling messages to and from outside networks without suffering from load concentration at particular MAPs, and we show, by simulation experiments, that the proposed method works effectively.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"75 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":"127578049","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
Indexing techniques for file sharing in scalable peer-to-peer networks 可扩展点对点网络中文件共享的索引技术
Fred S. Annexstein, K. Berman, M. Jovanovic, Kovendhan Ponnavaikko
{"title":"Indexing techniques for file sharing in scalable peer-to-peer networks","authors":"Fred S. Annexstein, K. Berman, M. Jovanovic, Kovendhan Ponnavaikko","doi":"10.1109/ICCCN.2002.1043038","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043038","url":null,"abstract":"File sharing is a very popular service provided by peer-to-peer (P2P) networks. In a P2P file-sharing network, users share files and issue queries to the network to find the locations of files residing at other peer nodes. Recently, proxy-enabled peers, or supernodes, have been incorporated to enhance scalability by providing indexing services to nodes on slower network connections. Typically, supernodes build a vector or multi-index of shared files stored on other (slower) peer nodes connected to them. We consider a new model whereby the index tables of individual nodes are merged into a single data structure stored by the supernode. We analyze this model in relation to the standard vectorized data structure. We compare the performance of these supernode indexing algorithms and provide a theoretical analysis that is asymptotic and probabilistic in nature. However, there are several significant constant factors that the theory does not account for, and which are important for designing an optimal system solution. We report on a series of simulation experiments which provide verification of the asymptotic analysis of the formal framework and tools to determine the magnitude of the constant factors. Our general conclusion is that when the query rate exceeds the rate of data updates, the new merged model is preferable to the vector model. However, the details of our analysis allow us to consider combinations of several parameters, and thereby enable the design of optimal indexing schemes via the incorporation of measurements of the parameters of particular applications.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"103 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":"127362129","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
Distributed shared multicast tree construction protocols for tree-shared multicasting in OBS networks OBS网络中树共享组播的分布式共享组播树构建协议
Myoungki Jeong, C. Qiao, M. Vandenhoute
{"title":"Distributed shared multicast tree construction protocols for tree-shared multicasting in OBS networks","authors":"Myoungki Jeong, C. Qiao, M. Vandenhoute","doi":"10.1109/ICCCN.2002.1043086","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043086","url":null,"abstract":"Tree-shared multicasting in OBS networks can achieve bandwidth savings, less processing load, and lower burst blocking (loss) probability. In this paper, we propose several distributed shared multicast tree construction protocols, namely greedy-prune, non-member-join, all-member-join, closest-member on-tree (CMOT), and closest-node on-tree (CNOT), for tree-shared multicasting in OBS networks. For performance comparison, we also consider an optimal shared tree which is modeled as Steiner minimal tree. We evaluate the proposed protocols using simulations in terms of cost of the shared tree to the optimal shared tree. Simulations show that the CNOT and CMOT protocols outperform the other three proposed protocols in terms of the cost of the shared tree, and perform close to cost of the optimal shared tree.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"37 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":"127186041","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}
引用次数: 7
Measurement-based end to end latency performance prediction for SLA verification 基于测量的端到端延迟性能预测,用于SLA验证
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 使用从/从桥接最小化蓝牙散射网的端到端延迟
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
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学术官方微信