{"title":"Inter-connection automation for OF@TEIN multi-point international OpenFlow islands","authors":"Taeheum Na, JongWon Kim","doi":"10.1145/2619287.2619293","DOIUrl":"https://doi.org/10.1145/2619287.2619293","url":null,"abstract":"In realizing futuristic services with agility, testbed environments that provide converged computing/networking resources based on SDN (Software--Defined Networking) and CC (Cloud Computing) are becoming important. Following this trend, OF@TEIN OpenFlow--enabled SDN testbed environment is built with internationally-distributed unique SmartX Racks. In this paper, to automate the multi-point L2 inter-connections of OpenFlow islands, we design and implement a configuration tool for NVGRE (Network Virtualization using Generic Routing Encapsulation) tunneling. The proposed tool manages the desired topology by leveraging the OVSDB (Open vSwitch Database) configuration interface for OpenFlow switches. With the implemented tool and appropriate admin/user privilege management, we can quickly inter-connect the multi-point international OpenFlow islands while letting users to freely control (i.e., tag/steer/map) their own flows for experimentation.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"42 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":"123379464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Where are the bottlenecks in software packet processing and forwarding?: Towards high-performance network operating systems","authors":"H. Asai","doi":"10.1145/2619287.2619300","DOIUrl":"https://doi.org/10.1145/2619287.2619300","url":null,"abstract":"We analyze the performance bottlenecks in packet processing and forwarding with general-purpose computers to achieve high-throughput and low-latency, and to guarantee service quality. In this paper, we first demonstrate that the performance bottleneck in software packet processing and forwarding is a blocking operating to access to PCIe registers with memory mapped I/O that are used to operate the head and tail pointers of ring buffers of NICs through two experiments. We then summarize the strategies to achieve high-performance software packet processing and forwarding against the bottlenecks, and develop and evaluate a prototype system with routing functionality to illustrate these strategies are effective.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"18 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":"124553670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Pukkawanna, H. Hazeyama, Y. Kadobayashi, S. Yamaguchi
{"title":"Detecting anomalies in massive traffic with sketches","authors":"S. Pukkawanna, H. Hazeyama, Y. Kadobayashi, S. Yamaguchi","doi":"10.1145/2619287.2619301","DOIUrl":"https://doi.org/10.1145/2619287.2619301","url":null,"abstract":"Sketches have been considered as an efficient and scalable structure for processing massive data. In this work, we propose a sketch-based method for detecting anomalies in network traffic. The method divides an IP traffic stream into sub-streams using the sketches and detects anomalies in the sub-streams based on a time-frequency analysis of the sub-stream's entropies. The paper shows detection and false positive rates of the method that was evaluated with real-world 150 Mbps traffic collected at the United States and Japan transit link.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"13 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":"122304755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interest cash: an application-based countermeasure against interest flooding for dynamic content in named data networking","authors":"Zhaogeng Li, J. Bi","doi":"10.1145/2619287.2619298","DOIUrl":"https://doi.org/10.1145/2619287.2619298","url":null,"abstract":"As a design of information-centric network architecture, Named Data Networking (NDN) provides content-based security. The signature binding the name with the content is the key point of content-based security in NDN. However, signing a content will introduce a significant computation overhead, especially for dynamically generated content. Adversaries can take advantages of such computation overhead to deplete the resources of the content provider. In this paper, we propose Interest Cash, an application-based countermeasure against Interest Flooding for dynamic content. Interest Cash requires a content consumer to solve a puzzle before it sends an Interest. The content consumer should provide a solution to this puzzle as cash to get the signing service from the content provider. The experiment shows that an adversary has to use more than 300 times computation resources of the content provider to commit a successful attack when Interest Cash is used.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"79 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":"124988464","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}
Sen Wang, J. Bi, Jianping Wu, Xu Yang, Lingyuan Fan
{"title":"On adapting HTTP protocol to content centric networking","authors":"Sen Wang, J. Bi, Jianping Wu, Xu Yang, Lingyuan Fan","doi":"10.1145/2377310.2377312","DOIUrl":"https://doi.org/10.1145/2377310.2377312","url":null,"abstract":"Designed around host-reachability, today's Internet architecture faces many limitations while serving content-oriented applications which generate most traffic load to the Internet. CCN (Content Centric Networking) [1] is one of the most important proposals for future Internet architecture, which aims to build a content/data oriented network to solve these limitations. On the other hand, HTTP is the most important protocol to deploy new services and applications on current TCP/IP-based Internet. In this paper, we attempt to run HTTP protocol on CCN and combine the two by stitching them semantically on their content-oriented features, such as content caching. We expect that this combination can be leveraged to build CCN testbed with real HTTP traffic which is vital to validation and redesigning of specific mechanisms of CCN and to finding a transition way of CCN in which great incentive is provided for service providers in the economic ecosystem of content distribution. We designed and implemented a HTTP-CCN gateway to transform HTTP request and HTTP response into CCN Interest and Data respectively. We illustrate how to semantically map HTTP caching to CCN caching, which is one of the most attractive properties of CCN. We also discuss how to achieve transparent caching with CCN and find out that it is nontrivial to achieve complete transparency of caching with CCN given no cooperation with CDNs and content providers.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128023228","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}
E. Grasa, Eleni Trouva, Steve Bunch, P. DeWolf, J. Day
{"title":"Developing a RINA prototype over UDP/IP using TINOS","authors":"E. Grasa, Eleni Trouva, Steve Bunch, P. DeWolf, J. Day","doi":"10.1145/2377310.2377321","DOIUrl":"https://doi.org/10.1145/2377310.2377321","url":null,"abstract":"RINA is a very promising internetwork architecture based on the fundamental patterns presented in the \"Patterns in Network Architecture\" book. This paper describes the rationale, major design choices and implementation of a RINA prototype over UDP/IP. The prototype is mainly a tool for research and experimentation, the outcome of this work is not meant to be the final solution, but a vehicle to think deeply and experiment around RINA open research areas.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127402989","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}
A. Yamanaka, Y. Fukushima, T. Murase, T. Yokohira, T. Suda
{"title":"Destination selection algorithm in a server migration service","authors":"A. Yamanaka, Y. Fukushima, T. Murase, T. Yokohira, T. Suda","doi":"10.1145/2377310.2377315","DOIUrl":"https://doi.org/10.1145/2377310.2377315","url":null,"abstract":"Using network virtualization technologies for network applications (NW-Apps) consisting of server and clients, we can implement a server migration service where there are many server running environments (working places: WPs) inside a network and servers on WPs can migrate to other WPs when communication QoSs in some NW-Apps fall off. Because server size is large, the traffic for server migration causes QoS degradation of its background traffic. Thus, it is important to decrease the degree (network impact) of the QoS degradation. In this paper, we propose three destination selection algorithms, MIA (Minimum Impact Algorithm), MRA (Maximum Remaining space Algorithm) and MCA (Maximum Covering Algorithm) that try to decrease the impact while increasing the number of NW-Apps' clients whose SLA (service level agreement) are satisfied. When a server migration is triggered, MIA, MRA and MCA move the server in the WP with the minimum impact, the WP with the maximum remaining space for servers and the WP with the maximum coverage, which is the number of routers under which the corresponding clients can communicate with the server while satisfying the SLA, respectively. Numerical examples show that when the number of accommodatable servers in full-cover WP (a full-cover WP is such WP that communicates with an arbitrary client while satisfying the SLA) is small or there is no full-cover WP, MIA outperforms the others, otherwise MCA outperforms the others.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129086514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enabling DTN-based data offloading in urban mobile network environments","authors":"Younghwan Go, YoungGyoun Moon, KyoungSoo Park","doi":"10.1145/2377310.2377328","DOIUrl":"https://doi.org/10.1145/2377310.2377328","url":null,"abstract":"Recent developments in smartphones and mobile devices have brought a tremendous growth in the mobile data communication. The mobile traffic volume is predicted to consume 10.8 Exabytes per month by 2016, 18x increase from that of 2011 [1]. While the next-generation mobile technologies such as Long Term Evolution (LTE) are being aggressively deployed, they are unlikely to catch up with the explosive demands. One promising solution is to opportunistically offload the bandwidth-limited mobile data transfer to the wired Internet via Wi-Fi while using the mobile networks as a backup medium to meet the transfer deadline with delay-tolerant networking (DTN) [2]. However, deploying DTN faces numerous barriers since existing applications do not seamlessly handle network delays and disruptions caused by human mobility.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129297499","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}
Miyoung Kang, Ki-Hyuk Nam, Junkil Park, M. Shin, Jeehoon Shin, Jin-Young Choi
{"title":"Formal specifications for software-defined networking","authors":"Miyoung Kang, Ki-Hyuk Nam, Junkil Park, M. Shin, Jeehoon Shin, Jin-Young Choi","doi":"10.1145/2377310.2377331","DOIUrl":"https://doi.org/10.1145/2377310.2377331","url":null,"abstract":"It is important to understand the correct specification of SDN in order to implement and analyze the SDN in mind. However, natural languages are usually ambiguous and misleading the specification due to the nature of natural language understanding. Hence, it has been required to have formal specifications after natural language documents. We have two formal specifications for a part of SDN, and compare the formalisms, called ACSR and Z.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134175613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ASIC: an architecture for scalable intra-domain control in OpenFlow","authors":"Pingping Lin, J. Bi, Hongyu Hu","doi":"10.1145/2377310.2377317","DOIUrl":"https://doi.org/10.1145/2377310.2377317","url":null,"abstract":"Currently, the architecture of network device is closed which is detrimental to network innovation. Software defined networking decouples the vertically coupled architecture and reconstructs the Internet as a modular structure. The idea of software defined networking is widely accepted. OpenFlow, a typical instance of the software defined networking, has been deployed by many universities and research institutions all over the world. With the increasing scale of deployment, the poor scalability of the OpenFlow centralized control mode becomes more and more obvious. To solve this scalability problem, this paper adopts the idea of load balance and proposes an architecture for the scalable intra-domain control named ASIC in OpenFlow. ASIC balances all the data flow initialization requests to several physical controllers in an OpenFlow network, and then, those requests are processed with a shared global network view in a parallel manner. ASIC also builds a data cluster for the global network view. By this way, the scalability problem in the intra-domain control plane could be completely solved. At the end of this paper, the emulation shows the feasibility of ASIC.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134221723","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}