Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256024
Jakob Struye, Bart Spinnewyn, K. Spaey, Kristiaan Bonjean, Steven Latré
Since its introduction in 2012, telecommunications operators have been applying the Network Function Virtualization principle to their core infrastructure, leading to more agile and cost-efficient deployments. While these Virtualized Network Functions (VNFs) are traditionally implemented using Virtual Machines (VMs), efforts are starting to shift to containerized VNF implementations, further improving agility and cost-efficiency. Furthermore, telecom applications often require extreme networking performance in terms of throughput and latency. While research has shown that containers outperform VMs on this front, it is currently unclear how the choice of container provider influences network performance. In this paper we compare the networking performance of Linux container implementations Docker, rkt and LXC. Throughput and latency are evaluated for single-host host, bridge (or NAT) and macvlan network configurations. This is, to the best of our knowledge, the first comparison featuring all three major Linux container implementations. We show that LXC performs best, with Docker and rkt showing throughputs of respectively up to 35 % and 58 % lower. Of the considered networking implementations, the macvlan network performs best. While it experiences a significant performance degradation when many containers are chained together, a single container using macvlan can outperform even a bare metal implementation when enough CPU resources are available.
{"title":"Assessing the value of containers for NFVs: A detailed network performance study","authors":"Jakob Struye, Bart Spinnewyn, K. Spaey, Kristiaan Bonjean, Steven Latré","doi":"10.23919/CNSM.2017.8256024","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256024","url":null,"abstract":"Since its introduction in 2012, telecommunications operators have been applying the Network Function Virtualization principle to their core infrastructure, leading to more agile and cost-efficient deployments. While these Virtualized Network Functions (VNFs) are traditionally implemented using Virtual Machines (VMs), efforts are starting to shift to containerized VNF implementations, further improving agility and cost-efficiency. Furthermore, telecom applications often require extreme networking performance in terms of throughput and latency. While research has shown that containers outperform VMs on this front, it is currently unclear how the choice of container provider influences network performance. In this paper we compare the networking performance of Linux container implementations Docker, rkt and LXC. Throughput and latency are evaluated for single-host host, bridge (or NAT) and macvlan network configurations. This is, to the best of our knowledge, the first comparison featuring all three major Linux container implementations. We show that LXC performs best, with Docker and rkt showing throughputs of respectively up to 35 % and 58 % lower. Of the considered networking implementations, the macvlan network performs best. While it experiences a significant performance degradation when many containers are chained together, a single container using macvlan can outperform even a bare metal implementation when enough CPU resources are available.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122469677","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256043
Tom De Schepper, Jakob Struye, Ensar Zeljković, Steven Latré, J. Famaey
Current mobile consumer devices are equipped with the ability to connect to the Internet using a variety of heterogeneous wireless network technologies (e.g., Wi-Fi and LTE). These devices generally opt to statically connect using a single technology, based on predefined priorities. This static behavior does not allow the network to unlock its full potential, which becomes increasingly more important as the requirements of services, in terms of for example throughput and reliability, grow. Multipath TCP (MPTCP) is a solution that allows the simultaneous use of multiple network interfaces. However, it does this uncoordinated for a single connection between two endpoints. Therefore, this paper proposes a Software-Defined Networking (SDN) architecture to enable coordinated multi-path routing across the several networks for mobile devices. Moreover, we propose a novel weighted MPTCP scheduler that allows the transmission of certain controllable percentages of data per network interface. The proposed idea is evaluated through a real-life prototype implementation with a smartphone.
{"title":"Software-defined multipath-TCP for smart mobile devices","authors":"Tom De Schepper, Jakob Struye, Ensar Zeljković, Steven Latré, J. Famaey","doi":"10.23919/CNSM.2017.8256043","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256043","url":null,"abstract":"Current mobile consumer devices are equipped with the ability to connect to the Internet using a variety of heterogeneous wireless network technologies (e.g., Wi-Fi and LTE). These devices generally opt to statically connect using a single technology, based on predefined priorities. This static behavior does not allow the network to unlock its full potential, which becomes increasingly more important as the requirements of services, in terms of for example throughput and reliability, grow. Multipath TCP (MPTCP) is a solution that allows the simultaneous use of multiple network interfaces. However, it does this uncoordinated for a single connection between two endpoints. Therefore, this paper proposes a Software-Defined Networking (SDN) architecture to enable coordinated multi-path routing across the several networks for mobile devices. Moreover, we propose a novel weighted MPTCP scheduler that allows the transmission of certain controllable percentages of data per network interface. The proposed idea is evaluated through a real-life prototype implementation with a smartphone.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127434110","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256049
Doyoung Lee, Yoonseon Han, J. W. Hong
Network virtualization is a technique that abstracts the underlying physical infrastructures into multiple isolated networks. Currently, network virtualization based on Software-Defined Networking (SDN) has attracted interests from industry and academia to utilize limited network resources by using benefits of SDN. SDN has useful features such as programmability, flexibility, and agility. In order to virtualize networks in SDN, a network hypervisor intercepts and modifies OpenFlow messages so that it provisions multiple virtual networks, virtual Software-Defined Networks (vSDNs). However, existing SDN-based network hypervisors do not provide an easy-to-use method to connect a created vSDN with external networks. It limits the usefulness of vSDNs. To resolve this problem, we propose a virtual gateway for external connectivity in vSDN. The proposed virtual gateway is implemented using ONOS virtualization subsystem. The virtual gateway is able to provide external connectivity and other useful network functions such as firewall, traffic shaping, and load-balancing. To demonstrate the feasibility of virtual gateway, we evaluate round trip time and deployment time to show a connectivity and overhead of the virtual gateway deployment.
{"title":"Design of virtual gateway in virtual software defined networks","authors":"Doyoung Lee, Yoonseon Han, J. W. Hong","doi":"10.23919/CNSM.2017.8256049","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256049","url":null,"abstract":"Network virtualization is a technique that abstracts the underlying physical infrastructures into multiple isolated networks. Currently, network virtualization based on Software-Defined Networking (SDN) has attracted interests from industry and academia to utilize limited network resources by using benefits of SDN. SDN has useful features such as programmability, flexibility, and agility. In order to virtualize networks in SDN, a network hypervisor intercepts and modifies OpenFlow messages so that it provisions multiple virtual networks, virtual Software-Defined Networks (vSDNs). However, existing SDN-based network hypervisors do not provide an easy-to-use method to connect a created vSDN with external networks. It limits the usefulness of vSDNs. To resolve this problem, we propose a virtual gateway for external connectivity in vSDN. The proposed virtual gateway is implemented using ONOS virtualization subsystem. The virtual gateway is able to provide external connectivity and other useful network functions such as firewall, traffic shaping, and load-balancing. To demonstrate the feasibility of virtual gateway, we evaluate round trip time and deployment time to show a connectivity and overhead of the virtual gateway deployment.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126340355","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8255987
M. Martinello, A. Liberato, A. Beldachi, K. Kondepu, Roberta Lima-Gomes, R. Villaça, M. Ribeiro, Yan Yan, E. Hugues-Salas, D. Simeonidou
Edge Data Centres (EDC) are often managed by a single administrative entity with logically centralized control. The architectural split of control and data planes and the new control plane abstractions have been touted as Software-Defined Networking (SDN), where the OpenFlow protocol is one common choice for the standardized programmatic interface to data plane devices. However, in the design of an SDN architecture, there is no clear distinction between functional network parts such as core and edge elements. It means that all switches require to support lookups over hundreds of bits with complex actions that have to be specified by multiple tables. In this paper, we propose a new programmable architecture for EDC networks, named Residues Defined Networks (RDN). In RDN, a controller defines a network policy (e.g. connectivity protection) setting flow entries at the edges. Based on these entries, the edge switches assign routeIDs to flows. A route is defined as the remainder of the division (Residue) between a route-ID and a set of switch-IDs within RDN core. In case of failures, emergency routes are compactly encoded as programmable residues forwarding paths written into the packets. RDN scalability is evaluated considering 2-tier Clos topologies which cover mostly EDC deployments supporting up to 2304 servers. A RDN proof-of-concept prototype is implemented in Mininet for network emulation. Also, to increase the accuracy on latency measures, we implement RDN in NetFPGA that is validated in a testbed with 10Gbps Ethernet boards. RDN offers ultra-fast failure recovery (sub-milliseconds carrier grade), achieves low latency with RDN switching time per hop (« 0.6μs) and no jitter within the RDN core.
{"title":"Programmable residues defined networks for edge data centres","authors":"M. Martinello, A. Liberato, A. Beldachi, K. Kondepu, Roberta Lima-Gomes, R. Villaça, M. Ribeiro, Yan Yan, E. Hugues-Salas, D. Simeonidou","doi":"10.23919/CNSM.2017.8255987","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255987","url":null,"abstract":"Edge Data Centres (EDC) are often managed by a single administrative entity with logically centralized control. The architectural split of control and data planes and the new control plane abstractions have been touted as Software-Defined Networking (SDN), where the OpenFlow protocol is one common choice for the standardized programmatic interface to data plane devices. However, in the design of an SDN architecture, there is no clear distinction between functional network parts such as core and edge elements. It means that all switches require to support lookups over hundreds of bits with complex actions that have to be specified by multiple tables. In this paper, we propose a new programmable architecture for EDC networks, named Residues Defined Networks (RDN). In RDN, a controller defines a network policy (e.g. connectivity protection) setting flow entries at the edges. Based on these entries, the edge switches assign routeIDs to flows. A route is defined as the remainder of the division (Residue) between a route-ID and a set of switch-IDs within RDN core. In case of failures, emergency routes are compactly encoded as programmable residues forwarding paths written into the packets. RDN scalability is evaluated considering 2-tier Clos topologies which cover mostly EDC deployments supporting up to 2304 servers. A RDN proof-of-concept prototype is implemented in Mininet for network emulation. Also, to increase the accuracy on latency measures, we implement RDN in NetFPGA that is validated in a testbed with 10Gbps Ethernet boards. RDN offers ultra-fast failure recovery (sub-milliseconds carrier grade), achieves low latency with RDN switching time per hop (« 0.6μs) and no jitter within the RDN core.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125935592","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256058
A. Nguyen-Ngoc, Stanislav Lange, T. Zinner, Michael Seufert, P. Tran-Gia, N. Aerts, D. Hock
One of the benefits when network operators adopt the Software Defined Networking (SDN) paradigm is the ability to monitor the traffic in the network without an additional network management system. Usually, SDN controllers utilize OpenFlow statistics messages in order to regularly gather information about all flows in the network. However, using the same polling interval for all flows does not take into account the heterogeneity of real world traffic and thus results in an imbalance between monitoring accuracy and control plane overhead. In particular, frequent querying results in a high resource consumption at the controller. This work proposes a Selective Flow Monitoring (SFM) mechanism that allows administrators to classify flows according to their individual requirements in terms of monitoring frequency, e.g., less frequent polling of elephant flows and frequent polling of QoS sensitive VoIP connections. We compare the performance of the SFM mechanism with the default monitoring scheme in a testbed featuring the Open Network Operating System (ONOS) controller. In this context, the CPU utilization of the controller is used as performance indicator. After identifying relevant influence factors like the number of flows and switches in the network, we investigate the viability of the approaches in different scenarios. Finally, we provide guidelines regarding their choice.
{"title":"Performance evaluation of selective flow monitoring in the ONOS controller","authors":"A. Nguyen-Ngoc, Stanislav Lange, T. Zinner, Michael Seufert, P. Tran-Gia, N. Aerts, D. Hock","doi":"10.23919/CNSM.2017.8256058","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256058","url":null,"abstract":"One of the benefits when network operators adopt the Software Defined Networking (SDN) paradigm is the ability to monitor the traffic in the network without an additional network management system. Usually, SDN controllers utilize OpenFlow statistics messages in order to regularly gather information about all flows in the network. However, using the same polling interval for all flows does not take into account the heterogeneity of real world traffic and thus results in an imbalance between monitoring accuracy and control plane overhead. In particular, frequent querying results in a high resource consumption at the controller. This work proposes a Selective Flow Monitoring (SFM) mechanism that allows administrators to classify flows according to their individual requirements in terms of monitoring frequency, e.g., less frequent polling of elephant flows and frequent polling of QoS sensitive VoIP connections. We compare the performance of the SFM mechanism with the default monitoring scheme in a testbed featuring the Open Network Operating System (ONOS) controller. In this context, the CPU utilization of the controller is used as performance indicator. After identifying relevant influence factors like the number of flows and switches in the network, we investigate the viability of the approaches in different scenarios. Finally, we provide guidelines regarding their choice.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126071197","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256048
Ian Vermeulen, Patrick Bosch, Tom De Schepper, Steven Latré
Wi-Fi network roaming is the act of moving a wireless device from one Wi-Fi access point (AP) to another Wi-Fi AP. In urban environments, where APs are densely deployed, users would greatly benefit from roaming between these APs. Standards for Wi-Fi-network roaming have been developed (e.g. IEEE 802.11r), but are rarely implemented. The absence of a widely used standard leads to device-dependent roaming mechanisms, which brings numerous disadvantages. 5G-EmPOWER is an example of a framework that brings the Software-Defined Networking (SDN) paradigm to wireless networks. The framework solves the problem of network roaming by allowing users to connect to their own unique virtual AP and managing their connection to the WAN behind the scenes. This allows the 5G-EmPOWER controller to seamlessly handover users from one physical AP to another. Currently, a single physical controller manages the 5G-EmPOWER control plane. The use of a single system over a distributed system has known disadvantages (e.g. greater cost, single point of failure). In this paper, we present DiMob, which distributes the SDN control plane among multiple controllers. We show that DiMob maintains a seamless handover, while offering the advantages of a distributed system. We demonstrate, for example, that adding an additional node can save approximately 30 % in CPU usage for each controller.
{"title":"DiMob: Scalable and seamless mobility in SDN managed wireless networks","authors":"Ian Vermeulen, Patrick Bosch, Tom De Schepper, Steven Latré","doi":"10.23919/CNSM.2017.8256048","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256048","url":null,"abstract":"Wi-Fi network roaming is the act of moving a wireless device from one Wi-Fi access point (AP) to another Wi-Fi AP. In urban environments, where APs are densely deployed, users would greatly benefit from roaming between these APs. Standards for Wi-Fi-network roaming have been developed (e.g. IEEE 802.11r), but are rarely implemented. The absence of a widely used standard leads to device-dependent roaming mechanisms, which brings numerous disadvantages. 5G-EmPOWER is an example of a framework that brings the Software-Defined Networking (SDN) paradigm to wireless networks. The framework solves the problem of network roaming by allowing users to connect to their own unique virtual AP and managing their connection to the WAN behind the scenes. This allows the 5G-EmPOWER controller to seamlessly handover users from one physical AP to another. Currently, a single physical controller manages the 5G-EmPOWER control plane. The use of a single system over a distributed system has known disadvantages (e.g. greater cost, single point of failure). In this paper, we present DiMob, which distributes the SDN control plane among multiple controllers. We show that DiMob maintains a seamless handover, while offering the advantages of a distributed system. We demonstrate, for example, that adding an additional node can save approximately 30 % in CPU usage for each controller.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128437701","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8255995
Xinyi Hu, G. Kesidis, S. Baek
We consider a single, unaffiliated streaming content provider (CP) and another that is vertically integrated (affiliated) with a cellular wireless ISP. We formulate a non-cooperative game between these two CPs involving, e.g., linear demand-response to price by the end-users with long-duration sessions (e.g., streaming video), and a model as amplified noise of additional network delay jitter and reduced responsiveness to changing channel conditions by the unaffiliated CP. The effect of effective additional side-payments from the unaffiliated CP to the ISP, as may be set by a government regulator, is studied at Stackelberg equilibrium both analytically and numerically.
{"title":"Regulating wireless access costs for not vertically integrated content providers","authors":"Xinyi Hu, G. Kesidis, S. Baek","doi":"10.23919/CNSM.2017.8255995","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255995","url":null,"abstract":"We consider a single, unaffiliated streaming content provider (CP) and another that is vertically integrated (affiliated) with a cellular wireless ISP. We formulate a non-cooperative game between these two CPs involving, e.g., linear demand-response to price by the end-users with long-duration sessions (e.g., streaming video), and a model as amplified noise of additional network delay jitter and reduced responsiveness to changing channel conditions by the unaffiliated CP. The effect of effective additional side-payments from the unaffiliated CP to the ISP, as may be set by a government regulator, is studied at Stackelberg equilibrium both analytically and numerically.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157521","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256045
T. Kohler, Frank Dürr, Christian Baumlisberger, K. Rothermel
Recent developments in networking hardware and software-defined networking have enabled full distribution of network control to reduce control latency and increase reliability. However, both, hardware and software of current white-box networking hardware are highly heterogeneous, which limits the deployment and operation of switch-local control applications. Furthermore, switch-local control raises yet unconsidered security concerns. In this paper, we present our concept of in-forward-element processing, which leverages the open access to the control plane of white-box networking hardware to deploy control logic directly onto switches. We combine local control applications with lightweight virtualization to cope with networking hardware heterogeneity and to achieve required isolation properties and ease of management. Beyond distributed network control, we show this scheme is also beneficial for implementing switch-local virtual network functions (NFV), processing packets. Highlighting the practicability of the concepts, we provide an overview of the current white-box networking hardware and software landscape and their compatibility with lightweight virtualization technologies. To this end, we perform an empirical evaluation of NOS-virtualization combinations on such hardware and compare the results with respect to incurring virtualization overhead.
{"title":"InFEP — Lightweight virtualization of distributed control on white-box networking hardware","authors":"T. Kohler, Frank Dürr, Christian Baumlisberger, K. Rothermel","doi":"10.23919/CNSM.2017.8256045","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256045","url":null,"abstract":"Recent developments in networking hardware and software-defined networking have enabled full distribution of network control to reduce control latency and increase reliability. However, both, hardware and software of current white-box networking hardware are highly heterogeneous, which limits the deployment and operation of switch-local control applications. Furthermore, switch-local control raises yet unconsidered security concerns. In this paper, we present our concept of in-forward-element processing, which leverages the open access to the control plane of white-box networking hardware to deploy control logic directly onto switches. We combine local control applications with lightweight virtualization to cope with networking hardware heterogeneity and to achieve required isolation properties and ease of management. Beyond distributed network control, we show this scheme is also beneficial for implementing switch-local virtual network functions (NFV), processing packets. Highlighting the practicability of the concepts, we provide an overview of the current white-box networking hardware and software landscape and their compatibility with lightweight virtualization technologies. To this end, we perform an empirical evaluation of NOS-virtualization combinations on such hardware and compare the results with respect to incurring virtualization overhead.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132480497","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8255997
Ting-Ting Yang, Hsueh-Wen Tseng
Bluetooth Low Energy (BLE) Beacon technology is well on the way to becoming the future of business due to its inexpensive and low-power properties. All communications in BLE networks must involve neighbor discovery process (NDP) in the first place since a BLE device needs to create a connection or exchange information with its neighbors. Thus, the performance of the discovery latency is a challenging issue to be addressed for integrating BLE into the Beacon application development as the number of BLE devices increases. In this paper, we propose a twoway communication with wait-slot scheme (TCWS) to minimize the probability of collision occurring on the response frames of BLE devices and improve the latency of NDP. We formulate the state transition diagram for analyzing the performance of our proposed scheme. The results show that TCWS provides much better performance in terms of the probability of collision and the discovery latency in dense BLE networks.
{"title":"Two-way communication with wait-slot scheme for neighbor discovery process in dense Bluetooth low energy networks","authors":"Ting-Ting Yang, Hsueh-Wen Tseng","doi":"10.23919/CNSM.2017.8255997","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255997","url":null,"abstract":"Bluetooth Low Energy (BLE) Beacon technology is well on the way to becoming the future of business due to its inexpensive and low-power properties. All communications in BLE networks must involve neighbor discovery process (NDP) in the first place since a BLE device needs to create a connection or exchange information with its neighbors. Thus, the performance of the discovery latency is a challenging issue to be addressed for integrating BLE into the Beacon application development as the number of BLE devices increases. In this paper, we propose a twoway communication with wait-slot scheme (TCWS) to minimize the probability of collision occurring on the response frames of BLE devices and improve the latency of NDP. We formulate the state transition diagram for analyzing the performance of our proposed scheme. The results show that TCWS provides much better performance in terms of the probability of collision and the discovery latency in dense BLE networks.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130092732","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}
Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256029
Kohei Watabe, Shintaro Hirakawa, K. Nakagawa
In this paper, we propose an accurate parallel flow monitoring method using active probe packets. Although multiple probe flows are monitored to measure delays on multiple paths in parallel for most measurement applications, information of only one probe flow of the multiple probe flows is utilized to measure an end-to-end delay on a path in conventional active measurement. In addition to information observed by the flow along the path, information of other flows is also utilized for the measurement in the proposed method. Delays on a flow are accurately measured by partially converting the observation results of a flow to those of another flow. Simulations are performed to confirm that the observation results of 72 parallel flows of active measurement are appropriately converted between each other in the proposed method. When the 99th-percentile of an end-to-end delay for each flow are measured, the proposed method achieves up to 95 % reduction of the error, and the error of the worst flow among all flows are reduced by 28%.
{"title":"Accurate delay measurement for parallel monitoring of probe flows","authors":"Kohei Watabe, Shintaro Hirakawa, K. Nakagawa","doi":"10.23919/CNSM.2017.8256029","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256029","url":null,"abstract":"In this paper, we propose an accurate parallel flow monitoring method using active probe packets. Although multiple probe flows are monitored to measure delays on multiple paths in parallel for most measurement applications, information of only one probe flow of the multiple probe flows is utilized to measure an end-to-end delay on a path in conventional active measurement. In addition to information observed by the flow along the path, information of other flows is also utilized for the measurement in the proposed method. Delays on a flow are accurately measured by partially converting the observation results of a flow to those of another flow. Simulations are performed to confirm that the observation results of 72 parallel flows of active measurement are appropriately converted between each other in the proposed method. When the 99th-percentile of an end-to-end delay for each flow are measured, the proposed method achieves up to 95 % reduction of the error, and the error of the worst flow among all flows are reduced by 28%.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130165285","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
扫码关注我们
求助内容：
应助结果提醒方式：