BGP data are very important for understanding the dynamics of the inter domain routing. With the development of Internet, the routing data that BGP routers deals with are increasing dramatically. Nowadays, the most important factor to restrict the research process for general scientific researchers is how to deal with the large volume metadata of TB sizes. Not to mention that metadata sizes can be times larger after decompression. In this paper, we address this problem by presenting a framework, which can deal with large volume of data and extract potential information. What's more, it as well reveals some characteristics of the inter domain routing over long timescale.
{"title":"A Framework for the Analysis of BGP Data over Long Timescales","authors":"Geng Zhang, Dahua Zhang, Lei Lu, Min Zhu","doi":"10.1145/2935663.2935680","DOIUrl":"https://doi.org/10.1145/2935663.2935680","url":null,"abstract":"BGP data are very important for understanding the dynamics of the inter domain routing. With the development of Internet, the routing data that BGP routers deals with are increasing dramatically. Nowadays, the most important factor to restrict the research process for general scientific researchers is how to deal with the large volume metadata of TB sizes. Not to mention that metadata sizes can be times larger after decompression. In this paper, we address this problem by presenting a framework, which can deal with large volume of data and extract potential information. What's more, it as well reveals some characteristics of the inter domain routing over long timescale.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125240524","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}
Resource metering in distributed environments is notoriously difficult. In clouds, the metering technology has to be distributed by design. This paper shows that the technology used for (financial) micropayments fulfills several objectives of the new metering process once the concept of money is replaced with the concept of a resource. Like in micropayments, resource metering in clouds is often a 3-party relationship like that among cloud provider, service provider and customer. The technology proposed in this paper can be viewed both as a better alternative to traditional micropayments as well as a new way to meter resource usage in clouds.
{"title":"Coins in cloud drives can use OAuth for micropayments and resource metering alike","authors":"M. Zhanikeev","doi":"10.1145/2619287.2619304","DOIUrl":"https://doi.org/10.1145/2619287.2619304","url":null,"abstract":"Resource metering in distributed environments is notoriously difficult. In clouds, the metering technology has to be distributed by design. This paper shows that the technology used for (financial) micropayments fulfills several objectives of the new metering process once the concept of money is replaced with the concept of a resource. Like in micropayments, resource metering in clouds is often a 3-party relationship like that among cloud provider, service provider and customer. The technology proposed in this paper can be viewed both as a better alternative to traditional micropayments as well as a new way to meter resource usage in clouds.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130643978","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 Software-Defined Networking (SDN), the control plane can program the data plane via SDN open APIs such as OpenFlow. An OpenFlow-like data plane applies rules to every packet. However, it only supports a few actions that are all predefined and hardcoded to a piece of hardware in SDN switch. We argue that we should extend the programmability and flexibility of SDN to the data plane to allow network owners to add their custom network functions while keeping the programability of existing SDN. Since current OpenFlow actions are not sufficient and flexible, we posit we need user-defined actions deployed within the switch box rather than an external equipment (e.g., Fire-wall). Finally, we study the feasibility of two sample user-defined actions (i.e., Portscan detector and Botminer detector) using two different underlying mechanisms: OpenFlow and our previous work, TagFlow. Our evaluations show that user-defined actions are capable of handling traffic at line speed. Moreover, we also indicate that TagFlow user-defined actions are 33% faster than OpenFlow. We concluded that extending SDN features to include user-defined actions is lightweight and feasible.
{"title":"User-defined actions for SDN","authors":"H. Farhadi, P. Du, A. Nakao","doi":"10.1145/2619287.2619292","DOIUrl":"https://doi.org/10.1145/2619287.2619292","url":null,"abstract":"In Software-Defined Networking (SDN), the control plane can program the data plane via SDN open APIs such as OpenFlow. An OpenFlow-like data plane applies <match, action> rules to every packet. However, it only supports a few actions that are all predefined and hardcoded to a piece of hardware in SDN switch. We argue that we should extend the programmability and flexibility of SDN to the data plane to allow network owners to add their custom network functions while keeping the programability of existing SDN. Since current OpenFlow actions are not sufficient and flexible, we posit we need user-defined actions deployed within the switch box rather than an external equipment (e.g., Fire-wall). Finally, we study the feasibility of two sample user-defined actions (i.e., Portscan detector and Botminer detector) using two different underlying mechanisms: OpenFlow and our previous work, TagFlow. Our evaluations show that user-defined actions are capable of handling traffic at line speed. Moreover, we also indicate that TagFlow user-defined actions are 33% faster than OpenFlow. We concluded that extending SDN features to include user-defined actions is lightweight and feasible.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128053933","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}
Rapid and relentless video traffic growth has brought about network congestion. To alleviate the problem, this paper considers a video content broadcast cellular network via the same frequency channels, enabling to save radio resource compared to the conventional unicast networks. We investigates its efficient resource usage for different user demand by means of stochastic geometric analysis. Consequently, we analytically verify increasing popularity of broadcast contents makes radio resource usage more efficient while decreasing the amount of waste radio resources.
{"title":"Radio resource efficient cellular broadcast networks","authors":"Jihong Park, S. Yu, Seong-Lyun Kim","doi":"10.1145/2619287.2619310","DOIUrl":"https://doi.org/10.1145/2619287.2619310","url":null,"abstract":"Rapid and relentless video traffic growth has brought about network congestion. To alleviate the problem, this paper considers a video content broadcast cellular network via the same frequency channels, enabling to save radio resource compared to the conventional unicast networks. We investigates its efficient resource usage for different user demand by means of stochastic geometric analysis. Consequently, we analytically verify increasing popularity of broadcast contents makes radio resource usage more efficient while decreasing the amount of waste radio resources.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133905738","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 paper analyzes Future Internet issues from the perspective of a generic network model. The generic network model is developed by identifying the essential objects and bindings for data communication. Based on this model, this paper identifies the problems of the current Internet and develops some requirements for Future Internet architecture design. Also this paper shows how the generic model can be used to address recent network issues.
{"title":"Future internet issues from the perspective of a generic network model","authors":"Heeyoung Jung","doi":"10.1145/2619287.2619302","DOIUrl":"https://doi.org/10.1145/2619287.2619302","url":null,"abstract":"This paper analyzes Future Internet issues from the perspective of a generic network model. The generic network model is developed by identifying the essential objects and bindings for data communication. Based on this model, this paper identifies the problems of the current Internet and develops some requirements for Future Internet architecture design. Also this paper shows how the generic model can be used to address recent network issues.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133104898","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}
Information-centric networking (ICN) is a clean-slate network architecture to achieve efficient content transmissions. In-network caching is an important issue in ICN, since the routers have a limited caching capacity. Several approaches have been proposed to reduce the cache redundancy, and increase the cache hit ratio and the user delay. Most approaches design algorithms for single routers, and there are still redundant caches in an AS. In this paper, we propose the content-hierarchical Intra-Domain Cooperative Caching (IDCC) scheme to solve the problem, based on the observation that the time of access contents within the local AS is much shorter than that of access contents outside. We use probabilistic caching based on inlet traffic speed, and avoid unnecessary replicas by intra-domain cooperation based on content advertisements. We use hierarchical caching based on content popularity to improve the performance. Our scheme is different from other intra-domain cooperation schemes which remove redundant replicas after contents have been cached. We evaluate our scheme with simulations. The results show that IDCC can improve the hit ratio by 1.7 times and 1.1 times compared to two common existing schemes, respectively.
{"title":"Content-hierarchical intra-domain cooperative caching for information-centric networks","authors":"Jia Ji, Mingwei Xu, Yuan Yang","doi":"10.1145/2619287.2619289","DOIUrl":"https://doi.org/10.1145/2619287.2619289","url":null,"abstract":"Information-centric networking (ICN) is a clean-slate network architecture to achieve efficient content transmissions. In-network caching is an important issue in ICN, since the routers have a limited caching capacity. Several approaches have been proposed to reduce the cache redundancy, and increase the cache hit ratio and the user delay. Most approaches design algorithms for single routers, and there are still redundant caches in an AS. In this paper, we propose the content-hierarchical Intra-Domain Cooperative Caching (IDCC) scheme to solve the problem, based on the observation that the time of access contents within the local AS is much shorter than that of access contents outside. We use probabilistic caching based on inlet traffic speed, and avoid unnecessary replicas by intra-domain cooperation based on content advertisements. We use hierarchical caching based on content popularity to improve the performance. Our scheme is different from other intra-domain cooperation schemes which remove redundant replicas after contents have been cached. We evaluate our scheme with simulations. The results show that IDCC can improve the hit ratio by 1.7 times and 1.1 times compared to two common existing schemes, respectively.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121047712","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, with the advent of YouTube and similar video streaming websites, online video playback has gained popularity. Further, video traffic, represents the largest portion of Internet traffic. However, online video traffic contains redundant traffic due to identical video accesses. Network virtualization has been studied and developed, which makes it possible to deploy different protocols and new functionalities over the same physical network. in-network processing, the execution of calculation processes on routers, is one of the new features enabled by network virtualization. Further, since YouTube is the largest video publishing service in the world, we analyze YouTube video playbacks at the edge network and investigate redundant traffic and its locality. Based on these recent developments and technology, we propose to reduce redundant video traffic using in-network caching by positing video caches on routers. This cache could be moved to other routers according to users' access. In this paper, we analyze redundant YouTube video accesses and perform in-network cache simulations. According to these simulations, in-network caching can be optimized to reduce not only incoming traffic to the edge network by 42.2%, but also download traffic inside the network by up to 18.9%, with the only cost being an increase of 6.6% additional upload traffic inside the network. The result also demonstrates the presence of the locality of video accesses at the edge network.
{"title":"In-network cache simulations based on a YouTube traffic analysis at the edge network","authors":"Shogo Ando, A. Nakao","doi":"10.1145/2619287.2619295","DOIUrl":"https://doi.org/10.1145/2619287.2619295","url":null,"abstract":"Recently, with the advent of YouTube and similar video streaming websites, online video playback has gained popularity. Further, video traffic, represents the largest portion of Internet traffic. However, online video traffic contains redundant traffic due to identical video accesses. Network virtualization has been studied and developed, which makes it possible to deploy different protocols and new functionalities over the same physical network. in-network processing, the execution of calculation processes on routers, is one of the new features enabled by network virtualization. Further, since YouTube is the largest video publishing service in the world, we analyze YouTube video playbacks at the edge network and investigate redundant traffic and its locality. Based on these recent developments and technology, we propose to reduce redundant video traffic using in-network caching by positing video caches on routers. This cache could be moved to other routers according to users' access. In this paper, we analyze redundant YouTube video accesses and perform in-network cache simulations. According to these simulations, in-network caching can be optimized to reduce not only incoming traffic to the edge network by 42.2%, but also download traffic inside the network by up to 18.9%, with the only cost being an increase of 6.6% additional upload traffic inside the network. The result also demonstrates the presence of the locality of video accesses at the edge network.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131017163","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}
The need to keep an attacker oblivious of an attack mitigation effort is a very important component of a defense against denial of services (DoS) and distributed denial of services (DDoS) attacks because it helps to dissuade attackers from changing their attack patterns. Conceptually, DDoS mitigation can be achieved by two components. The first is a decoy server that provides a service function or receives attack traffic as a substitute for a legitimate server. The second is a decoy network that restricts attack traffic to the peripheries of a network, or which reroutes attack traffic to decoy servers. In this paper, we propose the use of a two-stage map table extension Locator/ID Separation Protocol (LISP) to realize a decoy network. We also describe and demonstrate how LISP can be used to implement an oblivious DDoS mitigation mechanism by adding a simple extension on the LISP MapServer. Together with decoy servers, this method can terminate DDoS traffic on the ingress end of an LISP-enabled network. We verified the effectiveness of our proposed mechanism through simulated DDoS attacks on a simple network topology. Our evaluation results indicate that the mechanism could be activated within a few seconds, and that the attack traffic can be terminated without incurring overhead on the MapServer.
{"title":"Oblivious DDoS mitigation with locator/ID separation protocol","authors":"Kazuya Okada, H. Hazeyama, Y. Kadobayashi","doi":"10.1145/2619287.2619291","DOIUrl":"https://doi.org/10.1145/2619287.2619291","url":null,"abstract":"The need to keep an attacker oblivious of an attack mitigation effort is a very important component of a defense against denial of services (DoS) and distributed denial of services (DDoS) attacks because it helps to dissuade attackers from changing their attack patterns. Conceptually, DDoS mitigation can be achieved by two components. The first is a decoy server that provides a service function or receives attack traffic as a substitute for a legitimate server. The second is a decoy network that restricts attack traffic to the peripheries of a network, or which reroutes attack traffic to decoy servers. In this paper, we propose the use of a two-stage map table extension Locator/ID Separation Protocol (LISP) to realize a decoy network. We also describe and demonstrate how LISP can be used to implement an oblivious DDoS mitigation mechanism by adding a simple extension on the LISP MapServer. Together with decoy servers, this method can terminate DDoS traffic on the ingress end of an LISP-enabled network. We verified the effectiveness of our proposed mechanism through simulated DDoS attacks on a simple network topology. Our evaluation results indicate that the mechanism could be activated within a few seconds, and that the attack traffic can be terminated without incurring overhead on the MapServer.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116485390","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}
Cross-layer networking is a promising approach which provides an optimal routing solution for achieving the goal of a target application. However, existing cross-layer networking approaches mostly support only a specific application type and do not fully satisfy other application types because each application has distinguished network requirements. In this paper, we propose a paradigm that several network parameters in routing and MAC layers dynamically adapt to various applications by understanding their requirements. To achieve the paradigm, we propose a joint routing and MAC parameterization scheme which adapts to application requirements and changing network conditions.
{"title":"Cross-layer network parameterization for application-aware networking in wireless ad-hoc networks","authors":"B. Shin, Jalil Abdullayev, Dongman Lee","doi":"10.1145/2619287.2619309","DOIUrl":"https://doi.org/10.1145/2619287.2619309","url":null,"abstract":"Cross-layer networking is a promising approach which provides an optimal routing solution for achieving the goal of a target application. However, existing cross-layer networking approaches mostly support only a specific application type and do not fully satisfy other application types because each application has distinguished network requirements. In this paper, we propose a paradigm that several network parameters in routing and MAC layers dynamically adapt to various applications by understanding their requirements. To achieve the paradigm, we propose a joint routing and MAC parameterization scheme which adapts to application requirements and changing network conditions.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133753375","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}
System log from network equipment is one of the most important information for network management. Sophisticated log message mining could help in investigating a huge number of log messages for trouble shooting, especially in recent complicated network structure (e.g., virtualized networks). However, generating log templates (i.e., meta format) from real log messages (instances) is still difficult problem in terms of accuracy. In this paper we propose a Natural Language Processing (NLP) approach to generate log templates from log messages produced by network equipment in order to overcome this problem. The key idea of the work is to leverage the use of Conditional Random Fields (CRF), a well-studied supervised natural language processing technique. As preliminarily evaluation, with one month network equipment logs in a Japanese academic network, we show that our CRF based algorithm improves the accuracy of generated log templates in reasonable processing time, compared with a traditional method.
{"title":"Towards an NLP-based log template generation algorithm for system log analysis","authors":"Satoru Kobayashi, K. Fukuda, H. Esaki","doi":"10.1145/2619287.2619290","DOIUrl":"https://doi.org/10.1145/2619287.2619290","url":null,"abstract":"System log from network equipment is one of the most important information for network management. Sophisticated log message mining could help in investigating a huge number of log messages for trouble shooting, especially in recent complicated network structure (e.g., virtualized networks). However, generating log templates (i.e., meta format) from real log messages (instances) is still difficult problem in terms of accuracy. In this paper we propose a Natural Language Processing (NLP) approach to generate log templates from log messages produced by network equipment in order to overcome this problem. The key idea of the work is to leverage the use of Conditional Random Fields (CRF), a well-studied supervised natural language processing technique. As preliminarily evaluation, with one month network equipment logs in a Japanese academic network, we show that our CRF based algorithm improves the accuracy of generated log templates in reasonable processing time, compared with a traditional method.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"475 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125918403","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
扫码关注我们
求助内容：
应助结果提醒方式：