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

Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000最新文献

筛选
英文 中文
Optical QoS in multicast wavelength-routed networks 组播波长路由网络中的光QoS
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891090
Maher Ali, J. Deogun
{"title":"Optical QoS in multicast wavelength-routed networks","authors":"Maher Ali, J. Deogun","doi":"10.1109/LCN.2000.891090","DOIUrl":"https://doi.org/10.1109/LCN.2000.891090","url":null,"abstract":"This paper introduces the optical quality of service (QoS) optimization model for wavelength-routed networks. In the first part of this study we concentrate on power as the main quantitative measure of optical QoS. A mathematical formulation of the problem is presented and heuristic approaches are proposed.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"76 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123160567","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
Adaptive bandwidth reservation mechanism using mobility probability in mobile multimedia computing environment 移动多媒体计算环境中基于移动概率的自适应带宽预留机制
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891011
Changyeol Choi, M. Kim, Tae June Kim, Sung-Jo Kim
{"title":"Adaptive bandwidth reservation mechanism using mobility probability in mobile multimedia computing environment","authors":"Changyeol Choi, M. Kim, Tae June Kim, Sung-Jo Kim","doi":"10.1109/LCN.2000.891011","DOIUrl":"https://doi.org/10.1109/LCN.2000.891011","url":null,"abstract":"In this paper, ARMM (adaptive-bandwidth reservation mechanism using MPP) is proposed to provide the consistent QoS guarantees for multimedia traffic in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells, and this aggregated reservation of bandwidth can only be used for hand-off calls and not for new calls. It is important to determine the right amount of reserved bandwidth for hand-off calls, because the blocking probability of new calls would increase if we reserve more bandwidth than being necessary. This paper proposes an algorithm based on a MPP (mobility pattern profile) and a 2-tier cell structure to determine the amount of bandwidth to be reserved in the cell and to dynamically control its amount based on its network condition.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129907350","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}
引用次数: 33
Measurement-based TCP models 基于测量的TCP模型
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891095
T. Éltető, P. Benko
{"title":"Measurement-based TCP models","authors":"T. Éltető, P. Benko","doi":"10.1109/LCN.2000.891095","DOIUrl":"https://doi.org/10.1109/LCN.2000.891095","url":null,"abstract":"A basic network setup is investigated via measurements and simulation of TCP traffic. Based on our measurements we found that the packet losses occur in the backbone network, in spite of the fact that the majority of packets mainly stays in the routers' queues of the access network. Our conclusion is that the packet loss process is independent of the TCP flows' congestion window processes. The packet loss process depends on the aggregate behaviour of a large number of end-users, therefore depends -say-on the time of the day. Based on the knowledge of the packet loss process we are able to estimate the round trip delay that is caused by permanent TCP flows. This estimation can be done by both analytically or simulations as shown in the paper.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128923604","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
Class-based QoS control scheme by flow management in the Internet router Internet路由器中基于流管理的类QoS控制方案
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891009
K. Minami, H. Tode, K. Murakami
{"title":"Class-based QoS control scheme by flow management in the Internet router","authors":"K. Minami, H. Tode, K. Murakami","doi":"10.1109/LCN.2000.891009","DOIUrl":"https://doi.org/10.1109/LCN.2000.891009","url":null,"abstract":"With the Internet transforming into multimedia and high-speed, the various traffic requiring different qualities of service (QoS) will co-exist in the network. Also, classified service based on Diff-Serv (differentiated service), MPLS (Multi Protocol Label Switching) and so on, have come into wide use. In today's environment of the Internet, it is necessary for the routers to perform the control mechanism to guarantee various QoS. We propose the buffer management scheme of the Internet router with class-based priority control, focusing on per-flow queueing, and evaluate the performance. We aim at the realization of differentiated services and the dissolution of the buffer occupation by specific flow.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122378135","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
Handoff support for mobility with IP over Bluetooth 切换支持移动与IP通过蓝牙
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891020
S. Baatz, M. Frank, Rolf Gopffarth, Dmitri Kassatkine, P. Martini, Markus Schetelig, Asko Vilavaara
{"title":"Handoff support for mobility with IP over Bluetooth","authors":"S. Baatz, M. Frank, Rolf Gopffarth, Dmitri Kassatkine, P. Martini, Markus Schetelig, Asko Vilavaara","doi":"10.1109/LCN.2000.891020","DOIUrl":"https://doi.org/10.1109/LCN.2000.891020","url":null,"abstract":"The BLUEPAC (BLUEtooth Public ACcess) concepts present ideas for enabling mobile Bluetooth devices to access local area networks in public areas, such as airports, train stations and supermarkets. The proposed protocols support mobility on OSI layer 3. This paper concentrates on the necessary layer 2 protocol concepts for supporting mobility and handoffs between different access points. Furthermore, we present the necessary adaptations for allowing IP datagrams to be exchanged between the mobile Bluetooth devices and access points. The BLUEPAC protocol concepts have been implemented above a Bluetooth emulation system to test their feasibility. First results clearly showed the importance of minimizing the handoff duration to allow efficient operation of upper layer protocols such as TCP.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"82 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120840732","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}
引用次数: 66
IP route lookups as string matching IP路由查找作为字符串匹配
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891104
Austin Donnelly, T. Deegan
{"title":"IP route lookups as string matching","authors":"Austin Donnelly, T. Deegan","doi":"10.1109/LCN.2000.891104","DOIUrl":"https://doi.org/10.1109/LCN.2000.891104","url":null,"abstract":"An IP route lookup can be considered as a string matching problem on the destination address. Finite state automata (FSA) are a flexible and efficient way to match strings. This paper describes how a routing table can be encoded as an FSA and how, through a process of state reduction, we can obtain an optimal representation. This gives insights into the basic properties of the longest-prefix match problem.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122352700","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}
引用次数: 17
Analytical modeling and performance evaluation of the HIPERLAN CAC layer protocol for real-time traffic 面向实时流量的HIPERLAN CAC层协议的分析建模与性能评价
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891079
C. Coutras, P. Wan, O. Frieder
{"title":"Analytical modeling and performance evaluation of the HIPERLAN CAC layer protocol for real-time traffic","authors":"C. Coutras, P. Wan, O. Frieder","doi":"10.1109/LCN.2000.891079","DOIUrl":"https://doi.org/10.1109/LCN.2000.891079","url":null,"abstract":"The growing interest in wireless systems and networks has led to the first wireless LAN (WLAN) protocols. The medium access control (MAC) layer protocols of such protocol suites are of key importance. The Radio Equipment and Systems (RES) Technical Committee of the European Telecommunications Standards Institute has proposed the high PErformance radio LAN (HIPERLAN) protocol suite. We present, study, analyze and evaluate the performance of the channel access control layer (lower sublayer of the MAC layer) of the HIPERLAN protocol suite for real-time traffic numerical results from both analysis and simulation are presented, so that the issues involved are better understood.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126533094","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}
引用次数: 3
Systematic testing of protocol robustness: case studies on mobile IP and MARS 协议稳健性的系统测试:移动IP和MARS的案例研究
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891070
S. Begum, Meeta Sharma, A. Helmy, S. Gupta
{"title":"Systematic testing of protocol robustness: case studies on mobile IP and MARS","authors":"S. Begum, Meeta Sharma, A. Helmy, S. Gupta","doi":"10.1109/LCN.2000.891070","DOIUrl":"https://doi.org/10.1109/LCN.2000.891070","url":null,"abstract":"Systematic testing of robustness by evaluation of synthesized scenarios STRESS is a methodology developed for the systematic testing of protocols, and includes algorithms for generating topologies and event sequences that rigorously test the correctness or performance of a given protocol. In this paper, we apply the STRESS method to mobile IP (MIP) and the multicast address resolution server (MARS) protocol for supporting IP-multicast over ATM. For each protocol, we develop a protocol model and analyze its robustness. We also analyze complexity of the STRESS test generation algorithms. In the process, we identify the limitations of the existing STRESS models and algorithms, and propose extensions to carry out our case studies. With the aid of STRESS, we were able to identify several protocol behaviors that lead to error or performance degradation. For MIP we identified such behaviors with the crash of a home agent or the loss of a registration message. For MARS undesired behavior was detected with the crash of the MARS server or source and the selective loss of a join or leave message. The complexity of forward search was found to be O(n/sup 2/) for both MIP and MARS. Incorporating the fault model in the search was found to affect the number of states searched. The crash of a home agent in MIP, and the crash of a data source or server in MARS, were both found to increase the number of states searched. However, the asymptotic complexity was not affected.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127862192","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
Multicast routing based on ant algorithm for delay-bounded and load-balancing traffic 基于蚁群算法的时延有界负载均衡多播路由
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891069
Guoying Lu, Liu Zemin, Zhou Zheng
{"title":"Multicast routing based on ant algorithm for delay-bounded and load-balancing traffic","authors":"Guoying Lu, Liu Zemin, Zhou Zheng","doi":"10.1109/LCN.2000.891069","DOIUrl":"https://doi.org/10.1109/LCN.2000.891069","url":null,"abstract":"Multicast routing is to find the paths from a source node to all multicast destinations. In this paper based on the ant algorithm, we propose a distributed multicast routing scheme with delay-bounded and load-balancing traffic in real-time packet switched computer communication networks. We first describe the ant algorithm model and give the ant-network model, then present an approach using the ant algorithm to optimize the multicast routes with delay-bounded and load-balancing traffic. Finally a simulation has been done to show the efficiency of the algorithm in the environment of OPNET simulation software, and the simulation results show that the proposed approach can find the best optimal multicast routes which can satisfy the delay-bounded requirement and avoid to congested nodes.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130479079","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
A distributed Internet caching system 分布式互联网缓存系统
Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000 Pub Date : 2000-11-08 DOI: 10.1109/LCN.2000.891109
T. Tay, Y. Feng, M. N. Wijeysundera
{"title":"A distributed Internet caching system","authors":"T. Tay, Y. Feng, M. N. Wijeysundera","doi":"10.1109/LCN.2000.891109","DOIUrl":"https://doi.org/10.1109/LCN.2000.891109","url":null,"abstract":"This paper describes a distributed Web caching system for the Internet. In the proposed structure, every client computer in the network takes on the additional role of a cache server, serving the objects it had previously requested and received to other client computers that also request the object. A comprehensive set of protocol for the access, storage and serving function is developed. The proposed protocol guarantees data consistency between the original server object and that in the cache. The system also has the largest storage capacity, as well as having the highest level of reliability possible for a network of such structure.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122990464","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}
引用次数: 17
首页 上一页 下一页 尾页
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学术官方微信