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

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

筛选
英文 中文
The cost of peer discovery and searching in the Gnutella peer-to-peer file sharing protocol Gnutella对等文件共享协议中对等发现和搜索的代价
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962351
M. Portmann, P. Sookavatana, S. Ardon, A. Seneviratne
{"title":"The cost of peer discovery and searching in the Gnutella peer-to-peer file sharing protocol","authors":"M. Portmann, P. Sookavatana, S. Ardon, A. Seneviratne","doi":"10.1109/ICON.2001.962351","DOIUrl":"https://doi.org/10.1109/ICON.2001.962351","url":null,"abstract":"A lot of attention has been focused on peer-to-peer file sharing systems. Gnutella is a fully distributed peer-to-peer protocol without the need for a central entity. This increases the reliability of the system by avoiding a single point of failure as well making it more immune to legal attack. The two main features of the Gnutella protocol discovery of peers and searching for files are implemented by passing different types of messages between the nodes of the Gnutella overlay network. Due to its fully distributed nature, Gnutella relies on flooding to route most of these messages, which immediately raises the question of cost and scalability. We study these aspects of the Gnutella protocol by means of simulation also considering the influence of the topology of the Gnutella network.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"13 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":"115609959","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}
引用次数: 51
Internet charging-behind the time$ 互联网收费——落后于时代
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962327
M. Chalmers, S. Jha, Mahbub Hassan
{"title":"Internet charging-behind the time$","authors":"M. Chalmers, S. Jha, Mahbub Hassan","doi":"10.1109/ICON.2001.962327","DOIUrl":"https://doi.org/10.1109/ICON.2001.962327","url":null,"abstract":"Billing and charging is a hard issue, but an extremely important one given the increasingly commercial nature of the Internet. Economic analysis and emerging Internet technologies have stimulated charging research to new levels, and many, approaches have been produced by the Internet community in response to such stimulus, but little standardisation has resulted. This paper is a sampling of the diverse area of Internet charging, highlighting some of the key directions in previous research and giving examples of specific work.","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":"122505957","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
Approximating fair bandwidth allocation in core-stateless networks 在无核心状态网络中近似公平的带宽分配
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962384
Zhai Mingyu, Gu Guanqun
{"title":"Approximating fair bandwidth allocation in core-stateless networks","authors":"Zhai Mingyu, Gu Guanqun","doi":"10.1109/ICON.2001.962384","DOIUrl":"https://doi.org/10.1109/ICON.2001.962384","url":null,"abstract":"We present queue length based fair queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. Edge routers divide each flow into a set of layers using a linear encoding scheme and insert an appropriate label into each packet header. Core routers maintain a dropping threshold according to the current queue length at each router; packets with a label greater than the threshold are dropped. We have evaluated QLFQ together with CSFQ (core-stateless fair queueing) and RFQ (rainbow fair queueing) with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ. The simulations also show that in an environment with bursty traffic sources, QLFQ provides much better fairness than CSFQ.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"142 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":"123247749","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
A transparent deployment method of RSVP-aware applications on UNIX 在UNIX上支持rsvp的应用程序的透明部署方法
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962382
Yu-Ben Miao, W. Hwang, C. Shieh
{"title":"A transparent deployment method of RSVP-aware applications on UNIX","authors":"Yu-Ben Miao, W. Hwang, C. Shieh","doi":"10.1109/ICON.2001.962382","DOIUrl":"https://doi.org/10.1109/ICON.2001.962382","url":null,"abstract":"This paper proposes a method, called RLR (RSVP library redirection), which can transform legacy Internet applications into RSVP-aware applications without modifying their source files. RLR achieves the transparent transformation by redirecting procedure calls from the socket library to the RAPI (RSVP application programming interface) library. For UNIX operating systems, such as Linux, Free-BSD etc., the redirection can be realized since the related mechanisms of procedure call interception are supported in these operating systems. In addition to the advantage of transparent transformation, RLR can allow a single RLR software module to be used for multiple programs if they have similar behavior. We have used one RLR module to transform several FTP applications to be RSVP-aware. The experimental results show the feasibility of RLR.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"10 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120844293","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
OnLine Test System, an application of passive testing in routing protocols test 在线测试系统是被动测试在路由协议测试中的一个应用
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962339
Yixin Zhao, Xia Yin, Jianping Wu
{"title":"OnLine Test System, an application of passive testing in routing protocols test","authors":"Yixin Zhao, Xia Yin, Jianping Wu","doi":"10.1109/ICON.2001.962339","DOIUrl":"https://doi.org/10.1109/ICON.2001.962339","url":null,"abstract":"In order to perform effective routing protocol testing, passive testing is introduced. The passive testing checks the protocol implementation through online observation. It can be performed in the production field without interfering with the network and possesses several other beneficial features. This test method was realized in an OnLine Test System (OLTS). Key techniques were worked out and the framework was designed. The OLTS exploits the state synchronization algorithm to test the protocol state machine. It tests the exchange and the manipulation of the routing information through topology analysis and internal process simulation. OLTS supports multiple instances to work in a distributed environment. It can also cooperate with an active test system to bring out the best in each other. The prototype of the OLTS has been implemented. The testing of BGP, OSPF and RIP has been performed.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"264 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":"133770994","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
Bandwidth allocation scheme in ATM networks based on virtual path for different quality of service (QoS) requirements 基于虚拟路径的ATM网络带宽分配方案，以满足不同的服务质量要求
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962396
T. Sanguankotchakorn, Bhichate Chiewthanakul
{"title":"Bandwidth allocation scheme in ATM networks based on virtual path for different quality of service (QoS) requirements","authors":"T. Sanguankotchakorn, Bhichate Chiewthanakul","doi":"10.1109/ICON.2001.962396","DOIUrl":"https://doi.org/10.1109/ICON.2001.962396","url":null,"abstract":"We consider the bandwidth allocation scheme of ATM networks based on the virtual path (VP) concept. The bandwidth is allocated individually for supporting different traffic classes with different QoS requirements within a VP. By applying the Markov modulated deterministic process method, different models of VP combinations are proposed in order to compute the minimum capacity and buffer size required to satisfy the entire QoS requirements when multiple classes of on-off sources are multiplexed into UP. Combinations of static VP, called static bandwidth allocation, are proposed to achieve the optimum total capacity, and total buffer required for satisfying the individual QoS requirements. Further, by revising the existing algorithms and cell loss probability function, different priority assignments of VP combination, called dynamic bandwidth allocation, are also proposed to compute the minimum capacity and buffer size. Simulations of these schemes are carried out to evaluate their performance.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"23 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":"132464026","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
Towards a robust and controllable intra-domain multicast protocol 实现鲁棒可控的域内组播协议
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962353
Yulu Ma, Keping Long, Shiduan Cheng
{"title":"Towards a robust and controllable intra-domain multicast protocol","authors":"Yulu Ma, Keping Long, Shiduan Cheng","doi":"10.1109/ICON.2001.962353","DOIUrl":"https://doi.org/10.1109/ICON.2001.962353","url":null,"abstract":"CBT and PIM-SM are two typical intra-domain multicast routing protocols. However, CBT lacks an efficient member management mechanism such as admission control and authentication for senders. In PIM-SM, multicast traffic concentrates on RP which causes network collapse. Frequently the authorization operation tends to overload RP. Furthermore, PIM-SM is single-failure, which means RP failure will destroy the whole multicast tree. We propose a new protocol that can effectively solve all these problems by admitting senders at multiple cores and transporting packets towards uni-direction.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"62 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":"128554622","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
TCP friendly fairness in Differentiated Services IP networks 差异化业务IP网络中TCP友好的公平性
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962321
Haitao Wu, Keping Long, Shiduan Cheng, Jian Ma, Yanqun Le
{"title":"TCP friendly fairness in Differentiated Services IP networks","authors":"Haitao Wu, Keping Long, Shiduan Cheng, Jian Ma, Yanqun Le","doi":"10.1109/ICON.2001.962321","DOIUrl":"https://doi.org/10.1109/ICON.2001.962321","url":null,"abstract":"The Differentiated Services architecture has been proposed by IETF to implement QoS in IP networks. However, research shows that there exists great unfairness in the DiffServ network, especially between responsive and unresponsive aggregate traffic. This paper argues that responsive and unresponsive flows should be treated differently only to their out-of-profile traffic, in addition, traffic responsiveness should be identified by its behavior rather than simply by protocol. Then this paper defines the TCP-friendly fairness in the DiffServ network by introducing the idea of TCP friendliness into the DiffServ network to guarantee the fairness between responsive and unresponsive aggregate flows. Moreover, two markers, srTCM and trTCM, with eight mapping schemes, are examined by elaborate simulations, however, none could achieve the TCP-friendly fairness. Therefore, this paper propose the direct congestion control scheme (DCCS) to achieve fairness between responsive and unresponsive aggregate flows.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"21 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":"133196782","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 graph theoretic model for hardware-based firewalls 硬件防火墙的图论模型
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962345
Y. Permpoontanalarp, Chaiwat Rujimethabhas
{"title":"A graph theoretic model for hardware-based firewalls","authors":"Y. Permpoontanalarp, Chaiwat Rujimethabhas","doi":"10.1109/ICON.2001.962345","DOIUrl":"https://doi.org/10.1109/ICON.2001.962345","url":null,"abstract":"Firewalls offer a protection for private networks against external attacks. However, configuring firewalls is a difficult task. The reason is that the effects of a firewall configuration cannot be easily seen during the configuration time. As a result, errors and loopholes in firewall configurations, if they exist, are discovered only after they actually happen at the execution time. We propose a preliminary yet novel model and its methodology for hardware-based firewalls. Our model offers precise and simple understanding of effects of firewall configurations. Moreover, our methodology offers an analysis of effects of firewall configurations. In particular, it provides reasoning about the correctness of firewall configurations. Also, the redundancy and inconsistency of firewall rules can be reasoned about. As a result, many kinds of errors and loopholes of firewall configurations can be detected during the configuration time.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"30 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":"117195443","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
Using network flows in hierarchical QoS routing 在分层QoS路由中使用网络流
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962379
V. Sarangan, R. Acharya
{"title":"Using network flows in hierarchical QoS routing","authors":"V. Sarangan, R. Acharya","doi":"10.1109/ICON.2001.962379","DOIUrl":"https://doi.org/10.1109/ICON.2001.962379","url":null,"abstract":"Quality of Service (QoS) routing is the process of routing a connection through a network based on its resource requirements. In QoS routing a lot of overhead is generated either due to the state maintenance or during the call establishment. These overheads increase with the network size. Hence to deploy QoS routing in very big networks, special techniques for reducing these overheads have to be developed. State aggregation is an important technique for reducing the state maintenance overhead. In state aggregation, each domain constructs an aggregated topology of itself, and sends it to other domains. Other domains make routing decisions based on this aggregated information. However, as the network resources change dynamically, the information sent by a domain quickly becomes out-of-date. This stale information leads to bad routing decisions and hence the routing performance goes down. If a domain can update the aggregated information sent by other domains, better routing decisions can be made and hence the routing performance can improve. In this paper, based on \"network flows\", we propose a new scheme for aggregating bandwidth. Our scheme enables a domain to update the aggregate sent by another domain and thus keep track of resources available in other domains. We also give a distributed approach for inter-domain routing based on our proposed aggregation scheme. Simulation results show that our method gives a better bandwidth admission ratio when compared to existing aggregation techniques.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"16 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":"114682210","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
首页 上一页 下一页 尾页
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学术官方微信