scholarly journals Exposing End-to-End Delay in Software-Defined Networking

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Ting Zhang ◽  
Bin Liu
Keyword(s):  
Large Scale ◽  
Packet Delay ◽  
Software Defined Networking ◽  
Area Network ◽  
Delay Model ◽  
Wide Area Network ◽  
Worst Case ◽  
End To End Delay ◽  
End To End ◽  
The Impact

Software-Defined Networking (SDN) shows us a promising picture to deploy the demanding services in a fast and cost-effective way. Till now, most SDN use cases are deployed in enterprise/campus networks and data center networks. However, when applying SDN to the large-scale networks, such as Wide Area Network (WAN), the end-to-end delay of packet traversal is suspected to be very large and needs to be further investigated. Moreover, stringent time constraint is the cornerstone for real-time applications in SDN. Understanding the packet delay in SDN-based large networks is crucial for the proper design of switch architecture and the optimization of network algorithms such as flow control algorithms. In this paper, we present a thorough systematic exploration on the end-to-end delay in SDN which consists of multiple nodes, fully exposing the components which contribute to the long delay. We disclose that SDN switches cannot completely avoid the generation of flow setup even in proactive mode and conduct data mining on the probability of flow setup. We propose an analytical model for the end-to-end delay. This model takes into account the impact of the different rule installation time consumption on different switches. Considering the delay in switches contributes a large proportion to the entire delay, we conduct various measurements on the delay of a single switch. Results for the delay at different flow setup rates and with different rule priority patterns are presented. Furthermore, we study the impact on packet delay caused by ternary content addressable memory (TCAM) update. We measure parameters in the delay model and find that if SDN is deployed in all segments of WAN, the delay of packet traversal will be increased up to 27.95 times in the worst case in our experimental settings, compared with the delay in conventional network. Such high delay may eventually lead the end-to-end connections fail to complete if no additional measures are taken.

scholarly journals A Study on the Impact of Nodes Density on the Energy Consumption of LoRa

2021 ◽  
Vol 15 (14) ◽  
pp. 157
Author(s):  
Aizat Faiz Ramli ◽  
Muhammad Ikram Shabry ◽  
Mohd Azlan Abu ◽  
Hafiz Basarudin
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Low Power ◽  
Large Scale ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Area Network ◽  
Wide Area Network ◽  
Consumption Ratio ◽  
The Impact

LoRaWAN is one of the leading Low power wide area network (LPWAN) LPWAN technologies that compete for the formation of big scale Internet of Things (IoT). It uses LoRa protocol to achieve long range, low bit rate and low power communication. Large scale LoRaWAN based IoT deployments can consist of battery powered sensor nodes. Therefore, the energy consumption and efficiency of these nodes are crucial factors that can influence the lifetime of the network. However, there is no coherent experimental based research which identifies the factors that influence the LoRa energy efficiency at various nodes density. In this paper, results on measuring the packet delivery ratio, packet loss, data rate and energy consumption ratio ECR to gauge the energy efficiency of LoRa devices at various nodes density are presented. It is shown that the ECR of LoRa is inversely proportional to the nodes density and that the ECR of the network is smaller at higher traffic indicating better network energy efficiency. It is also demonstrated that at high node density, spreading factor SF of 7 and 9 can improve the energy efficiency of the network by 5 and 3 times, respectively, compare to SF 11.

scholarly journals K-Means Spreading Factor Allocation for Large-Scale LoRa Networks

Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4723 ◽  
Author(s):  
Muhammad Asad Ullah ◽  
Junnaid Iqbal ◽  
Arliones Hoeller ◽  
Richard Souza ◽  
Hirley Alves
Keyword(s):  
Low Power ◽  
Long Range ◽  
Large Scale ◽  
Research Work ◽  
Wide Area ◽  
Area Network ◽  
Wide Area Network ◽  
Spreading Factor ◽  
Worst Case ◽  
Simulation Results

Low-power wide-area networks (LPWANs) are emerging rapidly as a fundamental Internet of Things (IoT) technology because of their low-power consumption, long-range connectivity, and ability to support massive numbers of users. With its high growth rate, Long-Range (LoRa) is becoming the most adopted LPWAN technology. This research work contributes to the problem of LoRa spreading factor (SF) allocation by proposing an algorithm on the basis of K-means clustering. We assess the network performance considering the outage probabilities of a large-scale unconfirmed-mode class-A LoRa Wide Area Network (LoRaWAN) model, without retransmissions. The proposed algorithm allows for different user distribution over SFs, thus rendering SF allocation flexible. Such distribution translates into network parameters that are application dependent. Simulation results consider different network scenarios and realistic parameters to illustrate how the distance from the gateway and the number of nodes in each SF affects transmission reliability. Theoretical and simulation results show that our SF allocation approach improves the network’s average coverage probability up to 5 percentage points when compared to the baseline model. Moreover, our results show a fairer network operation where the performance difference between the best- and worst-case nodes is significantly reduced. This happens because our method seeks to equalize the usage of each SF. We show that the worst-case performance in one deployment scenario can be enhanced by 1 . 53 times.

scholarly journals An End-To-End LwM2M-Based Communication Architecture for Multimodal NB-IoT/BLE Devices

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2239 ◽  
Author(s):  
Subho Shankar Basu ◽  
Jetmir Haxhibeqiri ◽  
Mathias Baert ◽  
Bart Moons ◽  
Abdulkadir Karaagac ◽  
...  
Keyword(s):  
Transport Layer ◽  
Area Network ◽  
Protocol Stack ◽  
Wireless Internet ◽  
Wide Area Network ◽  
Long Distance ◽  
Communication Architecture ◽  
Data Rates ◽  
End To End ◽  
The Impact

The wireless Internet of Things (IoT) landscape is quite diverse. For instance, Low-Power Wide-Area Network (LPWAN) technologies offer low data rate communication over long distance, whereas Wireless Personal Area Network (WPAN) technologies can reach higher data rates, but with a reduced range. For simple IoT applications, communication requirements can be fulfilled by a single technology. However, the requirements of more demanding IoT use cases can vary over time and with the type of data being exchanged. This is pushing the design towards multimodal approaches, where different wireless IoT technologies are combined and the most appropriate one is used as per the need. This paper considers the combination of Narrow Band IoT (NB-IoT) and Bluetooth Low Energy (BLE) as communication options for an IoT device that is running a Lightweight Machine to Machine/Constrained Application Protocol (LwM2M/CoAP) protocol stack. It analyses the challenges incurred by different protocol stack options, such as different transfer modes (IP versus non-IP), the use of Static Context Header Compression (SCHC) techniques, and Datagram Transport Layer Security (DTLS) security modes, and discusses the impact of handover between both communication technologies. A suitable end-to-end architecture for the targeted multimodal communication is presented. Using a prototype implementation of this architecture, an in-depth assessment of handover and its resulting latency is performed.

Local area network analysis using end-to-end delay tomography

2005 ◽  
Vol 33 (3) ◽  
pp. 39-45
Author(s):  
Earl Lawrence ◽  
George Michailidis ◽  
Vijay N. Nair
Keyword(s):  
Network Analysis ◽  
Local Area Network ◽  
Local Area ◽  
Area Network ◽  
End To End Delay ◽  
End To End

scholarly journals Mitigation of packet loss with end-to-end delay in wireless body area network applications

2022 ◽  
Vol 12 (1) ◽  
pp. 460
Author(s):  
Suha Sahib Oleiwi ◽  
Ghassan N. Mohammed ◽  
Israa Al_Barazanchi
Keyword(s):  
Network Lifetime ◽  
Routing Protocol ◽  
Packet Loss ◽  
Wireless Body Area Network ◽  
Body Area Network ◽  
Area Network ◽  
Body Area ◽  
Cooperative Routing ◽  
End To End Delay ◽  
End To End

The wireless body area network (WBAN) has been proposed to offer a solution to the problem of population ageing, shortage in medical facilities and different chronic diseases. The development of this technology has been further fueled by the demand for real-time application for monitoring these cases in networks. The integrity of communication is constrained by the loss of packets during communication affecting the reliability of WBAN. Mitigating the loss of packets and ensuring the performance of the network is a challenging task that has sparked numerous studies over the years. The WBAN technology as a problem of reducing network lifetime; thus, in this paper, we utilize cooperative routing protocol (CRP) to improve package delivery via end-to-end latency and increase the length of the network lifetime. The end-to-end latency was used as a metric to determine the significance of CRP in WBAN routing protocols. The CRP increased the rate of transmission of packets to the sink and mitigate packet loss. The proposed solution has shown that the end-to-end delay in the WBAN is considerably reduced by applying the cooperative routing protocol. The CRP technique attained a delivery ratio of 0.8176 compared to 0.8118 when transmitting packets in WBAN.

Application Credibility Theory in the Smart Grid Information Network Security Assessment

2014 ◽  
Vol 960-961 ◽  
pp. 841-844
Author(s):  
Yan Bin Li ◽  
Yun Li ◽  
Wei Guo Li
Keyword(s):  
Smart Grid ◽  
Local Area Network ◽  
Credibility Theory ◽  
Local Network ◽  
Information Network ◽  
Area Network ◽  
Wide Area Network ◽  
Network Access ◽  
Smart Grid Security ◽  
The Impact

With the development of the smart grid , information network securityassessment affects the safe operation of the smart grid . In this paper, theimproved credibility theory and analytic hierarchy process , combined withstructural features of the smart grid network , From the wide area network ,access network, enterprise local network , local area network and the CPN-siteand home users to assess the impact of the five aspects of information networksfor smart grid security operation. And make the case for more security strategyto improve the reliability of the smart grid operation , thus providing a basisfor guiding the development and safe use of electricity grid users .

Evaluating The Performance for DCF Protocol and EDCA Protocol

2015 ◽  
Vol 72 (5) ◽  
Author(s):  
Ahmed Abu-Khadrah ◽  
Zahriladha Zakaria ◽  
Mohdazlishah Othman
Keyword(s):  
Real Time ◽  
Packet Loss ◽  
Area Network ◽  
Distributed Coordination ◽  
Data Types ◽  
End To End Delay ◽  
Main Challenge ◽  
Qos Parameters ◽  
End To End ◽  
Coordination Function

Nowadays supporting quality of service (QOS) for real time application is the main challenge of the wireless area network. 802.11standards use distributed Coordination Function (DCF) protocol and Enhanced Distributed Channel Access (EDCA) protocol in the MAC layer. DCF protocol has only one queue for different data types, it deals with data depending on the arriving time. There is no priority to serve real time applications faster. However EDCA protocol has four queues and each queue works with specific data type. Voice, video, best effort and background are the different queues in the EDCA protocol. Different parameters and priorities are defined for each queue. The voice queue reserves the highest priority and serves its data first. In this paper QOS parameters are measured for both DCF and EDCA protocol by using OPNET simulation. The QOS parameters must reach the requirements to support QOS. The results show how QOS parameters do not reach the requirements when using DCF protocol. The values of the end to end delay and the packet loss percentage are 0.514second, 19.04% respectively. But, when using EDCA protocol the end to end delay becomes 0.0624 second and the percentage of the packet loss decreases until reach 0.00617%. So the QOS parameters achieve requirements with EDCA protocol and support QOS.

scholarly journals LoRaWAN Mesh Networks: A Review and Classification of Multihop Communication

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4273
Author(s):  
Jeferson Rodrigues Cotrim ◽  
João Henrique Kleinschmidt
Keyword(s):  
Large Scale ◽  
Simulation Analysis ◽  
Mesh Networks ◽  
Smart Cities ◽  
Low Cost ◽  
Wide Area ◽  
Area Network ◽  
Full Potential ◽  
Wide Area Network ◽  
Coverage Area

The growth of the Internet of Things (IoT) led to the deployment of many applications that use wireless networks, like smart cities and smart agriculture. Low Power Wide Area Networks (LPWANs) meet many requirements of IoT, such as energy efficiency, low cost, large coverage area, and large-scale deployment. Long Range Wide Area Network (LoRaWAN) networks are one of the most studied and implemented LPWAN technologies, due to the facility to build private networks with an open standard. Typical LoRaWAN networks are single-hop in a star topology, composed of end-devices that transmit data directly to gateways. Recently, several studies proposed multihop LoRaWAN networks, thus forming wireless mesh networks. This article provides a review of the state-of-the-art multihop proposals for LoRaWAN. In addition, we carried out a comparative analysis and classification, considering technical characteristics, intermediate devices function, and network topologies. This paper also discusses open issues and future directions to realize the full potential of multihop networking. We hope to encourage other researchers to work on improving the performance of LoRaWAN mesh networks, with more theoretical and simulation analysis, as well as practical deployments.

USING NEURAL NETWORKS TO SOLVE THE MULTICAST ROUTING PROBLEM IN PACKET RADIO NETWORKS

1996 ◽  
Vol 07 (05) ◽  
pp. 617-626 ◽  
Author(s):  
THOMAS L. HEMMINGER ◽  
CARLOS A. POMALAZA-RAEZ
Keyword(s):  
Multicast Routing ◽  
Optimal Solution ◽  
Packet Delay ◽  
Hopfield Neural Network ◽  
Routing Problem ◽  
Packet Radio ◽  
Packet Radio Network ◽  
End To End Delay ◽  
Packet Delays ◽  
End To End

The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the packet delay at each node, then the problem becomes one of finding solutions which require the least number of transmissions. Determination of an optimal solution is NP-complete meaning that suboptimal solutions are frequently tolerated. The problem becomes more rigorous if packet delays are included in the network topology. This paper describes a practical technique for the computation of optimum or near optimum solutions to the multicasting problem with and without packet delay. The method is based on the Hopfield neural network and experiment has shown this method to yield near optimal solutions while requiring a minimum of CPU time.

scholarly journals Artificial Intelligence Enabled Routing in Software Defined Networking

2020 ◽  
Vol 10 (18) ◽  
pp. 6564 ◽  
Author(s):  
Yan-Jing Wu ◽  
Po-Chun Hwang ◽  
Wen-Shyang Hwang ◽  
Ming-Hua Cheng
Keyword(s):  
Artificial Intelligence ◽  
Performance Metrics ◽  
Packet Delay ◽  
Software Defined Networking ◽  
Dynamic Routing ◽  
Learning Ability ◽  
Control Plane ◽  
Monitoring Period ◽  
Data Plane ◽  
The Impact

Software defined networking (SDN) is an emerging networking architecture that separates the control plane from the data plane and moves network management to a central point, called the controller. The controller is responsible for preparing the flow tables of each switch in the data plane. Although dynamic routing can perform rerouting in case of congestion by periodically monitoring the status of each data flow, problems concerning a suitable monitoring period duration and lack of learning ability from past experiences to avoid similar but ineffective route decisions remain unsolved. This paper presents an artificial intelligence enabled routing (AIER) mechanism with congestion avoidance in SDN, which can not only alleviate the impact of monitoring periods with dynamic routing, but also provide learning ability and superior route decisions by introducing artificial intelligence (AI) technology. We evaluate the performance of the proposed AIER mechanism on the Mininet simulator by installing three additional modules, namely, topology discovery, monitoring period, and an artificial neural network, in the control plane. The effectiveness and superiority of our proposed AIER mechanism are demonstrated by performance metrics, including average throughput, packet loss ratio, and packet delay versus data rate for different monitoring periods in the system.

Sign in / Sign up

Export Citation Format

Share Document