Delay is a key Internet performance metric and its stability, variation, and abrupt changes have been well studied. However, little could have been said about the Internet-wide delay distribution. In order to build a representative sample set for the Internet-wide delay distribution, one needs to draw data from a random selection of source hosts to destination hosts and there is no measurement system with access to every AS and subnet of the Internet. In this work we propose to apply the path-stitching algorithm to archival measurement data and reconstruct the past history of Internet delay distribution. The two main advantages of path stitching are that data from existing measurement projects is sufficient to provide accurate estimates and it produces delay estimates between almost any two hosts in the Internet. As a first step towards the longitudinal study of the Internet-wide delay distribution, we examine how the Internet delay changes from 2004 to 2009. Our work is the first ever systematic approach to Internet delay distribution. We report the overall delay distribution has gotten worse from 2004 to 2009, while the delay distribution for the same set of host pairs remains almost identical or slightly improved.
{"title":"Has internet delay gotten better or worse?","authors":"D. K. Lee, Kenjiro Cho, G. Iannaccone, S. Moon","doi":"10.1145/1853079.1853094","DOIUrl":"https://doi.org/10.1145/1853079.1853094","url":null,"abstract":"Delay is a key Internet performance metric and its stability, variation, and abrupt changes have been well studied. However, little could have been said about the Internet-wide delay distribution. In order to build a representative sample set for the Internet-wide delay distribution, one needs to draw data from a random selection of source hosts to destination hosts and there is no measurement system with access to every AS and subnet of the Internet.\u0000 In this work we propose to apply the path-stitching algorithm to archival measurement data and reconstruct the past history of Internet delay distribution. The two main advantages of path stitching are that data from existing measurement projects is sufficient to provide accurate estimates and it produces delay estimates between almost any two hosts in the Internet. As a first step towards the longitudinal study of the Internet-wide delay distribution, we examine how the Internet delay changes from 2004 to 2009. Our work is the first ever systematic approach to Internet delay distribution. We report the overall delay distribution has gotten worse from 2004 to 2009, while the delay distribution for the same set of host pairs remains almost identical or slightly improved.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114734781","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}
In this paper, we formulate the virtual network embedding problem in wireless networks and suggest a framework to approach the problem. Also, we show an application of our problem modeling framework with ORBIT which is one of famous wireless test-bed networks.
{"title":"A framework for virtual network embedding in wireless networks","authors":"Keunmo Park, Chong-kwon Kim","doi":"10.1145/1555697.1555706","DOIUrl":"https://doi.org/10.1145/1555697.1555706","url":null,"abstract":"In this paper, we formulate the virtual network embedding problem in wireless networks and suggest a framework to approach the problem. Also, we show an application of our problem modeling framework with ORBIT which is one of famous wireless test-bed networks.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657561","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}
Joohyung Lee, Kyunghan Lee, Jaesung Jung, S. Chong
As providing data networks in an urban district through a cellular system is expensive and does not provide sufficient capacity, use of a wireless mesh network is generally considered as a way to achieve more capacity. While a mesh network has sizable installation costs to deploy routers and still does not provide abundant capacity, it is worthwhile to consider a DTN whose capacity is abundant without additional installation costs to support a mesh network. In this paper, we propose an architecture of a DTN as an infrastructure network and study the capacity region of the DTN over the real mobility of Shanghai taxies. We identify and verify several key characteristics of the DTN capacity, including time-varying and asymmetric characteristics. Our simulation results show that the capacity of the DTN is superior to a mesh network most of the time for both single-link and multi-link scenarios.
{"title":"Performance evaluation of a DTN as a city-wide infrastructure network","authors":"Joohyung Lee, Kyunghan Lee, Jaesung Jung, S. Chong","doi":"10.1145/1555697.1555717","DOIUrl":"https://doi.org/10.1145/1555697.1555717","url":null,"abstract":"As providing data networks in an urban district through a cellular system is expensive and does not provide sufficient capacity, use of a wireless mesh network is generally considered as a way to achieve more capacity. While a mesh network has sizable installation costs to deploy routers and still does not provide abundant capacity, it is worthwhile to consider a DTN whose capacity is abundant without additional installation costs to support a mesh network. In this paper, we propose an architecture of a DTN as an infrastructure network and study the capacity region of the DTN over the real mobility of Shanghai taxies. We identify and verify several key characteristics of the DTN capacity, including time-varying and asymmetric characteristics. Our simulation results show that the capacity of the DTN is superior to a mesh network most of the time for both single-link and multi-link scenarios.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115016077","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}
Frequently, complex systems in nature as well as in human society suffer massive catastrophes triggered from only a small fraction of their constituents. Unexpected epidemic spread of diseases, the power outage, and the congestion of packet transport in the Internet are prototypical examples of such avalanche phenomena. Such a cascading dynamics is not always harmful to us. The information cascades making popular hits of books, movies, and albums are good to writers, actors, and singers, respectively. Thus, it is interesting to understand and predict how those cascades propagate in complex systems. Recently, the network approach, by which a system is viewed as a network consisting of nodes representing its constituents and links interactions between them, simplifies complicated details of complex systems. In my talk, I present how cascading dynamics in complex systems can be modeled on complex networks. In many cases, cascading dynamics spreads along the path that is a tree. When the network is scale-free in the degree distribution, the tree can be a critical branching tree. In this case, the avalanche dynamics can be understood the multiplicative branching process. Using this method, we can set up the self-consistent equation for the avalanche size distribution, which behaves in a power law fashion. This method can be modified to study the fad propagation problem. it is important to choose a triggering node. Such theoretical results are confirmed by numerical simulations. I will introduce a recent model to prevent such a cascading dynamics on the complex network. For the problem of packet congestions, we study the transition between the free-flow to congested state as the number of packets increases. At the transition point, there exists a synchronized phase, in which the traffic flow changes in jammed or relaxed state, alternatively. In this case, the congested nodes (routers) can spread out over the entire systems, and recover to the normal state, alternatively. The congested area can fluctuate over time. As a result, the power spectrum of the traffic amount on the network exhibits 1/f-type behavior.
{"title":"Cascading dynamics on complex networks","authors":"B. Kahng","doi":"10.1145/1555697.1555703","DOIUrl":"https://doi.org/10.1145/1555697.1555703","url":null,"abstract":"Frequently, complex systems in nature as well as in human society suffer massive catastrophes triggered from only a small fraction of their constituents. Unexpected epidemic spread of diseases, the power outage, and the congestion of packet transport in the Internet are prototypical examples of such avalanche phenomena. Such a cascading dynamics is not always harmful to us. The information cascades making popular hits of books, movies, and albums are good to writers, actors, and singers, respectively. Thus, it is interesting to understand and predict how those cascades propagate in complex systems. Recently, the network approach, by which a system is viewed as a network consisting of nodes representing its constituents and links interactions between them, simplifies complicated details of complex systems. In my talk, I present how cascading dynamics in complex systems can be modeled on complex networks. In many cases, cascading dynamics spreads along the path that is a tree. When the network is scale-free in the degree distribution, the tree can be a critical branching tree. In this case, the avalanche dynamics can be understood the multiplicative branching process. Using this method, we can set up the self-consistent equation for the avalanche size distribution, which behaves in a power law fashion. This method can be modified to study the fad propagation problem. it is important to choose a triggering node. Such theoretical results are confirmed by numerical simulations. I will introduce a recent model to prevent such a cascading dynamics on the complex network. For the problem of packet congestions, we study the transition between the free-flow to congested state as the number of packets increases. At the transition point, there exists a synchronized phase, in which the traffic flow changes in jammed or relaxed state, alternatively. In this case, the congested nodes (routers) can spread out over the entire systems, and recover to the normal state, alternatively. The congested area can fluctuate over time. As a result, the power spectrum of the traffic amount on the network exhibits 1/f-type behavior.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126373276","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}
In this paper, we present the integrated video transmission system that is suitable for future internet environment. The goal of the proposed system is to provide a stable video streaming service over heterogeneous networks. First, we investigate what is the important aspect to supporting end-to-end QoS. Second, we propose an effective integrated video transmission system that combines cross network and layer approach to satisfy end-to-end QoS in order to enhance video quality. Finally, the proposed system will be implemented in software and tested in real environments.
{"title":"Cross network and layer approach for video transmission over the future internet","authors":"GyeongCheol Lee, Sangchun Han, Hwangjun Song","doi":"10.1145/1555697.1555722","DOIUrl":"https://doi.org/10.1145/1555697.1555722","url":null,"abstract":"In this paper, we present the integrated video transmission system that is suitable for future internet environment. The goal of the proposed system is to provide a stable video streaming service over heterogeneous networks. First, we investigate what is the important aspect to supporting end-to-end QoS. Second, we propose an effective integrated video transmission system that combines cross network and layer approach to satisfy end-to-end QoS in order to enhance video quality. Finally, the proposed system will be implemented in software and tested in real environments.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132959874","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}
As the Internet evolves into an irreplaceable service infrastructure for modern human life, a key issue to consider is that of creating and managing a rich variety of services while keeping aware of individual requirements with guaranteed QoS (Quality of Service). In this paper, we present a tentative model for virtualized resource-aware dynamic media-oriented service composition where the service overlayer, service aggregators and resource aggregators cooperate to achieve an effective coordination of the dynamically changing requirements according to user's context and resource heterogeneity. As a first step of this on-going effort, we attempt to propose a conceptual idea for resource-provisioned service overlay network called AptusNet by focusing our attention on the provisioning aspect of the service and virtualized resource components.
{"title":"A tentative model for virtualized resource-aware dynamic media-oriented service composition","authors":"Dong-Hoon Yi, JongWon Kim","doi":"10.1145/1555697.1555713","DOIUrl":"https://doi.org/10.1145/1555697.1555713","url":null,"abstract":"As the Internet evolves into an irreplaceable service infrastructure for modern human life, a key issue to consider is that of creating and managing a rich variety of services while keeping aware of individual requirements with guaranteed QoS (Quality of Service). In this paper, we present a tentative model for virtualized resource-aware dynamic media-oriented service composition where the service overlayer, service aggregators and resource aggregators cooperate to achieve an effective coordination of the dynamically changing requirements according to user's context and resource heterogeneity. As a first step of this on-going effort, we attempt to propose a conceptual idea for resource-provisioned service overlay network called AptusNet by focusing our attention on the provisioning aspect of the service and virtualized resource components.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132463950","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}
BGP is the most important component of Internet routing and yet it is vulnerable to many threats such as IP prefix hijacking, which has created significant problems over the decade. There have been two approaches to address the IP prefix hijacking issue: anomaly detection-based approach and cryptography-based one. Due to complexity and deployment concern of the latter, there are a lot of solutions that take the former approach. We propose a probabilistic IP prefix authentication (PIPA) scheme that leverages the existing BGP anomaly detection-based solutions as well as public internet registry information. That is, PIPA determines the authenticity of the pair (IP prefix, AS path) in BGP messages by using historical stability of the BGP information and internet registry data. We also discuss how to recover the hijacked IP prefixes in PIPA.
{"title":"Probabilistic IP prefix authentication (PIPA) for prefix hijacking","authors":"Akmal Khan, T. Kwon, Hyunchul Kim","doi":"10.1145/1555697.1555725","DOIUrl":"https://doi.org/10.1145/1555697.1555725","url":null,"abstract":"BGP is the most important component of Internet routing and yet it is vulnerable to many threats such as IP prefix hijacking, which has created significant problems over the decade. There have been two approaches to address the IP prefix hijacking issue: anomaly detection-based approach and cryptography-based one. Due to complexity and deployment concern of the latter, there are a lot of solutions that take the former approach. We propose a probabilistic IP prefix authentication (PIPA) scheme that leverages the existing BGP anomaly detection-based solutions as well as public internet registry information. That is, PIPA determines the authenticity of the pair (IP prefix, AS path) in BGP messages by using historical stability of the BGP information and internet registry data. We also discuss how to recover the hijacked IP prefixes in PIPA.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141760","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}
This talk presents the current status of R&D on New Generation Network (NWGN) in Japan which is expected to be developed until 2020 as a network beyond the Internet and Next Generation Network (NGN). Social and technological requirements for NWGN and the Japanese formation of R&D are introduced. Some of key technologies studied in Japan for NWGN are shown.
{"title":"Overview of the new generation network R&D in Japan","authors":"T. Aoyama","doi":"10.1145/1555697.1555699","DOIUrl":"https://doi.org/10.1145/1555697.1555699","url":null,"abstract":"This talk presents the current status of R&D on New Generation Network (NWGN) in Japan which is expected to be developed until 2020 as a network beyond the Internet and Next Generation Network (NGN). Social and technological requirements for NWGN and the Japanese formation of R&D are introduced. Some of key technologies studied in Japan for NWGN are shown.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129919134","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}
Today wireless local area networks (WLAN) are evolving with an aim to enhance the throughput performance leveraging various cutting-edge technologies. In this paper, we compare the aggregate throughput performance of two different multi-channel access schemes, namely, channel bonding (of the emerging IEEE 802.11n standard) and multi-radio MAC. Numerical analysis demonstrates that even though the channel bonding scheme can provide the higher physical layer transmission rate with the wider bandwidth, this does not always guarantee a higher aggregate throughput due to the relatively larger MAC overhead. Moreover, it is shown that distributing stations across multiple channels with multi-radio MAC can further enhance the aggregate throughput performance due to the reduced contention overhead.
{"title":"On the multi-channel access schemes of the evolving WLANs","authors":"Hyewon Lee, Kwanghun Han, Youngwoo Hwang, Sunghyun Choi","doi":"10.1145/1555697.1555720","DOIUrl":"https://doi.org/10.1145/1555697.1555720","url":null,"abstract":"Today wireless local area networks (WLAN) are evolving with an aim to enhance the throughput performance leveraging various cutting-edge technologies. In this paper, we compare the aggregate throughput performance of two different multi-channel access schemes, namely, channel bonding (of the emerging IEEE 802.11n standard) and multi-radio MAC. Numerical analysis demonstrates that even though the channel bonding scheme can provide the higher physical layer transmission rate with the wider bandwidth, this does not always guarantee a higher aggregate throughput due to the relatively larger MAC overhead. Moreover, it is shown that distributing stations across multiple channels with multi-radio MAC can further enhance the aggregate throughput performance due to the reduced contention overhead.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126277136","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}
Utilization of multiple radio interfaces increases throughput of wireless networks. Existing work proposes a multi-radio routing protocol exploiting link quality and channel diversity of a path. While an established path is deteriorated by interferences incurred by any changes in a network, and existing work does not detect the deterioration. In this paper, we propose an interference-aware multi-radio routing protocol detecting and resolving dynamic path deterioration in wireless mesh networks.
{"title":"Interference-aware routing protocol in multi-radio wireless mesh networks","authors":"B. Shin, Y. Ko, Jisun An, Dongman Lee","doi":"10.1145/1555697.1555709","DOIUrl":"https://doi.org/10.1145/1555697.1555709","url":null,"abstract":"Utilization of multiple radio interfaces increases throughput of wireless networks. Existing work proposes a multi-radio routing protocol exploiting link quality and channel diversity of a path. While an established path is deteriorated by interferences incurred by any changes in a network, and existing work does not detect the deterioration. In this paper, we propose an interference-aware multi-radio routing protocol detecting and resolving dynamic path deterioration in wireless mesh networks.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121363551","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
扫码关注我们
求助内容：
应助结果提醒方式：