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

Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.最新文献

筛选
英文 中文
A simulation study on the throughput fairness of TCP Vegas TCP Vegas协议吞吐量公平性的仿真研究
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962387
EsteUa C. M. Tsang, R. Chang
{"title":"A simulation study on the throughput fairness of TCP Vegas","authors":"EsteUa C. M. Tsang, R. Chang","doi":"10.1109/ICON.2001.962387","DOIUrl":"https://doi.org/10.1109/ICON.2001.962387","url":null,"abstract":"Throughput fairness is an important criterion for evaluating TCP performance. Fairness is especially important for best effort service, which is the dominant type of service in the Internet still and, predictably, in the years to come. However, the TCP protocols prevailing in the Internet, including TCP Tahoe and TCP Reno, are known to be unfair, especially to connections with larger round-trip delays. Using the ns simulator, we have throughly examined the fairness of TCP Vegas focusing on three issues: (1) is TCP Vegas really fair to connections with larger propagation delays? (2) what is the impact on fairness of the thresholds, /spl alpha/ and /spl beta/, used in TCP Vegas' congestion avoidance algorithm? (3) when there is a mixture of TCP Vegas and TCP Reno connections, are TCP Vegas and TCP Reno fair to each other? The simulation results support that TCP Vegas is still unfair to connections with larger propagation delays, for example, when /spl alpha/ = 1 and /spl beta/ = 3. However, unlike TCP Reno, the delay bias does not necessarily increase as the delay difference increases. The unfairness problem can be resolved by an enhanced TCP Vegas that sets /spl alpha/ = /spl beta/ = 2 or 3 but not 1. When /spl alpha/ = /spl beta/ = 1, the fairness is unstable and may be worse than that when /spl alpha/ = 1 and /spl beta/ = 3. Considering a trade-off among fairness, stability and aggressiveness, a value of 3 seems to be an acceptably good choice. Finally, fairness between TCP Reno and TCP Vegas connections depends on the RED (random early detection) gateway thresholds, the number of active flows and TCP Vegas parameters /spl alpha/ and /spl beta/.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132440773","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
Credit token leaky bucket algorithm with fuzzy logic in ATM networks ATM网络中模糊逻辑信用令牌漏桶算法
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962357
Sunya Pinaikul, W. Benjapolakul
{"title":"Credit token leaky bucket algorithm with fuzzy logic in ATM networks","authors":"Sunya Pinaikul, W. Benjapolakul","doi":"10.1109/ICON.2001.962357","DOIUrl":"https://doi.org/10.1109/ICON.2001.962357","url":null,"abstract":"This paper proposes a new model of leaky bucket (LB) called credit token leaky bucket (CTLB). Since the leaky rate of conventional LB is more than the negotiated mean cell rate, the performance of usage parameter control (UPC) depends on the burstiness of source and the statistical characteristics of cell stream passing through UPC. Therefore, lower performance, easily caused by a malicious user, may happen. In practical application fuzzy logic is chosen to be an artificial intelligent part which makes this mechanism work dynamically. Simulation results obviously show that the sensitivity of this proposed algorithm is better than that of conventional LB and is also close to that of ideal UPC. Furthermore, in the simulation results, CTLB returns fewer excessive cells going into ATM networks than the conventional LB does, while CTLB maintains the negotiated quality of service (QoS) for conformable sources, it passes cells without delay and still works with acceptable sensitivity.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652159","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
Suitability of cryptographic modes of operation for the encryption in high-speed networks 高速网络中加密操作模式的适用性
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962330
O. Jung, S. Kuhn, C. Ruland, K. Wollenweber
{"title":"Suitability of cryptographic modes of operation for the encryption in high-speed networks","authors":"O. Jung, S. Kuhn, C. Ruland, K. Wollenweber","doi":"10.1109/ICON.2001.962330","DOIUrl":"https://doi.org/10.1109/ICON.2001.962330","url":null,"abstract":"Today, modern applications require more and more bandwidth as a result of the increasing quality and performance of the applications. Not only, the bandwidth requirements have to be met but also the demand for data confidentiality. Therefore, new or modified cryptographic modes of operation are required, which usually, provoke error propagation resulting in a higher error rate. The influence of the modes on the quality of service parameters in ATM is examined using the CBC and the ATM counter mode. The different changes of the QoS parameters are described in this paper For SDH we suggest the statistical self-synchronization, based on the OFB mode, because it does not require bandwidth and is self-synchronizing with acceptable augmentation of error rates. Guidelines for adjusting selected cryptographic parameters are presented.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123417288","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}
引用次数: 0
Recovery of lost cells in banyan ATM switching networks using RS codes 利用RS码恢复榕树ATM交换网络中丢失的细胞
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962355
J. Raja, S. Shanmugavel
{"title":"Recovery of lost cells in banyan ATM switching networks using RS codes","authors":"J. Raja, S. Shanmugavel","doi":"10.1109/ICON.2001.962355","DOIUrl":"https://doi.org/10.1109/ICON.2001.962355","url":null,"abstract":"In order to cater for communications users' needs in terms of high speed, high bandwidth and error free reception, researchers have focused their attention towards B-ISDN/ATM in recent years. Since the major efficiency of ATM networks depends on the ATM switching, we have focused our attention towards high throughput in an ATM switch architecture. The banyan switch architecture is taken for our study. We have simulated an 8/spl times/8 banyan architecture with the proposed scheme of using RS coder and decoder. The performance of the proposed architecture in terms of cell loss and average delay versus the cell arrival rate is presented.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117122062","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
Personal communications in integrated personal mobility architecture 集成个人移动架构中的个人通信
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962377
Binh Thai, Rachel Wan, A. Seneviratne
{"title":"Personal communications in integrated personal mobility architecture","authors":"Binh Thai, Rachel Wan, A. Seneviratne","doi":"10.1109/ICON.2001.962377","DOIUrl":"https://doi.org/10.1109/ICON.2001.962377","url":null,"abstract":"The integrated personal mobility architecture (IPMoA) is a personal mobility framework that supports personal mobility in both the areas of personal communications and personalising operational environments. We describe in detail one aspect of IPMoA that is unique, namely, the use of mobile agents to assist users in personal communications. In particular, we describe the functionality of the personal communication assistant (PCA), and how it co-ordinates the setting up of a call: how it determines the location of the remote end point (location management), set-ups the call and how the session is customised to the operating environment. It then illustrates the viability of the proposed scheme through a prototype implementation.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"36 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840121","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
A probabilistic scheme for hierarchical QoS routing 分层QoS路由的概率方案
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962378
D. Ghosh, R. Acharya
{"title":"A probabilistic scheme for hierarchical QoS routing","authors":"D. Ghosh, R. Acharya","doi":"10.1109/ICON.2001.962378","DOIUrl":"https://doi.org/10.1109/ICON.2001.962378","url":null,"abstract":"Quality of service (QoS) routing consists of two parts: (a) collecting network QoS resource availability information using topology aggregation schemes and (b) computing-feasible paths using this information. This paper firstly proposes a probabilistic scheme for topology aggregation in large networks which are QoS sensitive. Our goal is to account for the inherent dynamic nature of the QoS resources by using probabilistic measures as opposed to the existing deterministic ones. Additionally, this paper also proposes a modification to an existing probabilistic QoS routing algorithm for concave QoS parameters. The proposed heuristic algorithm increases the global network resource utilization.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129977258","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}
引用次数: 12
Composition method of communication system specifications in asynchronous model and its support system 异步模式下通信系统规范的组成方法及其支持系统
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962318
Noppadol Maneerat, R. Varakulsiripunth, Daisuke Seki, Kazuki Yoshida, Kaoru Takahashi, Yasushi Kato, B. B. Bista, N. Shiratori
{"title":"Composition method of communication system specifications in asynchronous model and its support system","authors":"Noppadol Maneerat, R. Varakulsiripunth, Daisuke Seki, Kazuki Yoshida, Kaoru Takahashi, Yasushi Kato, B. B. Bista, N. Shiratori","doi":"10.1109/ICON.2001.962318","DOIUrl":"https://doi.org/10.1109/ICON.2001.962318","url":null,"abstract":"One of the most important methods in communication system design, especially in protocol design, is the composition method. We propose a method for simultaneously composing service specifications and protocol specifications based on the LOTOS language. In this method, an asynchronous communication model is adopted which is more realistic in actual communication networks. We use the concept of the weak bisimulation equivalence to represent the correctness of composition. A software support system based on the proposed composition method is also described.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132026813","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
A measurement based architecture for adaptive network environments 一种基于测量的自适应网络环境体系结构
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962350
P. Sookavatana, A. Seneviratne, B. Landfeldt
{"title":"A measurement based architecture for adaptive network environments","authors":"P. Sookavatana, A. Seneviratne, B. Landfeldt","doi":"10.1109/ICON.2001.962350","DOIUrl":"https://doi.org/10.1109/ICON.2001.962350","url":null,"abstract":"The Internet constitutes a heterogeneous mesh of networks with highly varying characteristics. One of the features of this environment is that there normally are a number of possible paths for data to travel between two end-hosts. These different paths exhibit highly different properties in terms of bandwidth, delay, reliability etc. One of the challenges in this environment is to map the properties of a path to application specific requirements. To this end, the concept of adaptive network architectures has been introduced. These architectures can perform the mapping of path characteristics to application requirements but one of the remaining problems with these architectures is how to discover the available paths and their properties. We present a novel architecture that overcomes this problem. The architecture consists of two parts, a hybrid network-monitoring tool and a path discovery algorithm.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130891566","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
Buffer management for TCP over GFR service in an ATM network ATM网络中TCP over GFR服务的缓冲区管理
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962358
P. Krachodnok, W. Benjapolakul
{"title":"Buffer management for TCP over GFR service in an ATM network","authors":"P. Krachodnok, W. Benjapolakul","doi":"10.1109/ICON.2001.962358","DOIUrl":"https://doi.org/10.1109/ICON.2001.962358","url":null,"abstract":"Buffer management plays an important role in guaranteed frame rate (GFR) service in an asynchronous transfer mode (ATM) network. Buffer management algorithms are used to allocate appropriate space in a switch buffer for untagged GFR cells to fulfill the guaranteed minimum cell rate (MCR). Two main goals of buffer management algorithms are high throughput and high fairness index. However, these goals are compromised, that is the higher throughput gives the lower fairness index. This paper proposes a new buffer management algorithm called BADT (buffer allocation with dynamic threshold) algorithm, which uses dynamic threshold techniques for the fairness index improvement. The performance comparison of the previously proposed algorithms is shown. The simulation results show that the BADT algorithm gives the highest fairness index and still gives acceptably high throughput compared to the previously proposed algorithms.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130934873","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
Forward link power control strategy and its optimum issue on CDMA cellular network CDMA蜂窝网络前向链路功率控制策略及其优化问题
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962392
Jie Zhou, Y. Onozato, S. Sasaki, S. Muramatsu, H. Kikuchi
{"title":"Forward link power control strategy and its optimum issue on CDMA cellular network","authors":"Jie Zhou, Y. Onozato, S. Sasaki, S. Muramatsu, H. Kikuchi","doi":"10.1109/ICON.2001.962392","DOIUrl":"https://doi.org/10.1109/ICON.2001.962392","url":null,"abstract":"We propose a theoretical method in order to estimate the forward link outage probability and user capacity of a cellular system which are based on IS-95 CDMA standard - especially the impact of a power control strategy and voice activity monitoring on the system under long-term fading. According to the numerical results obtained the power control strategy leads to approximately threefold the user capacity compared to the situation without power control. The power control strategy not only improves the desired signal to interference ratio in the reference user's receiver, but also offers uniform service to the user wherever it is located in the cell.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459796","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信