Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.最新文献

Web proxy cache replacement: do's, don'ts, and expectations Web代理缓存替换:该做、不该做和期望

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201138

P. Triantafillou, Ioannis Aekaterinidis

{"title":"Web proxy cache replacement: do's, don'ts, and expectations","authors":"P. Triantafillou, Ioannis Aekaterinidis","doi":"10.1109/NCA.2003.1201138","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201138","url":null,"abstract":"Numerous research efforts have produced a large number of algorithms and mechanisms for web proxy caches. In order to build powerful web proxies and understand their performance, one must be able to appreciate the impact and significance of earlier contributions and how they can be integrated To do this we employ a cache replacement algorithm, 'CSP, which integrates key knowledge from previous work. CSP utilizes the communication Cost to fetch web objects, the objects' Sizes, their Popularifies, an auxiliary cache and a cache admission control algorithm. We study the impact of these components with respect to hit ratio, latency, and bandwidth requirements. Our results show that there are clear performance gains when utilizing the communication cost, the popularity of objects, and the auxiliary cache. In contrast, the size of objects and the admission controller have a negligible performance impact. Our major conclusions going against those in related work are that (i) LRU is preferable to CSP for important parameter values, (ii) accounting for the objects' sizes does not improve latency and/or bandwidth requirements, and (iii) the collaboration of nearby proxies is not very beneficial. Based on these results, we chart the problem solution space, identifying which algorithm is preferable and under which conditions. Finally, we develop a dynamic replacement algorithm that continuously utilizes the best algorithm as the problem-parameter values (e.g., the access distributions) change with time.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"409 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133350439","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

Kernel-based Web switches providing content-aware routing 提供内容感知路由的基于内核的Web交换机

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201134

M. Andreolini, M. Colajanni, M. Nuccio

引用次数: 20

G-REMiT: An algorithm for building energy efficient multicast trees in wireless ad hoc networks G-REMiT:一种在无线自组织网络中构建节能组播树的算法

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201165

Bin Wang, S. Gupta

引用次数: 31

A study of providing statistical QoS in a differentiated services network 差别化业务网络中提供统计QoS的研究

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201168

Shengquan Wang, D. Xuan, R. Bettati, Wei Zhao

引用次数: 6

An extensible RTCP control framework for large multimedia distributions 用于大型多媒体发行版的可扩展RTCP控制框架

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201175

J. Chesterfield, E. Schooler

引用次数: 28

Analysis of active queue management 主动队列管理分析

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201176

J. Chung, M. Claypool

{"title":"Analysis of active queue management","authors":"J. Chung, M. Claypool","doi":"10.1109/NCA.2003.1201176","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201176","url":null,"abstract":"Active Queue Management (AQM) is intended to achieve high link utilization with a low queuing delay. Recent studies show that RED, one of the most well-known AQMs, is difficult to configure and does not provide significant performance gains given the complexity required for proper configuration. Recent variants of RED, such as Adaptive-RED are designed to provide more robust RED performance under a wider-range of traffic conditions but have not yet been evaluated. This paper presents a router queue behavior model (a queue law) for TCP-dropping and TCP-marking control systems, and uses the queue law to illustrate the impact of TCP traffic on the load and queue behavior of congested routers. Through queue law analysis and simulation, this paper confirms that RED-like AQM techniques that employ packet dropping do not significantly improve performance over that of drop-tail queue management. However, when AQM techniques use Explicit Congestion Notification (ECN) as a method to notify TCP sources of congestion rather than packet drops, the performance gains of AQM in terms of goodput and delay can be significant over that of drop-tail queue management.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123020620","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}

引用次数: 48

A configurable middleware framework with multiple quality of service properties for small embedded systems 为小型嵌入式系统提供具有多个服务质量属性的可配置中间件框架

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201156

A. McKinnon, K. Dorow, Tarana R. Damania, O. Haugan, Wesley E. Lawrence, D. Bakken, J. Shovic

引用次数: 21

A scalable protocol for content-based routing in overlay networks 覆盖网络中基于内容的路由的可扩展协议

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201146

Raphaël Chand, P. Felber

{"title":"A scalable protocol for content-based routing in overlay networks","authors":"Raphaël Chand, P. Felber","doi":"10.1109/NCA.2003.1201146","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201146","url":null,"abstract":"In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alternative to unicast or multicast communication in loosely-coupled distributed systems with large number of consumers, with diverse interests, wide geographical dispersion, and heterogeneous resources (e.g., CPU, bandwidth). In this paper, we propose a novel protocol for content-based routing in overlay networks. This protocol guarantees perfect routing (i.e., a message is received by all, and only those, consumers that have registered a matching subscription) and optimizes the usage of the network bandwidth. Furthermore, our protocol takes advantage of subscription aggregation to dramatically reduce the size of the routing tables, and it fully supports dynamic subscription registrations and cancellations without impacting the routing accuracy. We have implemented this protocol in the application-level routers of an overlay network to build a scalable XML-based data dissemination system. Experimental evaluation shows that the size of the routing tables remains small, even with very large populations of consumers.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124880380","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}

引用次数: 134

Performance analysis of an application-level cooperative control protocol 应用级协同控制协议的性能分析

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201169

G. Fortino, C. Mastroianni, W. Russo

引用次数: 4

Building an open grid 构建开放网格

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201155

Ian T Foster

引用次数: 4