Information Centric Networks (ICNs) is a new architecture for the Future Internet to deliver content at large-scale. It relies on named data and caching features, which consists of storing content across the delivery path to serve forthcoming requests. In this paper, we study the problem of finding the optimal assignment of the objects in the available caches in ICN. The optimization problem is to cache objects in order to minimize overall network overhead. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. Metaheuristic methods are considered as effective methods for solving this problem, Genetic Algorithm (GA) is one of those algorithms that can solve this problem efficiently. We will adapt cache management system based on GA for solving the considered problem. In contrast to traditional locally caching systems this algorithm consider both global and local search and make caching decisions about where and which item will be cached in order to minimize overall network overhead.
{"title":"Distributed GA for popularity based partial cache management in ICN","authors":"A. Mohammed, K. Okamura","doi":"10.1145/2619287.2619305","DOIUrl":"https://doi.org/10.1145/2619287.2619305","url":null,"abstract":"Information Centric Networks (ICNs) is a new architecture for the Future Internet to deliver content at large-scale. It relies on named data and caching features, which consists of storing content across the delivery path to serve forthcoming requests. In this paper, we study the problem of finding the optimal assignment of the objects in the available caches in ICN. The optimization problem is to cache objects in order to minimize overall network overhead. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. Metaheuristic methods are considered as effective methods for solving this problem, Genetic Algorithm (GA) is one of those algorithms that can solve this problem efficiently. We will adapt cache management system based on GA for solving the considered problem. In contrast to traditional locally caching systems this algorithm consider both global and local search and make caching decisions about where and which item will be cached in order to minimize overall network overhead.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"50 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":"127368359","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}
It has been a recent trend of Internet service providers (ISPs) to deploy content delivery networks (CDNs) extensively in their infrastructure in order to utilize their network resources and generate a new profit source. This 'telco CDN' has become an attractive solution since it enables the ISP to use their own network topology and real-time traffic information to address the bottlenecks, and seek for near-optimal path to convey the content to the users. However, since the location of telco CDN cache is limited to their ISP region, it became difficult to bring its performance benefit to the users outside the ISP region and it also led to suboptimal traffic reduction at ISP borders. CDN interconnection (CDNi) is an emerging technology which has a potential to eliminate the redundant HTTP traffic received from external CDNs. A telco CDN can minimize the CDN traffic crossing the ISP border and at the same time deliver the content to their users quickly from its local cache by temporarily caching the content owned by a collaborating peer CDN. In this paper, we have studied the performance of CDNi when applied to the fast-growing cellular Internet traffic. We have simulated the CDNi protocol to gauge the bandwidth savings along with request redirection overheads using 7.7 billion HTTP logs (290 TBs by the byte volume) from one of the largest cellular ISPs in South Korea. We observed that 69% of total downlink traffic passes the Internet Exchange point (IXP), and according to our simulation results, intra-ISP CDN with CDNi can remove 16.2% to 29% of the IXP traffic. We also saw that the CDNi request redirection overhead could be significant to small objects, but it is still expected that if only large HTTP objects are redirected, a large bandwidth would be saved.
{"title":"Analyzing the effectiveness of content delivery network interconnection of 3G cellular traffic","authors":"Giyoung Nam, KyoungSoo Park","doi":"10.1145/2619287.2619297","DOIUrl":"https://doi.org/10.1145/2619287.2619297","url":null,"abstract":"It has been a recent trend of Internet service providers (ISPs) to deploy content delivery networks (CDNs) extensively in their infrastructure in order to utilize their network resources and generate a new profit source. This 'telco CDN' has become an attractive solution since it enables the ISP to use their own network topology and real-time traffic information to address the bottlenecks, and seek for near-optimal path to convey the content to the users. However, since the location of telco CDN cache is limited to their ISP region, it became difficult to bring its performance benefit to the users outside the ISP region and it also led to suboptimal traffic reduction at ISP borders.\u0000 CDN interconnection (CDNi) is an emerging technology which has a potential to eliminate the redundant HTTP traffic received from external CDNs. A telco CDN can minimize the CDN traffic crossing the ISP border and at the same time deliver the content to their users quickly from its local cache by temporarily caching the content owned by a collaborating peer CDN. In this paper, we have studied the performance of CDNi when applied to the fast-growing cellular Internet traffic. We have simulated the CDNi protocol to gauge the bandwidth savings along with request redirection overheads using 7.7 billion HTTP logs (290 TBs by the byte volume) from one of the largest cellular ISPs in South Korea. We observed that 69% of total downlink traffic passes the Internet Exchange point (IXP), and according to our simulation results, intra-ISP CDN with CDNi can remove 16.2% to 29% of the IXP traffic. We also saw that the CDNi request redirection overhead could be significant to small objects, but it is still expected that if only large HTTP objects are redirected, a large bandwidth would be saved.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"86 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":"123056017","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}
T. Choi, Saehoon Kang, Sangsik Yoon, Sunhee Yang, Sejun Song, Hyungbae Park
Traffic and resource monitoring is the essential function for large-scale enterprises, service providers, and network operators to ensure reliability, availability, and security of their resources. For this reason, many large-scale enterprises and providers have been investing in various standalone dedicated monitoring solutions. However, they find the cost of a dedicated standalone appliance per-feature prohibitive, inflexible, slow to install and difficult to maintain. Network Function Virtualization (NFV)-based virtualization trends represent an attractive opportunity for such stakeholders trying to meet the above requirements while controlling OPEX and CAPEX. Although there are many advantages that virtualization of monitoring function brings, some challenges remained to be solved are ensuring scalability and performance of single or distributed multiple virtual monitoring functions and flexibility and easiness of virtual functions lifecycle management. In this paper, to address such problems, we propose a novel architecture of software-defined unified virtual monitoring function for SDN-based large-scale networks (SuVMF). SuVMF is an essential component to build a scalable, reliable, secure and high-performance SDN architecture by providing intelligent control and monitoring management abstraction and filtering layer. In this paper, we present design, implementation, and evaluation results of SuVMF.
{"title":"SuVMF: software-defined unified virtual monitoring function for SDN-based large-scale networks","authors":"T. Choi, Saehoon Kang, Sangsik Yoon, Sunhee Yang, Sejun Song, Hyungbae Park","doi":"10.1145/2619287.2619299","DOIUrl":"https://doi.org/10.1145/2619287.2619299","url":null,"abstract":"Traffic and resource monitoring is the essential function for large-scale enterprises, service providers, and network operators to ensure reliability, availability, and security of their resources. For this reason, many large-scale enterprises and providers have been investing in various standalone dedicated monitoring solutions. However, they find the cost of a dedicated standalone appliance per-feature prohibitive, inflexible, slow to install and difficult to maintain. Network Function Virtualization (NFV)-based virtualization trends represent an attractive opportunity for such stakeholders trying to meet the above requirements while controlling OPEX and CAPEX. Although there are many advantages that virtualization of monitoring function brings, some challenges remained to be solved are ensuring scalability and performance of single or distributed multiple virtual monitoring functions and flexibility and easiness of virtual functions lifecycle management. In this paper, to address such problems, we propose a novel architecture of software-defined unified virtual monitoring function for SDN-based large-scale networks (SuVMF). SuVMF is an essential component to build a scalable, reliable, secure and high-performance SDN architecture by providing intelligent control and monitoring management abstraction and filtering layer. In this paper, we present design, implementation, and evaluation results of SuVMF.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"232 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":"115838746","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}
Takeshi Matsuya, Yohei Kuga, Hideaki Yoshifuji, R. V. Meter, J. Murai
With cloud service becoming more popular, low-latency communication is required between servers in a data center. Low-latency node-to-node or application-to-application notification can be achieved in a NUMA [1] (Non-Uniform Memory Access) system, but requires dedicated, special-purpose network infrastructure. However, IP networks are commonly used in data centers. Using a custom FPGA-based NIC, we create NUMA-like behavior using hardware-generated IP packets which can be transmitted over commodity Ethernet switches and IP routers. We demonstrate ping-pong acknowledgments between two PCs equipped with our IP-NUMA boards. Our IP-NUMA implementation exhibits latency as much as ten times lower than software using Berkeley sockets over a consumer-grade Ethernet switch. iSCSI initiator-target communications and transaction-based distributed software systems will benefit from the reduced latency.
{"title":"IP-NUMA for low-latency communication","authors":"Takeshi Matsuya, Yohei Kuga, Hideaki Yoshifuji, R. V. Meter, J. Murai","doi":"10.1145/2619287.2619294","DOIUrl":"https://doi.org/10.1145/2619287.2619294","url":null,"abstract":"With cloud service becoming more popular, low-latency communication is required between servers in a data center. Low-latency node-to-node or application-to-application notification can be achieved in a NUMA [1] (Non-Uniform Memory Access) system, but requires dedicated, special-purpose network infrastructure. However, IP networks are commonly used in data centers. Using a custom FPGA-based NIC, we create NUMA-like behavior using hardware-generated IP packets which can be transmitted over commodity Ethernet switches and IP routers. We demonstrate ping-pong acknowledgments between two PCs equipped with our IP-NUMA boards. Our IP-NUMA implementation exhibits latency as much as ten times lower than software using Berkeley sockets over a consumer-grade Ethernet switch. iSCSI initiator-target communications and transaction-based distributed software systems will benefit from the reduced latency.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"4 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":"127784678","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}
Path protection and restoration mechanism must be implemented to provide a reliable network. Whenever there is a link failure in the network, OpenFlow controller can react by computing a new backup path and provide the information to the affected node or the node can switch to backup path locally using the predefined backup path table provided by the OpenFlow controller. Setting predefined backup paths, results in a faster switching time compared to backup path that establish on demand. However, it may lead to the use of non-optimal backup path. In this paper, we present a fast and efficient failover mechanism for redirecting traffic flows to optimal path when there is a link failure or congestion problem. Our method uses the switch flow entry expiry feature to reroute traffic to backup path and additional help of buffer in OpenFlow switches to reduce switching delay and packet loss.
{"title":"Fast failover mechanism for software defined networking: OpenFlow based","authors":"N. Sahri, K. Okamura","doi":"10.1145/2619287.2619303","DOIUrl":"https://doi.org/10.1145/2619287.2619303","url":null,"abstract":"Path protection and restoration mechanism must be implemented to provide a reliable network. Whenever there is a link failure in the network, OpenFlow controller can react by computing a new backup path and provide the information to the affected node or the node can switch to backup path locally using the predefined backup path table provided by the OpenFlow controller. Setting predefined backup paths, results in a faster switching time compared to backup path that establish on demand. However, it may lead to the use of non-optimal backup path. In this paper, we present a fast and efficient failover mechanism for redirecting traffic flows to optimal path when there is a link failure or congestion problem. Our method uses the switch flow entry expiry feature to reroute traffic to backup path and additional help of buffer in OpenFlow switches to reduce switching delay and packet loss.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"137 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":"131591043","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 mainly studies dynamic load balancing in virtualization environment based on OpenFlow, where the Controller collected the server running status through virtual machine management techniques and calculated the aggregated load of the servers according to dynamic feedback aggregated load balancing scheduling algorithm; the OpenFlow switch will forward a client's request to the server whose aggregated load is the smallest, thus minimizing the transaction response time and maximize the throughput of the server. This method can implement flexible, powerful, easy to use, cost-effective higher load balancing products, and can be more reasonable use of resources to realize more effective load balancing.
{"title":"Design and implementation of server cluster dynamic load balancing in virtualization environment based on OpenFlow","authors":"Wenbo Chen, Hui Li, Q. Ma, Zhihao Shang","doi":"10.1145/2619287.2619288","DOIUrl":"https://doi.org/10.1145/2619287.2619288","url":null,"abstract":"This paper mainly studies dynamic load balancing in virtualization environment based on OpenFlow, where the Controller collected the server running status through virtual machine management techniques and calculated the aggregated load of the servers according to dynamic feedback aggregated load balancing scheduling algorithm; the OpenFlow switch will forward a client's request to the server whose aggregated load is the smallest, thus minimizing the transaction response time and maximize the throughput of the server. This method can implement flexible, powerful, easy to use, cost-effective higher load balancing products, and can be more reasonable use of resources to realize more effective load balancing.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"115 3 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":"127406361","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}
Takuji Iimura, Daisuke Miyamoto, Hajime Tazaki, Y. Kadobayashi
In this paper, we design and implement a novel system for connecting cyber threat information. The objective is to improve the information and its analysis results with machine intelligence assisted by human intelligence. This paper illustrates the system named NECOMAtter based on these assumptions, and summarizes our contributions in order to develop actionable knowledge.
{"title":"NECOMAtter: curating approach for sharing cyber threat information","authors":"Takuji Iimura, Daisuke Miyamoto, Hajime Tazaki, Y. Kadobayashi","doi":"10.1145/2619287.2619306","DOIUrl":"https://doi.org/10.1145/2619287.2619306","url":null,"abstract":"In this paper, we design and implement a novel system for connecting cyber threat information. The objective is to improve the information and its analysis results with machine intelligence assisted by human intelligence. This paper illustrates the system named NECOMAtter based on these assumptions, and summarizes our contributions in order to develop actionable knowledge.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"23 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":"122204640","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 describes an implementation and performance evaluation of an OpenFlow-based laptop mirroring switch. We confirm that we can build a mirroring switch which can forward traffic faster than 200 Mbps with only an inexpensive laptop PC and USB 3.0 gigabit Ethernet adapters. If we use a Raspberry Pi as substitute for a laptop PC, we can build a 30 Mbps or faster switch.
{"title":"Performance evaluation of an OpenFlow-based mirroring switch on a laptop/raspberry Pi","authors":"K. Ohira","doi":"10.1145/2619287.2619307","DOIUrl":"https://doi.org/10.1145/2619287.2619307","url":null,"abstract":"This paper describes an implementation and performance evaluation of an OpenFlow-based laptop mirroring switch. We confirm that we can build a mirroring switch which can forward traffic faster than 200 Mbps with only an inexpensive laptop PC and USB 3.0 gigabit Ethernet adapters. If we use a Raspberry Pi as substitute for a laptop PC, we can build a 30 Mbps or faster switch.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"25 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":"126685268","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}
Bing-Qing Han, Xiaofei Wang, Xin Chen, T. Kwon, Yanghee Choi, Ong Mau Dung, Min Chen
In the Content-Centric Networking (CCN) architecture, popular content can be cached in some intermediate network devices while being delivered, and the following requests for the cached content can be efficiently handled by the caches. Thus, how to design in-network caching is important for reducing both the traffic load and the delivery delay. In this paper, we propose a caching framework of Prefix-based Popularity Prediction (PPP) for efficient caching in CCN. PPP assigns a lifetime (in a cache) to the prefix of a name (of each cached object) based on its access history (or popularity), which is represented as a Prefix-Tree (PT). We demonstrate PPP's predictability of content popularity in CCN by both traces and simulations. The evaluation results show that PPP can achieve higher cache hits and less traffic load than traditional caching algorithms (i.e., LRU and LFU). Also, its performance gain increases with users of high mobility.
{"title":"PPP: prefix-based popularity prediction for effective caching in content-centric networking","authors":"Bing-Qing Han, Xiaofei Wang, Xin Chen, T. Kwon, Yanghee Choi, Ong Mau Dung, Min Chen","doi":"10.1145/2619287.2619296","DOIUrl":"https://doi.org/10.1145/2619287.2619296","url":null,"abstract":"In the Content-Centric Networking (CCN) architecture, popular content can be cached in some intermediate network devices while being delivered, and the following requests for the cached content can be efficiently handled by the caches. Thus, how to design in-network caching is important for reducing both the traffic load and the delivery delay. In this paper, we propose a caching framework of Prefix-based Popularity Prediction (PPP) for efficient caching in CCN. PPP assigns a lifetime (in a cache) to the prefix of a name (of each cached object) based on its access history (or popularity), which is represented as a Prefix-Tree (PT). We demonstrate PPP's predictability of content popularity in CCN by both traces and simulations. The evaluation results show that PPP can achieve higher cache hits and less traffic load than traditional caching algorithms (i.e., LRU and LFU). Also, its performance gain increases with users of high mobility.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"25 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":"128828262","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 research on transiting the existing networks to SDN (Software defined networking) just starts. We propose to continue using the BGP (Border Gateway Protocol) and the legacy BGP border routers for the SDN network and connect the SDN network with legacy IP networks in this paper. The experiments we carried out preliminary proved our design.
{"title":"Internetworking with SDN using existing BGP","authors":"Pingping Lin, J. Bi, Hongyu Hu","doi":"10.1145/2619287.2619308","DOIUrl":"https://doi.org/10.1145/2619287.2619308","url":null,"abstract":"The research on transiting the existing networks to SDN (Software defined networking) just starts. We propose to continue using the BGP (Border Gateway Protocol) and the legacy BGP border routers for the SDN network and connect the SDN network with legacy IP networks in this paper. The experiments we carried out preliminary proved our design.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"16 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":"124023746","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
扫码关注我们
求助内容：
应助结果提醒方式：