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

筛选
英文 中文
LSOM: A Link State protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches LSOM:使用以太网光交换机的城域骨干网在MAC地址上的一种链路状态协议
Román García, J. Duato, F. Silla
{"title":"LSOM: A Link State protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches","authors":"Román García, J. Duato, F. Silla","doi":"10.1109/NCA.2003.1201170","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201170","url":null,"abstract":"This paper presents a new protocol named \"Link State Over MAC\" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"56 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131717201","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}
引用次数: 36
SWIFT: scheduling in web servers for fast response time SWIFT:调度在web服务器快速响应时间
Mayank Rawat, A. Kshemkalyani
{"title":"SWIFT: scheduling in web servers for fast response time","authors":"Mayank Rawat, A. Kshemkalyani","doi":"10.1109/NCA.2003.1201137","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201137","url":null,"abstract":"This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the shortest remaining processing time scheduling (SRPT) in Web servers in order to give preference to requests for short files. However by considering only the size of the file for determining the priority of requests, the previous works lack in capturing potentially useful scheduling information contained in the interaction between networks and end systems. To address this, this paper proposes and implements an algorithm, SWIFT that focuses on both server and network characteristics in conjunction. Our approach prioritizes requests based on the size of the file requested and the distance of the client from the server The implementation is at the kernel level for a finer-grained control over the packets entering the network. We present the results of the experiments conducted in a WAN environment to test the efficacy of SWIFT The results show that for large-sized files, SWIFT shows an improvement of 2.5% - 10% over the SRPT scheme for the tested server loads.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"4 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":"121135070","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}
引用次数: 43
Content replication in Web++ Web++中的内容复制
Mehmet Sayal, P. Scheuermann, Radek Vingralek
{"title":"Content replication in Web++","authors":"Mehmet Sayal, P. Scheuermann, Radek Vingralek","doi":"10.1109/NCA.2003.1201135","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201135","url":null,"abstract":"Web++ is a prototype system that supports user transparent wide area replication of resources in order to improve the response time and reliability of the HTTP service. Our architecture is based on smart clients, and can be dynamically downloaded as mobile code into a user's application, presents a number of advantages. Clients keep track of the average HTTP latency that they experience from various servers and use that information in order to make to choose the replica of a resource that is expected to deliver the best response time for them. The clients also provide feedback on the observed request latencies to the servers, which allows helps the servers to determine which resources should be replicated and what would be the best locations for the replicas. We describe in this paper a distributed server-initiated approach for resource replication in which all servers can decide autonomously whether to replicate resources and the locations where the replicas should be allocated. In addition to the novel use of smart clients, our algorithm also avoids keeping track of complex network topologies by using the concept of logical segments. We present the results of experiments that show that our algorithm for resource allocation scale well with respect to the number of servers and the number of replicated resources.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"36 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114041957","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}
引用次数: 13
Performance study of reliable server pooling 可靠服务器池的性能研究
M. U. Uyar, Jianliang Zheng, M. Fecko, S. Samtani
{"title":"Performance study of reliable server pooling","authors":"M. U. Uyar, Jianliang Zheng, M. Fecko, S. Samtani","doi":"10.1109/NCA.2003.1201157","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201157","url":null,"abstract":"The reliable server pooling allows redundant information sources to be viewed as a single transport endpoint, and therefore is able to provide persistent connections and balanced traffic. The IETF RSerPool Working Group has proposed an architecture to implement the reliable server pooling. We conducted a number of simulation experiments with the current definitions of the RSerPool protocols to quantify their performance in both wired and wireless environments. The simulation results show that the RSerPool works well in fixed and relatively reliable environments, but its performance worsens rapidly as the networks become more unreliable or mobile. The issues we identified in wireless mobile ad-hoc networks include network partitioning, high signaling overhead, and excessive aggressiveness in handling failures. These problems are partly due to the heavy reliance of the RSerPool architecture on the reliability of the underlying network,, which is unlikely to be guaranteed in a wireless mobile ad-hoc environment.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"1 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":"130530046","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
Network assisted IP mobility support in wireless LANs 无线局域网中的网络辅助IP移动性支持
Wei Wu, N. Banerjee, K. Basu, Sajal K. Das
{"title":"Network assisted IP mobility support in wireless LANs","authors":"Wei Wu, N. Banerjee, K. Basu, Sajal K. Das","doi":"10.1109/NCA.2003.1201164","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201164","url":null,"abstract":"In recent years, wide bandwidth and low cost wireless LAN (WLAN) technology has emerged as a competitive choice for high speed wireless Internet access. To support the Internet mobility for the frequently moving mobile nodes in the local WLAN environment, Mobile IP has been found to be inefficient due to its high location update and packet delivery cost. This paper proposes an alternative architecture for network-layer mobility support using dynamic client configuration and transparent proxy mechanism. The attractive feature of our solution is that it requires no change in the legacy network infrastructure. We have implemented a prototype of the proposed architecture, and have taken experimental measurements to evaluate its performance. Experimental results show that the proposed architecture is capable of supporting IP mobility with the handoff delay less than a second. In addition, we have done an analytical study to test the scalability of the proposed architecture. Results show that performance of the architecture is not severely affected by the user mobility and a commonplace router is capable of supporting a considerable number of such users.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"56 4 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":"130573136","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
Split-layer video multicast protocol: a new receiver-based rate-adaptation protocol 分层视频组播协议:一种新的基于接收端的速率自适应协议
Simon C. Brennan, N. Chilamkurti, B. Soh
{"title":"Split-layer video multicast protocol: a new receiver-based rate-adaptation protocol","authors":"Simon C. Brennan, N. Chilamkurti, B. Soh","doi":"10.1109/NCA.2003.1201144","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201144","url":null,"abstract":"This paper proposes a new receiver-based rate-adaptation protocol for multicasting video, called Split-Layer Video Multicast (SPLIT). Unlike existing receiver-based rate-adaptation protocols, such as Receiver-driven Layered Multicast (RLM), the SPLIT protocol is specifically designed to take advantage of existing packet loss concealment techniques to provide end-users with increased quality of video. In an effort to gauge the performance of the SPLIT protocol, a number of experiments using the NS-2 network simulator were conducted and the results were compared with those of the RLM protocol. The results show that the proposed SPLIT protocol utilizes the available bandwidth in a more efficient way than the RLM protocol does.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"5 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":"127837256","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
The quest for the perfect server for network computing applications 为网络计算应用寻找完美的服务器
P. Mehra
{"title":"The quest for the perfect server for network computing applications","authors":"P. Mehra","doi":"10.1109/NCA.2003.1201158","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201158","url":null,"abstract":"This talk begins with an examination of server-side architecture and workload trends. Severe performance and availability gaps in server architecture, compounded by the growing cost and complexity of development and deployment, are shown hampering the successful adoption of Web services. Two architectural remedies are proposed: (I) unification of I/O and memory; and (II) whole system programming. The proposed Apsara architecture for servers combines these new techniques with the best of existing server architecture concepts. The talk concludes with identification of key technical challenges and opportunities, and insights from early experiences in implementing Apsara.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"48 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":"123394267","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
Optimal content placement for en-route web caching 路由web缓存的最佳内容放置
Anxiao Jiang, Jehoshua Bruck
{"title":"Optimal content placement for en-route web caching","authors":"Anxiao Jiang, Jehoshua Bruck","doi":"10.1109/NCA.2003.1201132","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201132","url":null,"abstract":"This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the file placement problem, and therefore give only sub-optimal solutions. A dynamic programming algorithm of low complexity which computes the optimal solution is presented. It is shown both analytically and experimentally that the file-placement solution output by our algorithm outperforms existing en-route caching policies. The optimal placement of web files can be implemented with a reasonable level of cache coordination and management overhead for en-route caching; and importantly, it can be achieved with or without using data prefetching.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"3 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":"117004237","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}
引用次数: 49
AdHocFS: sharing files in WLANs AdHocFS:在wlan中共享文件
Malika Boulkenafed, V. Issarny
{"title":"AdHocFS: sharing files in WLANs","authors":"Malika Boulkenafed, V. Issarny","doi":"10.1109/NCA.2003.1201150","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201150","url":null,"abstract":"This paper presents the ADHOCFS file system for mobile users, which realizes transparent, adaptive file access according to the users' specific situations (e.g., device in use, network connectivity, etc). The paper concentrates more specifically on the support of ADHOCFS for collaborative file sharing within ad hoc groups of trusted nodes that are in the local communication of each other using the underlying ad hoc network, which has not been addressed in the past.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"15 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":"115669768","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}
引用次数: 50
Trigger grouping: a scalable approach to large scale information monitoring 触发器分组:用于大规模信息监控的可伸缩方法
Wei Tang, Ling Liu, C. Pu
{"title":"Trigger grouping: a scalable approach to large scale information monitoring","authors":"Wei Tang, Ling Liu, C. Pu","doi":"10.1109/NCA.2003.1201149","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201149","url":null,"abstract":"Information change monitoring services are becoming increasingly useful as more and more information is published on the Web. A major research challenge is how to make the service scalable to serve millions of monitoring requests. Such services usually use soft triggers to model users' monitoring requests. We have developed an effective trigger grouping scheme to optimize the trigger processing. The main idea behind this scheme is to reduce repeated computation by grouping monitoring requests of similar structures together. In this paper, we evaluate our approach using both measurements on real systems and simulations. The study shows significant performance gains using the trigger grouping approach. Moreover, the gains are critically dependent on group size and group size distribution (e.g., Zipf). We also discuss the benefit, trade-off, and runtime characteristics of the proposed approach.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"100 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":"125413624","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
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学术官方微信