{"title":"Constructing Multiple Steiner Trees for Software-Defined Networking Multicast","authors":"Jehn-Ruey Jiang, Szu-Yuan Chen","doi":"10.1145/2935663.2935665","DOIUrl":"https://doi.org/10.1145/2935663.2935665","url":null,"abstract":"A heuristic algorithm is proposed in this paper to construct a set of Steiner trees for multicast with multiple sources under the software-defined networking (SDN) architecture, where each source is associated with a group of receivers. It is based on the extended Dijkstra's shortest path algorithm and the modified selective closest terminal first Steiner tree algorithm. The former algorithm considers not only the edge weights but also the node weights to form data routing path with the shortest delay. The latter algorithm regards nodes with shorter paths to the source to have higher priority in the priority queue for growing Steiner trees. In this way, the number of Steiner tree edges is reduced and thus the bandwidth consumption is cut down. The proposed algorithm is simulated by the EstiNet emulator along with a Ryu controller for different multicast scenarios. The simulation results are compared with those of related algorithms in terms of the source-to-receiver delay and the bandwidth consumption to show the advantage of the proposed algorithm.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"35 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":"132029534","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":"Performance Evaluation of TCP Congestion Control Algorithms in Data Center Networks","authors":"T. A. Nguyen, Siddharth Gangadhar, J. Sterbenz","doi":"10.1145/2935663.2935669","DOIUrl":"https://doi.org/10.1145/2935663.2935669","url":null,"abstract":"TCP congestion control has been known for its crucial role in stabilizing the Internet and preventing congestion collapses. However, with the rapid advancement in networking technologies, resulting in the emergence of challenging network environments such as data center networks (DCNs), the traditional TCP algorithm leads to several impairments. The shortcomings of TCP when deployed in DCNs have motivated the development of multiple new variants, including DCTCP, ICTCP, IA-TCP, and D2TCP, but all of these algorithms exhibit their advantages at the cost of a number of drawbacks in the Global Internet. Motivated by the belief that new innovations need to be established on top of a solid foundation with a thorough understanding of the existing, well-established algorithms, we have been working towards a comprehensive analysis of various conventional TCP algorithms in DCNs and other modern networks. This paper presents our first milestone towards the completion of our comparative study in which we present the results obtained by simulating multiple TCP variants: NewReno, Vegas, HighSpeed, Scalable, Westwood+, BIC, CUBIC, and YeAH using a fat tree architecture. Each protocol is evaluated in terms of queue length, number of dropped packets, average packet delay, and aggregate bandwidth as a percentage of the channel bandwidth.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"17 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":"125397236","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":"Verification of a Multi-Domain Authentication and Authorization Infrastructure Yamata-no-Orochi","authors":"Keiji Mikami, Daisuke Ando, K. Kaneko, F. Teraoka","doi":"10.1145/2935663.2935673","DOIUrl":"https://doi.org/10.1145/2935663.2935673","url":null,"abstract":"Yamata-no-Orochi is an authentication and authorization infrastructure across multiple service domains and provides Internet services with unified authentication and authorization mechanisms. In this paper, Yamata-no-Orochi is incorporated into a video distribution system to verify its general versatility as a multi-domain authentication and authorization infrastructure for Internet services. This paper also reduces the authorization time of Yamata-no-Orochi to fulfill the processing time constrains of the video distribution system. The evaluation results show that all the authentication and authorization processes work correctly and the performance of Yamata-no-Orochi is practical for the video distribution system.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"52 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":"127148373","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":"Quantifying the Flattening of Internet Topology","authors":"Yangyang Wang, Keyao Zhang","doi":"10.1145/2935663.2935682","DOIUrl":"https://doi.org/10.1145/2935663.2935682","url":null,"abstract":"As the Internet grows, the Internet service providers (ISPs) and content providers tend to be more densely connected to the Internet to improve performance and redundancy, which leads to a flattening of the Internet topology at the autonomous system (AS) level. In this letter, we propose a method that quantifies the flattening feature in topological trend through exploiting network connectivity. Using this method, we analyze and compare the Internet AS graphs and synthetic topology models. The results reveal significant difference in flattening feature among these models and measured Internet AS graphs. This may help evaluate and improve the effectiveness of Internet topology simulation.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"1 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":"115916467","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":"Detecting Network Topology and Packet Trajectory with SDN-enabled FPGA Platform","authors":"Mian Dai, Guang Cheng, Yuxiang Wang","doi":"10.1145/2935663.2935670","DOIUrl":"https://doi.org/10.1145/2935663.2935670","url":null,"abstract":"Software-defined networking brings extra complexity to debugging while enhancing network manageability. The competition between applications and subtle bugs in controllers or switches may cause inconformity between control plane logic and data plane behavior. Tracing packet trajectory through the network is a direct way to verify whether data plane processes packets correctly according to control plane policy. We introduce NetMagic, a SDN-enabled switch based on FPGA which can be managed remotely using a custom protocol, and present the detection of network topology and packet trajectory in the network consists of NetMagics. We use probe packet to reproduce the trajectory of arbitrary production packet only by adding three rules per NetMagic to record path history in on-board RAM. The core idea is that we install a hash function both in the controller and NetMagic to process the header of probe packets which considerably reduce the usage of RAM space and facilitate the collection of trajectory data. The evaluation shows that our implementation works properly under high concurrency of tracing tasks by adjusting the parameter of hash function.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"81 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":"129996012","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":"Spray and Hop Distance Routing Protocol in Multiple-island DTN Scenarios","authors":"Agussalim, M. Tsuru","doi":"10.1145/2935663.2935668","DOIUrl":"https://doi.org/10.1145/2935663.2935668","url":null,"abstract":"Especially in rural areas, a high-speed but high-cost data communication infrastructure is not always available. In such conditions, a store-carry-and-forward-based message relaying over existing vehicle networks is a promising approach to delivery of large data as delay and disruption tolerant networking (DTN). In this paper, reflecting a real example situation in Indonesia, we consider DTN message delivery scenarios over multiple islands where adjacent islands are connected only by ferry boat. The source and destination nodes of messages are stationary and located marginal islands. Messages are relayed by cars and buses in each island and by ferries between islands. We adapt our previously proposed routing protocol to the multiple-island scenarios with some modification and evaluate its effectiveness in two cases of delivery direction. In this newly proposed version, namely adaptive-spray and hop-distance protocol (A-SnHD), the binary-spray forwarding is repeatedly used when a message reaches each island, and the hop distance-based forwarding is strictly used to prevent unnecessary transmission to wrong islands. Simulation results show that A-SnHD outperforms Epidemic and PRoPHETV2 regarding the total size of delivered messages and the overhead ratio.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"26 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":"126572295","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":"Optimized Root Selection Algorithm for Many-to-Many Communications in ICN","authors":"Ruidong Li, H. Asaeda, K. Moessner","doi":"10.1145/2935663.2935671","DOIUrl":"https://doi.org/10.1145/2935663.2935671","url":null,"abstract":"Information-centric networking (ICN) is a promising framework providing data through their names. It is expected that ICN will provide many-to-many communications enabling the efficient content sharing. To provide such many-to-many communications, communication tree structures for different groups need to be constructed on the fly. Consequently, we focus on the tree root deployment and selection for the communication structure establishment: namely, what is the impact of the number of root devices and how to select roots for different groups. We propose an optimized root selection algorithm with low computation power consumption. Through simulations, we show that the number of deployed root devices influences the traffic distribution across the network links greatly. Then we use the proposed algorithm for the root selection for different groups. It is observed that the proposed algorithm can reduce the total traffic overhead compared to the random root selection algorithm.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"22 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":"127357001","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":"RBAS: A Real-Time User Behavior Analysis System for Internet TV in Cloud Computing","authors":"C. Zhu, Guang Cheng, Xiaojun Guo, Yuxiang Wang","doi":"10.1145/2935663.2935664","DOIUrl":"https://doi.org/10.1145/2935663.2935664","url":null,"abstract":"The characteristic of Internet TV user behavior is quite essential for designers to optimize resource schedule and improve user experience. With the rapid development of Internet, both Internet TV users and STB (set top boxes) models are booming. This brings a large amount of behavior data which requires matching computing and storage resource to process. Therefore, scalable Internet TV user behavior analysis becomes more difficult. As a solution, cloud computing framework such as Hive is emerged. But limited by performance, it's not an appropriate choice for interactive analysis or real-time data exploration. In this paper, we present a real-time Internet TV user behavior analysis system with advantages of high concurrency, low latency and good transportability. Firstly, we design an event capture scheme, consisted of agents embedded in STBs and capture server clusters, to capture every manipulation performed by users. Secondly, we develop a SQL-on-Hadoop engine with distributed transactional management to decrease the response time. The engine has excellent query performance and ability to interactively query various data sources in different Hadoop formats. Lastly, we evaluate RBAS in a commercial Internet TV platform of 16 million registered users. The results show that, with a 32-node cluster, the system can effectively process 10.2 TB of behavior data every day, which is about 40x faster than original Hive-based system.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"26 12 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":"127425699","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":"Energy-Efficient Localization and Tracking on Smartphones: Design Principle and Solutions","authors":"Yufeng Wang, Yuanting Bu, Qun Jin, A. Vasilakos","doi":"10.1145/2935663.2935675","DOIUrl":"https://doi.org/10.1145/2935663.2935675","url":null,"abstract":"In recent years, various location based services (LBS) have witnessed great development and are being prevalently used in our life. However, as the foundation of various LBS applications, localization consumes large energy of resource-constraint mobile terminals, especially on smartphones. This paper explicitly proposes three technical principles, substitution, adaption and collaboration to guide energy-efficient localization and tracking schemes on smartphones. Then several typical schemes in indoor or outdoor environments are respectively summarized and compared under the umbrella of those three principles. Moreover, the context-assisting techniques are also discussed to design energy-efficient LBS applications. Finally, the quantitative metrics to measure the tradeoff between energy and localization performance are summarized. The primary goal of this paper is to comprehensively classify and provide a summary on the sporadic localization schemes (with energy-efficiency as main concern), possible solutions and tradeoffs, and facilitate to develop and deploy the energy-efficient LBS applications.","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"37 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":"126690810","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":"Proceedings of the 11th International Conference on Future Internet Technologies","authors":"","doi":"10.1145/2935663","DOIUrl":"https://doi.org/10.1145/2935663","url":null,"abstract":"","PeriodicalId":305382,"journal":{"name":"Proceedings of the 11th International Conference on Future Internet Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121191620","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}