In this paper we propose new strategies for computing virtual geometric node coordinates in peer-to-peer overlays. The main goal is to obtain a decentralized network where each peer has a set of (multidimensional) coordinates and the distance between two peers is proportional to the round-trip time (RTT) between the peers. We consider methods based on the Euclidean distance and the Linfinity norm. We apply our techniques to a multicast tree P2P overlay that we developed.
{"title":"Strategies for Assigning Virtual Geometric Node Coordinates in Peer-to-Peer Overlays","authors":"A. Sambotin, M. Andreica, E. Mocanu","doi":"10.1109/3PGCIC.2011.46","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.46","url":null,"abstract":"In this paper we propose new strategies for computing virtual geometric node coordinates in peer-to-peer overlays. The main goal is to obtain a decentralized network where each peer has a set of (multidimensional) coordinates and the distance between two peers is proportional to the round-trip time (RTT) between the peers. We consider methods based on the Euclidean distance and the Linfinity norm. We apply our techniques to a multicast tree P2P overlay that we developed.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402691","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}
Mohammad Shorfuzzaman, P. Graham, Mehmet Rasit Eskicioglu
Data grids support distributed data-intensive applications that need to access massive datasets stored around the world. Ensuring efficient access to such datasets is hindered by the high latencies of wide-area networks. To speed up access, files can be replicated so a user can access a nearby replica. Much of the work on the replica placement problem in data grids has focused on average system performance and ignored quality assurance issues. In the existing work that considers QoS, a simplified replication model is often assumed, therefore, resulting solutions may not be applicable to real systems. In this paper, we introduce a more realistic model for replica placement in hierarchical Data Grids which determines the positions of a minimum number of replicas expected to satisfy certain quality requirements both from user and system perspectives. Our placement algorithm is based on a highly distributed and decentralized technique that exploits the data access history for popular data files and computes replica locations by minimizing overall replication cost (read and update) while maximizing QoS satisfaction for a given traffic pattern. The problem is formulated using dynamic programming. We assess our algorithm using OptorSim. Simulation results demonstrate the effectiveness of our replica placement technique considering various factors such as storage and workload constraints of replica servers, link capacity constraints, user QoS requirements, etc.
{"title":"Distributed Placement of Replicas in Hierarchical Data Grids with User and System QoS Constraints","authors":"Mohammad Shorfuzzaman, P. Graham, Mehmet Rasit Eskicioglu","doi":"10.1109/3PGCIC.2011.35","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.35","url":null,"abstract":"Data grids support distributed data-intensive applications that need to access massive datasets stored around the world. Ensuring efficient access to such datasets is hindered by the high latencies of wide-area networks. To speed up access, files can be replicated so a user can access a nearby replica. Much of the work on the replica placement problem in data grids has focused on average system performance and ignored quality assurance issues. In the existing work that considers QoS, a simplified replication model is often assumed, therefore, resulting solutions may not be applicable to real systems. In this paper, we introduce a more realistic model for replica placement in hierarchical Data Grids which determines the positions of a minimum number of replicas expected to satisfy certain quality requirements both from user and system perspectives. Our placement algorithm is based on a highly distributed and decentralized technique that exploits the data access history for popular data files and computes replica locations by minimizing overall replication cost (read and update) while maximizing QoS satisfaction for a given traffic pattern. The problem is formulated using dynamic programming. We assess our algorithm using OptorSim. Simulation results demonstrate the effectiveness of our replica placement technique considering various factors such as storage and workload constraints of replica servers, link capacity constraints, user QoS requirements, etc.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123870994","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}
For several years, agencies and bodies around the world have been highlighting the increasing number and impact of disasters due to natural hazards and technological accidents. Unquestionably, these threats have raised levels of concern and challenged the sustainability of our communities at local, regional, national and international levels. In this paper, we describe these concerns and propose the development of a dynamic and integrated prevention policies approach on the basis of continuously updated and autonomously produced risk and vulnerability assessments and maps that will be presented in an interactive visualization tool. We conclude with some future steps in mind.
{"title":"Towards an Integrated Multi-hazard Prevention Assessment for Community Threats","authors":"E. Asimakopoulou, N. Bessis","doi":"10.1109/3PGCIC.2011.60","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.60","url":null,"abstract":"For several years, agencies and bodies around the world have been highlighting the increasing number and impact of disasters due to natural hazards and technological accidents. Unquestionably, these threats have raised levels of concern and challenged the sustainability of our communities at local, regional, national and international levels. In this paper, we describe these concerns and propose the development of a dynamic and integrated prevention policies approach on the basis of continuously updated and autonomously produced risk and vulnerability assessments and maps that will be presented in an interactive visualization tool. We conclude with some future steps in mind.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128936142","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}
Recently, there are many volunteer activities and contributions for disaster recovery. However, if these activities are not controlled, there will be a lot of troubles. During the Earthquake of Tohoku Area in Japan on March 2011, there were many problems caused by volunteer activities. In order to deal with these problems, we propose a coordinate system considering both demands on the disaster area and supply of the relief goods and the volunteers. In this paper, we discuss the system to eliminate "trouble making volunteers" and "trouble making relief goods" on disaster area.
{"title":"A Study on Design of Disaster Information - A Proposal of Coordinate System for Supply and Demand on Disaster Recovery","authors":"Daisuke Endo, Kaoru Sugita","doi":"10.1109/3PGCIC.2011.55","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.55","url":null,"abstract":"Recently, there are many volunteer activities and contributions for disaster recovery. However, if these activities are not controlled, there will be a lot of troubles. During the Earthquake of Tohoku Area in Japan on March 2011, there were many problems caused by volunteer activities. In order to deal with these problems, we propose a coordinate system considering both demands on the disaster area and supply of the relief goods and the volunteers. In this paper, we discuss the system to eliminate \"trouble making volunteers\" and \"trouble making relief goods\" on disaster area.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132459454","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}
N. Djarallah, N. L. Sauze, Hélia Pouyllau, S. Lahoud, Bernard A. Cousin
Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quality of experience (QoE). Telecommunication operators have to face a continuing growth of new types of Internet traffic (video, games, telepresence, etc.) imposing not only a more efficient utilization of their network infrastructure resources, but also the generation of new revenues to pursue investments and sustain the increasing demand. Such services generally cross multiple domains, but inter-domain routing protocols still have some limitations in terms of service assurance. For example, BGP's single route announce for a destination limits potential traffic engineering features (e.g. no quality of service price/efficiency optimisation, inter-domain shared route protection, inter-domain load balancing, etc.). In order to provision end-to-end inter-domain connections that obey to constraints such as bandwidth, delay, jitter, and packet loss for these services, an interesting approach is to compute end-to-end (e2e) paths over multiple inter-domain routes. This will allow establishing more efficiently the inter-domain connections with respect to requested QoS constraints and sharing these constraints (and associated revenues) among multiple operators to globally accept more demands in the system, while keep satisfying the customer QoE. To address these challenges, we propose an efficient distributed inter-domain algorithm that computes such constrained paths among a set of domains, exploring multiple inter-domain routes. We demonstrate that our algorithm not only increases success rate in delivering feasible paths, but also admits more connections and keeps a reasonable runtime.
{"title":"Distributed E2E QoS-Based Path Computation Algorithm over Multiple Inter-domain Routes","authors":"N. Djarallah, N. L. Sauze, Hélia Pouyllau, S. Lahoud, Bernard A. Cousin","doi":"10.1109/3PGCIC.2011.34","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.34","url":null,"abstract":"Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quality of experience (QoE). Telecommunication operators have to face a continuing growth of new types of Internet traffic (video, games, telepresence, etc.) imposing not only a more efficient utilization of their network infrastructure resources, but also the generation of new revenues to pursue investments and sustain the increasing demand. Such services generally cross multiple domains, but inter-domain routing protocols still have some limitations in terms of service assurance. For example, BGP's single route announce for a destination limits potential traffic engineering features (e.g. no quality of service price/efficiency optimisation, inter-domain shared route protection, inter-domain load balancing, etc.). In order to provision end-to-end inter-domain connections that obey to constraints such as bandwidth, delay, jitter, and packet loss for these services, an interesting approach is to compute end-to-end (e2e) paths over multiple inter-domain routes. This will allow establishing more efficiently the inter-domain connections with respect to requested QoS constraints and sharing these constraints (and associated revenues) among multiple operators to globally accept more demands in the system, while keep satisfying the customer QoE. To address these challenges, we propose an efficient distributed inter-domain algorithm that computes such constrained paths among a set of domains, exploring multiple inter-domain routes. We demonstrate that our algorithm not only increases success rate in delivering feasible paths, but also admits more connections and keeps a reasonable runtime.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133570501","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}
Streaming media such as GPS, wireless sensor nodes, RFID and electric commerce are spreading over our lives. To process data streams from such streaming media, DSMS has been developed and widely used. While DBMSs are rarely used to process data streams directly, there is a growing need to integrate DSMS and DBMS, which means to use DBMS as a source of information related to data streams and to use DBMS to archive data streams. In such integration of DSMS and DBMS, transactions are triggered by data streams. Since arrival rate of data streams can be extremely high, it is necessary to invoke those transaction sequences efficiently to keep performance of DSMS. In this paper, we model invocation of transaction sequences and propose three schemes named Synchronous Transaction Sequence Invocation (STSI), Asynchronous Transaction Sequence Invocation (ATSI) and Order-Preserving Asynchronous Transaction Sequence Invocation (OPATSI). We built a prototype system which implements those schemes and conducted experiments to evaluate their performance. Our primary experiments showed that we experienced an order of magnitude higher throughput in transaction processing by using ATSI compared with STSI while breaking the order of transaction results. The results of experiments also showed that throughput of OPATSI is comparable to that of the ATSI, though it preserves the order of transaction results.
{"title":"Efficient Invocation of Transaction Sequences Triggered by Data Streams","authors":"M. Oyamada, H. Kawashima, H. Kitagawa","doi":"10.1109/3PGCIC.2011.63","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.63","url":null,"abstract":"Streaming media such as GPS, wireless sensor nodes, RFID and electric commerce are spreading over our lives. To process data streams from such streaming media, DSMS has been developed and widely used. While DBMSs are rarely used to process data streams directly, there is a growing need to integrate DSMS and DBMS, which means to use DBMS as a source of information related to data streams and to use DBMS to archive data streams. In such integration of DSMS and DBMS, transactions are triggered by data streams. Since arrival rate of data streams can be extremely high, it is necessary to invoke those transaction sequences efficiently to keep performance of DSMS. In this paper, we model invocation of transaction sequences and propose three schemes named Synchronous Transaction Sequence Invocation (STSI), Asynchronous Transaction Sequence Invocation (ATSI) and Order-Preserving Asynchronous Transaction Sequence Invocation (OPATSI). We built a prototype system which implements those schemes and conducted experiments to evaluate their performance. Our primary experiments showed that we experienced an order of magnitude higher throughput in transaction processing by using ATSI compared with STSI while breaking the order of transaction results. The results of experiments also showed that throughput of OPATSI is comparable to that of the ATSI, though it preserves the order of transaction results.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127917425","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：