{"title":"Enhancing buffer dimensioning for Multipath TCP","authors":"Matthieu Coudron, H. D. Nguyen, Stefano Secci","doi":"10.1109/NOF.2016.7810142","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810142","url":null,"abstract":"Multipath transport communication solutions gain traction in the communication networks industry. In particular, Multipath Transport Control Protocol (MPTCP) emerges as a viable transport protocol, as it is conceived as a TCP extension, incrementally deployable in the legacy Internet. MPTCP might improve throughput provided that the TCP buffers are big enough, otherwise the opposite may happen. When facing a situation with many paths available, it might be efficient for MPTCP not to use all of them to prevent throughput degradation because of head-of-line blocking. How many paths should be used remains an open question. Depending on the use case, it may be important to keep a path alive for confidentiality reasons or because of the financial cost associated with transmitting over the other paths. We document the MPTCP-NUMERICS tool we developed to manage MPTCP buffers. MPTCP-NUMERICS tries to take into account the MPTCP flow control constraints as well as policy-based constraints in order to answer such questions.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120978774","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}
Syphax Iskounen, T. Nguyen, Sébastien Monnet, Lyes Hamidouche
{"title":"Device-to-Device communications using Wi-Fi direct for dense wireless networks","authors":"Syphax Iskounen, T. Nguyen, Sébastien Monnet, Lyes Hamidouche","doi":"10.1109/NOF.2016.7810126","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810126","url":null,"abstract":"Device-to-device (D2D) communications have been widely studied for traffic offloading in cellular networks. In this paper, we demonstrate that D2D communications can also be used to offload the Wi-Fi access point in a dense wireless network. Wi-Fi Direct, a popular wireless technology available in tablets and smartphones, is used to realize D2D communications. Clustering, power control and transmission scheduling techniques are applied to optimize the network performances. The simulation results show that a significant performance gain can be obtained with a download time reduction up to 30%.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127198062","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}
Arunabha Sen, Arun Das, Chenyang Zhou, Anisha Mazumder, N. Mitton, Abdoul Aziz Mbacké
{"title":"Reader scheduling for tag access in RFID systems","authors":"Arunabha Sen, Arun Das, Chenyang Zhou, Anisha Mazumder, N. Mitton, Abdoul Aziz Mbacké","doi":"10.1109/NOF.2016.7810112","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810112","url":null,"abstract":"“Reader” and “Tag” type devices are utilized in the Radio-Frequency IDentification technology for identification and tracking of objects. A tag can be “read” by a reader when the tag is within the reader's sensing range. However, when tags are present in the intersection area of the sensing ranges of two or more readers, simultaneous activation of the readers may cause “reader collision”. In order to ensure collision-free reading, a scheduling scheme is needed to read tags in the shortest possible time. We study this scheduling problem in a stationary setting and the reader minimization problem in a mobile setting. We show that the optimal schedule construction problem is NP-complete and provide an approximation algorithm and techniques that we evaluate through simulation.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114822748","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}
J. V. Torres, I. D. Alvarenga, A. Pedroza, O. Duarte
{"title":"Proposing, specifying, and validating a controller-based routing protocol for a clean-slate Named-Data Networking","authors":"J. V. Torres, I. D. Alvarenga, A. Pedroza, O. Duarte","doi":"10.1109/NOF.2016.7810122","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810122","url":null,"abstract":"Named-Data Networking (NDN) is the most prominent proposal for a clean-slate proposal of Future Internet. Nevertheless, NDN routing schemes present scalability concerns due to the required number of stored routes and of control messages. In this work, we present a controller-based routing protocol using a formal method to unambiguously specify, and validate to prove its correctness. Our proposal codes signaling information on content names, avoiding control message overhead, and reduces router memory requirements, storing only the routes for simultaneously consumed prefixes. Additionally, the protocol installs a new route on all routers in a path with a single route request to the controller, avoiding replication of routing information and automating router provisioning. As a result, we provide a protocol proposal description using the Specification and Description Language and we validate the protocol, proving that CRoS behavior is free of dead or live locks. Furthermore, the protocol validation guarantees that the scheme ensures a valid working path from consumer to producer, even if it does not assure the shortest path.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114933476","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":"Multicast BGP with SDN control plane","authors":"F. Godan, S. Colman, E. Grampín","doi":"10.1109/NOF.2016.7810140","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810140","url":null,"abstract":"Intra-domain Border Gateway Protocol (BGP) scalability has been tackled by introducing Route Reflectors, which have been universally adopted, but creating a new set of challanges: lack of route diversity, potential correctness failures both at the control and data plane (i.e. routing loops), and iBGP messaging duplication. The problem is exacerbated by popular enterprise services such as L2 and L3 Virtual Private Networks, for which Multiprotocol BGP is a major building block. The stress imposed on backbone routers by the diversity and scale of services is one of the reasons for the emergence of the Software Defined Networking (SDN) paradigm, seeking to liberate routing hardware from the burden of service implementation, transferring the complexity to controller software. In this article we examine a new approach for iBGP information dissemination, which i) is equivalent to full-mesh, maintaining correctness and route diversity, and ii) also scales in terms of session management. The former objective is accomplished by substitution of route reflection by per-ASBR (Autonomous System Border Router) BGP message multicasting, while the latter is assured by delegation of multicast tree maintenance complexity to SDN.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126810854","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":"Proposing and evaluating the performance of a firewall implemented as a virtualized network function","authors":"L. Mauricio, M. Rubinstein, O. Duarte","doi":"10.1109/NOF.2016.7810127","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810127","url":null,"abstract":"The virtualization technology provides many advantages to datacenters such as: reduction of power, cooling, and hardware costs. Moreover, virtualization simplifies administration and maintenance. On the other hand, for assuring security policies, a virtualized datacenter may require a large Access Control List (ACL) that can overload current commercial Top of Rack (ToR) equipment. This paper proposes and evaluates the performance of a firewall implemented as a virtualized network function in the Open source Platform for Network Functions Virtualization (OPNFV) using commercial off-the-shelf servers. Results show that the function provides elastic capacity that can scale up, meeting the current ingress traffic demands.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128669307","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":"Reducing network cost of minimal-migration based VM management in cloud datacenters","authors":"Kuan-Wei Li, Po-Han Huang, Charles H.-P. Wen","doi":"10.1109/NOF.2016.7810130","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810130","url":null,"abstract":"Nowadays, Cloud Service Providers (CSPs) provide flexible architectures and reliable internet accessories in cloud datacenters, where different types of applications are hosted. In order to achieve higher resource utilization and better quality of service, virtualization is widely used and implemented with virtual machines (VMs). However, most studies focus on VM management for utilization and energy, not yet considering the cost for emerging internet applications. Therefore, to further reduce network cost, we propose utilization-and-network-driven (UND) and only-network-driven (OND) strategies on top of the common minimal-migration (MM) based VM management as UND-MM and OND-MM. According to simulation results, both UND-MM and OND-MM strategies effectively reduce network cost by averagely 7% and 37%, respectively, of the original MM while retaining comparable resource utilization in CPU and memory for normally-loaded and overloaded datacenters. Moreover, the OND-MM, which is simpler, outperforms the UND-MM, and thus becomes more preferable for VM management in cloud datacenters.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134504753","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}
Igor G. Ribeiro, Antonio A. Rocha, C. Albuquerque, Flavio Guimaraes
{"title":"Content pollution mitigation for Content-Centric Networking","authors":"Igor G. Ribeiro, Antonio A. Rocha, C. Albuquerque, Flavio Guimaraes","doi":"10.1109/NOF.2016.7810123","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810123","url":null,"abstract":"Content-Centric Networking - CCN is a prominent architectural proposal for the future Internet. Even though CCN design includes a set of security mechanisms in order to to ensure authenticity, integrity and confidentiality of contents, some security threats still exists. One of these threats is content pollution, where malicious users cause legitimate users to retrieve incorrect contents, what, in the worst scenario, can lead to a denial of service attack. To mitigate this problem it was proposed CCNCheck, a mechanism that makes all routers in the network to check the signature of contents according to the same probability, which makes the mechanism's efficiency very topology-dependent. In this paper we propose two different deployment approaches to CCNCheck. The first one splits the network routers into two groups: border router and core routers. These two groups were associated with two different verification probabilities. In the second approach, we let the verification probability in the border routers to vary dynamically, according to the pollution level perceived by the router. We have shown through simulation experiments that these approaches reduce topology dependency, allow users to retrieve the majority of requested contents and reduces the number of polluted messages forwarded in the network core.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115092336","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":"New optimization and security approaches to enhance the Smart Grid performance and reliability","authors":"Mohammed Attia, S. Senouci, E. Aglzim","doi":"10.1109/NOF.2016.7810137","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810137","url":null,"abstract":"Nowadays, the Smart Grid (SG) is becoming smarter thanks to the integration of different information and communication technologies to enhance the reliability and efficiency of the power grid. However, several issues should be met to ensure high SG performance. Among these issues, we cite the problem of electric vehicles (EVs) integration into the SG to avoid electricity intermittence due to the important load that EVs can create. Another issue is the SG communication network security that can be attempted by malicious intruders in order to create damages and make the power grid instable. In this context, we propose at a first level a Bayesian game-theory model that aims to integrate optimally EVs into the SG and maintain the equilibrium between the offer and the demand. At a second level, we propose an Intrusion Detection System (IDS) to protect the SG from attacks that aim to disturb the state estimation. Numerical results prove the efficiency and robustness of our proposed models.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130719016","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}
Marcos Talau, M. Fonseca, Anelise Munaretto, E. Wille
{"title":"Early congestion control: A new approach to improve the performance of TCP in ad hoc networks","authors":"Marcos Talau, M. Fonseca, Anelise Munaretto, E. Wille","doi":"10.1109/NOF.2016.7810143","DOIUrl":"https://doi.org/10.1109/NOF.2016.7810143","url":null,"abstract":"Several types of research have been conducted in an attempt to improve the performance of TCP in ad hoc wireless networks. Many of these studies perform TCP side changes, which can be difficult to implement, and others seek to hide problems in the TCP link, which already proven not to be effective. In order to improve TCP performance in such networks, this paper shows the early congestion control (ECC), a new cross-layer mechanism, implemented as an active queue management (AQM), that dynamically changes the value of the window field from TCP headers according to the utilization of the router queue. The new method is TCP-Friendly and does not require TCP changes. To evaluate its performance, comparison tests were performed against Droptail and RED approaches. Results of two simulation scenarios showed that the new method increases goodput and reduces delay and the number of losses.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124219934","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}