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

The 11th IEEE International Conference on Networks, 2003. ICON2003.最新文献

筛选
英文 中文
Reinforcement learning-based dynamic bandwidth provisioning for quality of service in differentiated services networks 基于强化学习的差异化业务网络服务质量动态带宽分配
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266241
C. Tham, T. Hui
{"title":"Reinforcement learning-based dynamic bandwidth provisioning for quality of service in differentiated services networks","authors":"C. Tham, T. Hui","doi":"10.1109/ICON.2003.1266241","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266241","url":null,"abstract":"The issue of bandwidth provisioning for Per Hop Behavior (PHB) aggregates in Differentiated Services (DiffServ) networks is imperative for differentiated QoS to be achieved. This paper proposes an adaptive provisioning scheme that determines at regular intervals the amount of bandwidth to provision for each PHB aggregate, based on traffic conditions and feedback received about the extent to which QoS is being met. The scheme adjusts parameters to minimize a penalty function that is based on the QoS requirements agreed upon in the service level agreement (SLA). The novel use of a continuous-space, gradient-descent reinforcement learning algorithm enables the scheme to work effectively without accurate traffic characterization or any assumption about the network model. Using ns-2 simulations, we show that the algorithm is able to converge to a policy that provisions bandwidth such that QoS requirements are satisfied.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595729","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}
引用次数: 11
Dynamics and cachability of Web sites: implications for inverted capacity networks 网站的动态和可缓存性:对反向容量网络的影响
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266165
S. Zander, G. Armitage, C. Malcolm
{"title":"Dynamics and cachability of Web sites: implications for inverted capacity networks","authors":"S. Zander, G. Armitage, C. Malcolm","doi":"10.1109/ICON.2003.1266165","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266165","url":null,"abstract":"The traditional Internet access model involves low bandwidth last-mile circuits and high bandwidth backbones. Imagine that in the future the last-mile becomes a high bandwidth service. In such an inverted capacity network content caching in the access network becomes essential to avoid backbone congestion and improve user experience but on the other hand the high access bandwidth also offers opportunities for new caching mechanisms. We focus on the Web as the most important and well-established content service. With respect to caching the question is how much of the Web content is cachable and what is the dynamic behavior? In this paper we analyze the cachability and dynamic behavior of a number of Web sites and the implications for an inverted capacity network. In contrast to previous work we use an active approach for collecting the measurement data to be able to analyze complete Web sites instead of subsets accessed by a specific user group over a certain time period.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133092809","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
Event-based radio communication signalling using the session initiation protocol 使用会话启动协议的基于事件的无线电通信信令
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266238
Klaus Darilion, W. Kampichler, K. M. Göschka
{"title":"Event-based radio communication signalling using the session initiation protocol","authors":"Klaus Darilion, W. Kampichler, K. M. Göschka","doi":"10.1109/ICON.2003.1266238","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266238","url":null,"abstract":"Voice communication for air traffic control has its own and more stringent requirements compared to voice communication in public environments. These include among others faster call setup and extended signalling for radio communication. We present a radio channel model and an architecture for radio communication based on open standards. We show how the session initiation protocol (SIP) and its extensions are used to handle the extended signalling for shared radio access. Furthermore, we show how SIP session timers have to be adopted to achieve faster failure detection. Measurements of the call setup delays and the event notification delays, and their comparison with air traffic control requirements proof the feasibility of the presented concept.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133330085","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
Route discovery and reconstruction in mobile ad hoe networks 移动广告网络中的路由发现与重构
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266248
Robin Chellappa, A. Jennings, N. Shenoy
{"title":"Route discovery and reconstruction in mobile ad hoe networks","authors":"Robin Chellappa, A. Jennings, N. Shenoy","doi":"10.1109/ICON.2003.1266248","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266248","url":null,"abstract":"The dynamic topology of ad hoc networks makes route discovery and reconstruction a non-trivial task. In this work we propose the use of mobility prediction to assist in ad hoc routing. A method of route discovery and route reconstruction using the sectorized mobility prediction technique is presented. Simulation and analytical results of the proposed routing strategy find it to offer considerable reduction in the amount of routing traffic generated during the route discovery phase.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116648450","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 meta-model and framework for user mobility in mobile networks 移动网络中用户移动性的元模型和框架
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266195
I. Stepanov, J. Hähner, C. Becker, Jing Tian, K. Rothermel
{"title":"A meta-model and framework for user mobility in mobile networks","authors":"I. Stepanov, J. Hähner, C. Becker, Jing Tian, K. Rothermel","doi":"10.1109/ICON.2003.1266195","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266195","url":null,"abstract":"Mobility patterns play an important role for performance evaluations of mobile networks. To simulate user movement, existing simulation tools provide only a few simple mobility models (e.g., random movement) suitable for particular scenarios. To evaluate a new scenario, an appropriate model needs to be created, but this requires extra work that distracts the researcher from his/her main task. In general, three key elements determine the mobility of users: the spatial environment, the user trip sequences, and the user movement dynamics (e.g., speed). In this paper, we introduce a meta-model that integrates these three elements in an easy-to-use framework, allowing a flexible modeling of user mobility in custom scenarios. The framework is available for download as a stand-alone trace generator and may be used together with any simulation or emulation tool for mobile networks to evaluate a specific scenario.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127309613","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}
引用次数: 69
PSC: a priority selected cache algorithm for streaming video over Internet PSC:一种优先级选择缓存算法，用于互联网上的流媒体视频
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266189
Shin-Hung Chang, R. Chang, Jan-Ming Ho, Yen-Jen Oyang
{"title":"PSC: a priority selected cache algorithm for streaming video over Internet","authors":"Shin-Hung Chang, R. Chang, Jan-Ming Ho, Yen-Jen Oyang","doi":"10.1109/ICON.2003.1266189","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266189","url":null,"abstract":"Proxy technology is commonly used at boundaries of ISPs (Internet service providers) to reduce the bandwidth requirement in the backbone WAN. By caching portions of a video in a video proxy closed to clients, the video playback quality can be dramatically improved and the problem of insufficient WAN bandwidth is eliminated. In the loss-less network environment, the OC (optimal cache) algorithm uses minimum cache storage in the video proxy and reduces the maximum bandwidth required in the backbone WAN. However, data packets may be lost to affect video playback quality while streaming video data through the Internet. Consider an MPEG video in which an I-frame is referenced by all other frames (B- or P-frames) in the same GOP (group of picture). Losing packets belonging to an I-frame makes it difficult to decode all of subsequent frames retrieved from the same GOP. The major goal of this paper is to select maximum video data from high-priority frames (I-frames) caching in the video proxy in order to defeat decoding error caused by packet loss and improve error recovery while serving QoS-guaranteed video playback. We propose a novel PSC (priority selected cache) algorithm for solving this cache data selection problem. The PSC algorithm uses minimum cache storage in the video proxy and reduces maximum bandwidth requirement in the backbone WAN (as does the OC algorithm). Additionally, experiment results with several benchmark videos show that the PSC algorithm is 15% better than the conventional OC algorithm at caching I-frame data in a video proxy.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128996564","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}
引用次数: 1
Stationary and adaptive replication approach to data availability in structured peer-to-peer overlay networks 结构化点对点覆盖网络中数据可用性的平稳自适应复制方法
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266201
Xuezheng Liu, Guangwen Yang, Dingxing Wang
{"title":"Stationary and adaptive replication approach to data availability in structured peer-to-peer overlay networks","authors":"Xuezheng Liu, Guangwen Yang, Dingxing Wang","doi":"10.1109/ICON.2003.1266201","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266201","url":null,"abstract":"Structured peer-to-peer overlay networks offer a novel infrastructure for large-scale applications. However, replications aimed for high data availability often have too much maintenance cost. In this paper we propose a simple and efficient replication strategy over low available peers, which has stationary replica locations and variation-tolerant data recovery mechanism, so that it can greatly reduce the costs for maintaining replicas, esp. in the circumstance of poor peer availabilities. We also present an analytic model for data availability and replication maintenance costs. Based on our model, we make adaptive mechanism for replicas checking, which can further reduce the cost and guarantee data availability in variable circumstance and conditions for living replicas. The simulation results proved the contribution of our approach and model.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"60 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121012620","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}
引用次数: 4
Simulation of fibre channel storage area network using SANSim 基于SANSim的光纤通道存储区域网络仿真
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266215
Chao-Yang Wang, Feng Zhou, Y. Zhu, T. Chong, Bo Hou, W. Xi
{"title":"Simulation of fibre channel storage area network using SANSim","authors":"Chao-Yang Wang, Feng Zhou, Y. Zhu, T. Chong, Bo Hou, W. Xi","doi":"10.1109/ICON.2003.1266215","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266215","url":null,"abstract":"Fibre channel (FC) is presently the dominant protocol used in storage area network (SAN). In this paper, we present a new simulation tool - SANSim, for modeling and analyzing FC storage network. I/O performance of a FC RAM disk has been tested and compared with simulation results achieved from the SANSim model. The simulated results match the experimental readings within 3% error range. The FC arbitration schedules used in the current high-end storage system were also simulated and analyzed using SANSim. The results show that a new algorithm, \"command first\", proposed in this paper has 50% performance improvement compared with the conventional \"fairness access\" algorithm in read operation.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132014408","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
Recent directions in virtual private network solutions 虚拟专用网解决方案的最新发展方向
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266193
G. Rosenbaum, W. Lau, S. Jha
{"title":"Recent directions in virtual private network solutions","authors":"G. Rosenbaum, W. Lau, S. Jha","doi":"10.1109/ICON.2003.1266193","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266193","url":null,"abstract":"VPN services have been around for decades but it did not get wide-spread usage until recently. A combination of new VPN technologies, network technologies and business communication requirements are the driving force behind the VPN services. This survey gives an overview of the recent approaches of VPN solutions and compare their scalability and flexibility aspects. The survey also categorises VPN solutions and relates them to potential customer segments with a view to provide a better understanding of the trade-offs that a network provider faces.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130972825","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
Resource management in UMITS : from admission control to packet scheduling UMITS中的资源管理:从准入控制到包调度
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266261
S. Elayoubi, T. Chahed, G. Hébuterne
{"title":"Resource management in UMITS : from admission control to packet scheduling","authors":"S. Elayoubi, T. Chahed, G. Hébuterne","doi":"10.1109/ICON.2003.1266261","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266261","url":null,"abstract":"","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126685212","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
首页 上一页 下一页 尾页
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学术官方微信