{"title":"A scalable replica selection strategy based on flexible contracts","authors":"Corina Ferdean, M. Makpangou","doi":"10.1109/WIAPP.2003.1210293","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210293","url":null,"abstract":"The effectiveness of a replica selection strategy depends on its ability to take into account the metrics that really contribute to the improvement of the QoS perceived by the users. These metrics depend mainly on the replicated application semantics and on the host and network resources that the clients own. We present a replica selection strategy that adapts its criteria dynamically so as to satisfy application providers' and clients' requirements, aggregated into an application binding contract and a client binding contract respectively. We also propose simple access performance heuristics which guide the default selection criteria when a binding contract is not required or is impossible to evaluate. Our protocol also aims to achieve scalability, by using the concept of logical domain, which represents the reduced scope for replica selection.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"494 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127026483","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}
S. Banerjee, Zhichen Xu, Sung-Ju Lee, Chunqiang Tang
{"title":"Service adaptive multicast for media distribution networks","authors":"S. Banerjee, Zhichen Xu, Sung-Ju Lee, Chunqiang Tang","doi":"10.1109/WIAPP.2003.1210286","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210286","url":null,"abstract":"Multicast technology is highly efficient for the large scale multimedia content service delivery. Its efficiency is maximized when all the service recipients have identical needs. In reality however, the end users may have a heterogeneous set of requirements for different service levels as well as different service components, depending on their system and network capabilities. We propose the notion of service adaptive multicast (SAM) that balances the tradeoffs between providing individualized service to each client and maintaining an efficient overlay multicast tree structure. The novel aspects of our approach are (a) the ability to augment and transform existing paths into service paths with the desired attributes; and (b) integration of two tree maintenance processes: a receiver-initiated just-in-time adaptation of the multicast service tree driven by application/user perceived QoS, and a demand-driven tree maintenance process geared towards long-term tree quality. We demonstrate the performance of our approach using simulations of large client population.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125320519","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}
{"title":"The problem with privacy","authors":"J. D. Tygar","doi":"10.1109/WIAPP.2003.1210280","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210280","url":null,"abstract":"We survey issues of privacy, particularly in light of increased concerns for national security. We discuss privacy in two contexts: large distributed information systems and sensor webs. Both of these lead to direct Internet applications.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114725297","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}
{"title":"Latency profiles: performance monitoring for wide area applications","authors":"L. Raschid, H. Wen, A. Gal, V. Zadorozhny","doi":"10.1109/WIAPP.2003.1210290","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210290","url":null,"abstract":"Recent technological advances have enabled the deployment of wide area applications against Internet accessible sources. A performance challenge to applications in such a setting is the unpredictable end-to-end latency of accessing these sources. We use passive information gathering mechanisms to learn end-to-end latency distributions and construct latency profiles (LPs). We hypothesize that a group of clients, within an autonomous system (AS), that are accessing a content server, in another AS, may be represented by (one or more) LPs. Related networking research on IDMaps, points of congestion, and BGP routes support such hypothesis. We develop aggregate LPs to provide coverage of groups (clusters) of client-server pairs. Using data gathered from a (limited) experiment we demonstrate the feasibility of constructing LPs.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127825045","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}
{"title":"Wireless ad hoc networks for internet applications: real or hype?","authors":"P. Mohapatra","doi":"10.1109/WIAPP.2003.1210289","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210289","url":null,"abstract":"Wireless mobile networks and devices are becoming increasingly popular as they provide users access to information and communication anytime and anywhere. Conventional wireless mobile communications are usually supported by a wired fixed infrastructure. A mobile device would use a single-hop wireless radio communication to access a base-station that connects it to the wired infrastructure. In contrast, ad hoc networks do not use any fixed infrastructure. The nodes in an ad hoc network intercommunicate via single-hop and multi-hop paths in a peer-to-peer fashion. Intermediate nodes act as routers between a pair of communicating nodes. Thus the nodes operate both as hosts as well as routers. The nodes in the ad hoc network could be potentially mobile, and so the creation of routing paths is affected by the addition and deletion of nodes. The topology of the network may change randomly, rapidly, and unexpectedly.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451516","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}
{"title":"Application layer multicast for efficient peer-to-peer applications","authors":"A. Wierzbicki, R. Szczepaniak, M. Buszka","doi":"10.1109/WIAPP.2003.1210297","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210297","url":null,"abstract":"Application layer multicast (ALM) can be useful for many types of peer-to-peer (P2P) applications. We compare a group of ALM algorithms, that take into account network topology measurements, using Monte-Carlo simulation. A new algorithm, called Fastcast, is introduced. Fastcast allows to control the tradeoff between used traffic and the worst-case length of the application layer path. ALM algorithms for P2P applications can benefit from the possibility of limiting the number of children in the ALM tree, since many nodes could be connected by slow modem connections. We study the impact of such a limitation on ALM algorithm performance.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126534486","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}
{"title":"Exploiting spatial locality to improve peer-to-peer system performance","authors":"Zhiyong Xu, Yimin Hu","doi":"10.1109/WIAPP.2003.1210296","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210296","url":null,"abstract":"Routing performance is critical for peer-to-peer (P2P) systems to achieve high performance. Current routing algorithms concentrate on creating a well organized network architecture to boost routing performance. However, for each routing procedure, system returns location information of the requested file only and the characteristics of system workload are seldom considered. We propose the UCP2P routing algorithm which introduce \"superobject\" to take advantage of spatial locality among file accesses. When a client retrieves a file, UCP2P routing algorithm may send location information of several other correlated files in addition within one routing procedure. No further routing procedure is needed if the client requests any of these files later. By this mechanism, we can greatly reduce the routing overhead. Our preliminary simulation results show UCP2P achieves a great routing performance improvement over the previous algorithms.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"30 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120903486","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}
{"title":"M-coop: a scalable infrastructure for network measurement","authors":"Sridhar Srinivasan, E. Zegura","doi":"10.1109/WIAPP.2003.1210284","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210284","url":null,"abstract":"We propose M-coop, a scalable, incrementally-deployable, peer-to-peer measurement infrastructure to estimate distance metrics (such as latency, hop count, etc.) between any pair of IP addresses on the Internet. The idea behind M-coop is to have a network of nodes, each of which measures to a small set of peers. When an estimate between two addresses is required, several of these measurements are composed to give the final estimate. Since M-coop is a dynamic peer-to-peer system, we provide and evaluate heuristics for node joins and failures. By conducting experiments on the Internet, we show that our approach has performance similar to other schemes such as IDMaps (P. Francis et al., 2001.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114860030","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}
{"title":"On the effect of large-scale deployment of parallel downloading","authors":"C. Gkantsidis, M. Ammar, E. Zegura","doi":"10.1109/WIAPP.2003.1210291","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210291","url":null,"abstract":"In the presence of multiple mirror servers that can serve the same information, clients can improve their performance when downloading large files by concurrently retrieving different parts of the file from different servers. In previous work, experiments with a single client have shown the potential for parallel downloading schemes to improve the performance perceived by this single client. We consider the question of what happens when parallel downloading is widely adopted within the Internet. To that end we start with an experimental evaluation of various parallel downloading schemes and their performance from the perspective of a single client. We use these results as a benchmark for a set of simulations in which we investigate the performance of parallel downloading when performed by multiple clients. We find that, because parallel downloading incurs additional overhead as a result of its use of more network connections, large-scale use of this technique can actually lead to overall degradation of the performance experienced by clients. Further, we uncover a \"fairness\" tradeoff in that any performance improvement experienced by clients performing parallel downloading comes at the expense of clients who simply go to a single server to retrieve files.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121294007","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}
{"title":"An analysis of network reachability using BGP data","authors":"J. Salido, M. Nakahara, Yinhai Wang","doi":"10.1109/WIAPP.2003.1210281","DOIUrl":"https://doi.org/10.1109/WIAPP.2003.1210281","url":null,"abstract":"Though there have been extensive studies on AS and ISP level topologies, BGP path stability and overall path variations and churn, there is comparatively little data on the behavior of overall reachability in the Internet. We can explain reachability as a measure of path robustness over time, and thus as a significant measure of the general quality of the infrastructure. Our results show that BGP views across different collector route servers, through our period of study, are very homogeneous, and that variations in overall reachability are relatively small. We interpret these observations as indications that overall reachability is robust, and found it to be particularly good in G7 countries, perhaps due to a better communications infrastructure.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126806719","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}