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

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium最新文献

筛选
英文 中文
Estimating available capacity of a network connection 估计网络连接的可用容量
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875780
Suman Banerjee, A. Agrawala
{"title":"Estimating available capacity of a network connection","authors":"Suman Banerjee, A. Agrawala","doi":"10.1109/ICON.2000.875780","DOIUrl":"https://doi.org/10.1109/ICON.2000.875780","url":null,"abstract":"Capacity measures for a network connection across the Internet are useful to many applications. Its applicability encompasses QoS guarantees, congestion control and other related areas. In this paper we define and measure the available capacity of a connection, through observations at endpoints only. Our measurements account for the variability of cross traffic that passes through the routers handling this connection. Related to the estimation of available capacity, we suggest modifications to current techniques to measure the packet service time of the \"bottleneck\" router of the connection. Finally, we present estimation results on wide-area network connections from our experiments to multiple sites.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134018780","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}
引用次数: 31
Experiencing Megaco protocol for controlling non-decomposable VoIP gateways 体验用于控制不可分解VoIP网关的Megaco协议
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875776
A. Conte, Laurent-Philippe Anquetil, T. Lévy
{"title":"Experiencing Megaco protocol for controlling non-decomposable VoIP gateways","authors":"A. Conte, Laurent-Philippe Anquetil, T. Lévy","doi":"10.1109/ICON.2000.875776","DOIUrl":"https://doi.org/10.1109/ICON.2000.875776","url":null,"abstract":"VoIP gateways are devices that take care of interworking the new emerging VoIP networks with the existing legacy telecommunication networks. The efficient control of such gateways is a key prerequisite for a successful deployment of VoIP. Currently solutions are based on protocols like Megaco/H.248 and SCTP, designed for controlling logical decomposed gateways. Unfortunately not all gateways support decomposition. This paper proposes a technique for controlling \"non-decomposable\" gateways, based on a modification (bias) of the Megaco control model for allowing signalling handling. The basic concepts are illustrated, giving hints for design. The limitations and drawbacks are also discussed.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122375519","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
A method to improve the robustness of MPEG video applications over wireless networks 一种提高无线网络上MPEG视频应用鲁棒性的方法
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875791
R. Pillai, Mohan Krishna Patnam
{"title":"A method to improve the robustness of MPEG video applications over wireless networks","authors":"R. Pillai, Mohan Krishna Patnam","doi":"10.1109/ICON.2000.875791","DOIUrl":"https://doi.org/10.1109/ICON.2000.875791","url":null,"abstract":"It is important that applications deployed in wireless networks be robust enough to accommodate different kinds of data losses due to link errors, connection re-routing, and network congestion. A scheme to improve the robustness of MPEG based video applications is proposed. Under this scheme, the packet size at the sender is optimized to the MPEG system layer unit size to enable fast recovery of the time stamps. The receiver buffers the data packets for re-playing during packet losses, preserves useful time stamps for synchronisation, and re-synchronises the decoder when packet loss occurs. This involves no feedback and results in faster recovery of critical timing information for video decoding. The proposed method has been implemented on a video application based on MPEG-I over an ATM network. The experiments show that the proposed technique is very effective when there is deterministic/random packet losses with burst size less than 21. The method is equally applicable to video applications based on MPEG-II program stream and, to wireless Internet.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129823965","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 proposal for binary congestion control with rate-based sources and stateless routers 基于速率源和无状态路由器的二进制拥塞控制方案
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875768
António Almeida, C. Belo
{"title":"A proposal for binary congestion control with rate-based sources and stateless routers","authors":"António Almeida, C. Belo","doi":"10.1109/ICON.2000.875768","DOIUrl":"https://doi.org/10.1109/ICON.2000.875768","url":null,"abstract":"The paper presents new algorithms for rate-based congestion control. The network congestion status is made available to the sources by explicit binary notifications generated in the core nodes. Besides the associated control bandwidth reduction, binary notifications enable a simple implementation in heterogeneous network environments where switches/routers use different congestion control strategies. The source algorithm is adaptive and shows significant improvement on the level of oscillations as compared to classical binary schemes, e.g. multiplicative decrease/additive increase. An algorithm for the core routers is also proposed that achieves a max-min fair-share allocation of bandwidth without requiring the memorization of per-flow data. The simulation results presented show a good performance of the algorithms both for homogeneous (Internet) and heterogeneous (Internet/ATM) network environments.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130833781","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
A hierarchical ack-based protocol for reliable multicast in mobile networks 移动网络中可靠组播的分层ack协议
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875814
Byung-Won On, Hae-Sun Shin, Miae Choi, Myong-Soon Park
{"title":"A hierarchical ack-based protocol for reliable multicast in mobile networks","authors":"Byung-Won On, Hae-Sun Shin, Miae Choi, Myong-Soon Park","doi":"10.1109/ICON.2000.875814","DOIUrl":"https://doi.org/10.1109/ICON.2000.875814","url":null,"abstract":"This paper presents the protocol for reliable multicast communication in mobile networks. Current research for these protocols generally uses an ack-based approach and consists of mobile support stations and supervisor hosts. Each supervisor host controls a group of neighboring mobile support stations by delivering one ack message to the sender and collecting ack messages from all the mobile hosts that are joined in a multicast group and are in its domain. But if either the number of mobile hosts in the supervisor host's domain is increased or the mobile hosts crowd around a particular supervisor host, an ack implosion of the supervisor host can occur because of the number of ack messages from mobile hosts. To solve the problem, we propose the HARM approach, a reliable multicast protocol that hierarchically processes ack messages in both the mobile support station and the supervisor host to alleviate the ack messages.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123306737","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
Effect of IP traffic on optical QoS in DWDM networks IP流量对DWDM网络光服务质量的影响
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875816
Junhua Tang, Liren Zhang
{"title":"Effect of IP traffic on optical QoS in DWDM networks","authors":"Junhua Tang, Liren Zhang","doi":"10.1109/ICON.2000.875816","DOIUrl":"https://doi.org/10.1109/ICON.2000.875816","url":null,"abstract":"Dense wavelength division multiplexing (DWDM) is most likely to become the core technology of next generation Internet. As QoS provision has become an important part of Internet, DWDM networks are also required to provide differentiated quality of optical service. Optical QoS contains a set of parameters, of which the BER of the lightpath is an important measure of the lightpath performance. We focus on the BER caused by the four wave mixing (FWM) effect in the optical fiber. The effect of IP traffic on the BER performance is analyzed and simulation results are presented.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123427493","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 novel JavaCard-based authentication system for secured transactions on the Internet 一种新颖的基于javacard的身份验证系统，用于Internet上的安全事务
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875799
Li Huang Ng, Daniel T. H. Tan
{"title":"A novel JavaCard-based authentication system for secured transactions on the Internet","authors":"Li Huang Ng, Daniel T. H. Tan","doi":"10.1109/ICON.2000.875799","DOIUrl":"https://doi.org/10.1109/ICON.2000.875799","url":null,"abstract":"This paper presents a novel authentication system, that will find applications on the Internet like e-commerce and areas where secure communication is mandatory. It consists of a set of authentication protocols-JavaCard authentication protocol (JCAP) and a secure crypto-module-random symmetric authentication module (RSAM). The JCAP is used to establish the session \"key\" and mutual authenticate the communicating principals. The \"key\" established has enhanced functions and acts as a set of parameters used in RSAM for a more secure symmetric cryptographic session to provide privacy and dynamic symmetric encryption algorithm operations. The encryption keys, and the length and sequence of messages will be different for each exchange of messages, making it almost impossible for the attacker to decrypt the message exchanged. JavaCard is used to enhance the security of the authentication session.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126313148","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
Web caching: locality of references revisited Web缓存:重新访问引用的位置
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875772
A. Foong, Yu-Hen Hu, D. Heisey
{"title":"Web caching: locality of references revisited","authors":"A. Foong, Yu-Hen Hu, D. Heisey","doi":"10.1109/ICON.2000.875772","DOIUrl":"https://doi.org/10.1109/ICON.2000.875772","url":null,"abstract":"An effective caching strategy depends on utilizing the locality of reference. However, knowledge gained from research in traditional caches cannot be applied verbatim to web caches. We propose that web accesses exhibit at least four dimensions of locality. A logistic regression model is used to confirm our hypothesis. Based on these findings we implemented a web-caching agent to acquire knowledge about the objects it encounters, and deduce a cache strategy dynamically. We also showed that the same analysis can be applied to pre-fetching. Results on trace driven simulations of six web and proxy servers confirm that more effective caching can be achieved.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131842312","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
A hybrid ATM connection admission control scheme based on on-line measurements and user traffic descriptors 一种基于在线测量和用户流量描述符的混合ATM连接准入控制方案
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875797
D. Habibi, Guoqiang Mao
{"title":"A hybrid ATM connection admission control scheme based on on-line measurements and user traffic descriptors","authors":"D. Habibi, Guoqiang Mao","doi":"10.1109/ICON.2000.875797","DOIUrl":"https://doi.org/10.1109/ICON.2000.875797","url":null,"abstract":"Connection admission control (CAC) is a preventive congestion control mechanism and it is essential for providing quality of service (QoS) requirements for calls established over ATM. The strategies for CAC in an ATM network can be classified into two categories: measurement-based CAC and traffic descriptor-based CAC. Both categories have their advantages and disadvantages. This paper proposes a simple CAC algorithm which utilizes both traffic descriptors and parameters that can be reliably and accurately derived from on-line measurements. This hybrid CAC algorithm avoids the disadvantage of traffic descriptor based CAC in which some traffic parameters can not be tightly characterized by sources and the disadvantage of measurement-based approach in which some measurements are not reliable and/or time-consuming. CAC decision can be made easily in our algorithm. Simulation studies are presented which are indicative of the good performance of our algorithm.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128075667","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
Simulation comparison of RED and REM RED与REM的仿真比较
Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875770
S. Athuraliya, S. Low
{"title":"Simulation comparison of RED and REM","authors":"S. Athuraliya, S. Low","doi":"10.1109/ICON.2000.875770","DOIUrl":"https://doi.org/10.1109/ICON.2000.875770","url":null,"abstract":"We proposed earlier (Athuraliya et al. 2000) an optimization based flow control for the Internet called random exponential marking (REM). REM consists of a link algorithm, that probabilistically marks packets inside the network, and a source algorithm, that adapts source rate to observed marking. The marking probability is exponential in a link congestion measure, so that the end-to-end marking probability is exponential in a path congestion measure. Because of the finer measure of congestion provided by REM, sources do not constantly probe the network for spare capacity, but settle around a globally optimal equilibrium, thus avoiding the perpetual cycle of sinking into and recovering from congestion. In this paper we compare the performance of REM with Reno over RED (random early detection) through simulation.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122943458","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学术官方微信