Skip to main content

2018 | Buch

Wired/Wireless Internet Communications

16th IFIP WG 6.2 International Conference, WWIC 2018, Boston, MA, USA, June 18–20, 2018, Proceedings

herausgegeben von: Kaushik Roy Chowdhury, Marco Di Felice, Prof. Ibrahim Matta, Bo Sheng

Verlag: Springer International Publishing

Buchreihe : Lecture Notes in Computer Science

insite
SUCHEN

Über dieses Buch

This book constitutes the proceedings of the 16th IFIP International Conference on Wired/Wireless Internet Communications, WWIC 2018, held in Boston, MA, USA, in June 2018.
The 26 regular papers presented in this volume were carefully reviewed and selected from 42 submissions. They were organized in topical sections named: IoT and sensor networks; learning-based networking; network deployment; network security; aerial networks; and vehicular and content delivery networks.

Inhaltsverzeichnis

Frontmatter

IoT and Sensor Networks

Frontmatter
RTT-Based Congestion Control for the Internet of Things
Abstract
The design of scalable and reliable transport protocols for IoT environments is still an unsolved issue. A simple stop-and-wait congestion control method and a lightweight reliability mechanism are only implemented in CoAP, an application protocol that provides standardised RESTful services for IoT devices. Inspired by delay-based congestion control algorithms that have been proposed for the TCP, in this work we propose a rate control technique that leverages measurements of round-trip times (RTTs) to infer network state and to determine the flow rate that would prevent network congestion. Our key idea is that the growth of RTT variance, coupled with thresholds on CoAP message losses, is an effective way to detect the onset of network congestion. To validate our approach, we conduct a comparative performance analysis with the two loss-based congestion control methods of standard CoAP under different application scenarios. Results show that our solution outperforms the alternative methods, with a significant improvement of fairness and robustness against unacknowledged traffic.
Emilio Ancillotti, Simone Bolettieri, Raffaele Bruno
Ranged Name Retrieval: Design and Evaluation of a Flexible Data Retrieval Approach for ICN
Abstract
In Information-Centric Networking (ICN), applications request data based on the (exact) name of the data of interest. This poses a challenge for a growing number of applications, which do not know a priori the full name of a data object they seek, or do not necessarily need a specific data object, but are interested in a certain scope (e.g. the temperature in a particular geographical area). To address this challenge, we propose the more flexible and application-agnostic Ranged-Name Retrieval (RNR), which allows applications to define a range within each hierarchical component of the name they are requesting, obtaining in return one of the objects within that defined range. The performance evaluation of RNR indicates that, compared to the state of the art, it improves the bandwidth utilization efficiency 16-fold when retrieving data with unknown names, and even decreases the average end-to-end (E2E) delay for data delivery, while only adding 2% overhead for the processing of ranged-names.
Konstantinos Trichias, Lucia D’Acunto, Floris Drijver, Bastiaan Wissingh
Distributed Path Reconfiguration and Data Forwarding in Industrial IoT Networks
Abstract
In today’s typical industrial environments, the computation of the data distribution schedules is highly centralised. Typically, a central entity configures the data forwarding paths so as to guarantee low delivery delays between data producers and consumers. However, these requirements might become impossible to meet later on, due to link or node failures, or excessive degradation of their performance. In this paper, we focus on maintaining the network functionality required by the applications after such events. We avoid continuously recomputing the configuration centrally, by designing an energy efficient local and distributed path reconfiguration method. Specifically, given the operational parameters required by the applications, we provide several algorithmic functions which locally reconfigure the data distribution paths, when a communication link or a network node fails. We compare our method through simulations to other state of the art methods and we demonstrate performance gains in terms of energy consumption and data delivery success rate as well as some emerging key insights which can lead to further performance gains.
Theofanis P. Raptis, Andrea Passarella, Marco Conti
Real-World Deployments of Sensor Networks: Practical Lessons for Researchers
Abstract
To prevent other research groups from making the same errors as we did in real-world deployments of sensor networks, we share our experience from previous installations and lessons learned from them.
First of all, we are finally convinced to apply the KISS principle (Keep it Simple Stupid) also to real-world deployments, especially that as researchers we tend to prefer more complex and sophisticated ideas.
Second, researchers underestimate practical issues in outdoor installations, and it may lead to unexpected and time-consuming problems. For instance, we did not notice that the selected voltage regulator works reliably only in temperatures above zero degree Celsius, leading to packet losses and a long debugging process.
Third, apart from extensive software tests before deployment, our protocols and applications include also self-healing instructions. They detect software bugs on run-time and restart motes if needed.
With all these three major steps, we were able to run real-world sensor networks for several years without major problems, even when we do not have resources for efficient testing and debugging, the problem that most research groups have.
Marcin Brzozowski, Max Frohberg, Peter Langendoerfer
An Obstacle-Aware Clustering Protocol for Wireless Sensor Networks with Irregular Terrain
Abstract
Clustering in Wireless Sensor Networks (WSNs) is considered an efficient technique to optimize the energy consumption and increase the Packet Delivery Rate (PDR). Most of the proposed clustering protocols assume that there is a Line of Sight (LOS) between all the sensors. In real situations, there are obstacles which could interfere this LOS. Moreover, most of the available WSNs simulators assume the use of optimistic path loss models that neglect the effect of the obstacles on the PDR. In this paper, we adopt an obstacle-aware path loss model to reflect the effect of the obstacles on the communication between any the sensors. The Castalia simulator is then adapted to use this the proposed path loss model. Moreover, we propose an obstacle-aware clustering protocol, the NSGA-based, Non-LOS Cluster Head selection (NSGA-NLOS-CH) protocol, to solve the CHs selection problem in WSNs with an irregular field. Simulation results have shown that the effect of the obstacles on the PDR cannot be neglected. Moreover, NSGA-NLOS-CH outperforms other competent protocols in terms of the PDR while maintaining an acceptable energy consumption at the same time.
Riham Elhabyan, Wei Shi, Marc St-Hilaire
Evolutionary-Based Coverage Control Mechanism for Clustered Wireless Sensor Networks
Abstract
Many clustering protocols have been proposed for Wireless Sensor Networks (WSNs). However, most of these protocols focus on selecting the optimal set of Cluster Heads (CHs) in order to reduce or balance the network’s energy consumption and unfortunately, how to effectively cover the network area is often overlooked. Coverage optimization in WSNs is a well-known Non-deterministic Polynomial (NP)-hard optimization problem. In this paper, we propose a Genetic Algorithm (GA)-based Coverage Control Mechanism (GA-CCM) for clustered WSNs. GA-CCM provides an add-on mechanism that is designed to be integrated with any centralized clustering protocol to enhance its energy efficiency. GA-CCM finds the optimal set of active nodes that provides full area coverage and puts the redundant sensors into sleep mode to save energy. Extensive simulations of GA-CCM on 25 different WSNs topologies are conducted. Performance results are evaluated and compared against several well-known clustering protocols as well as a coverage-aware clustering protocol. Results show that GA-CCM always achieves full area coverage while minimizing the redundancy degree and the number of active nodes. To further evaluate the performance of GA-CCM as an add-on to existing clustering protocols, we integrate it with a Particle Swarm Optimization based CH selection protocol (PSO-CH), a comprehensive clustering protocol that considers many clustering objectives. To the best of our knowledge, PSO-CH has the lowest overall energy consumption among well-known clustering protocols. Experimental results show that this integration of GA-CCM to PSO-CH further improves its performance in terms of energy efficiency and packets delivery rate.
Riham Elhabyan, Wei Shi, Marc St-Hilaire

Learning-Based Networking

Frontmatter
Toward Resilient Smart Grid Communications Using Distributed SDN with ML-Based Anomaly Detection
Abstract
Next generation “Smart” systems, including cyber-physical systems like smart grid and Internet-of-Things, integrate control, communication and computation to achieve stability, efficiency and robustness of physical processes. While a great amount of research has gone towards building these systems, security in the form of resilient and fault-tolerant communications for smart grid systems is still immature. In this paper, we propose a hybrid, distributed and decentralized (HDD) SDN architecture for resilient Smart Systems. It provides a redundant controller design for fault-tolerance and fail-over operation, as well as parallel execution of multiple anomaly detection algorithms. Using the k-means clustering algorithm from the machine learning literature, it is shown that k-means can be used to produce a high accuracy (96.9%) of identifying anomalies within normal traffic. Furthermore, incremental k-means produces a slightly lower accuracy (95.6%) but demonstrated an increased speed with respect to k-means and fewer CPU and memory resources needed, indicating a possibility for scaling the system to much larger networks.
Allen Starke, Janise McNair, Rodrigo Trevizan, Arturo Bretas, Joshua Peeples, Alina Zare
Machine Learning-Based Real-Time Indoor Landmark Localization
Abstract
Nowadays, smartphones can collect huge amounts of data from their surroundings with the help of highly accurate sensors. Since the combination of the Received Signal Strengths of surrounding access points and sensor data is assumed to be unique in some locations, it is possible to use this information to accurately predict smartphones’ indoor locations. In this work, we apply machine learning methods to derive the correlation between smartphones’ locations and the received Wi-Fi signal strength and sensor values. We have developed an Android application that is able to distinguish between rooms on a floor, and special landmarks within the detected room. Our real-world experiment results show that the Voting ensemble predictor outperforms individual machine learning algorithms and it achieves the best indoor landmark localization accuracy of 94% in office-like environments. This work provides a coarse-grained indoor room recognition and landmark localization within rooms, which can be envisioned as a basis for accurate indoor positioning.
Zhongliang Zhao, Jose Carrera, Joel Niklaus, Torsten Braun
An Intelligent Defense and Filtration Platform for Network Traffic
Abstract
Hybrid Anomaly Detection Model (HADM) is a security platform to detect and prevent cyber-attacks on communication networks. The platform uses a combination of linear and learning algorithms combined with protocol analyzer. The linear algorithms filter and extract distinctive attributes and features of the cyber-attacks while the learning algorithms use these attributes and features to identify new types of cyber-attacks. The protocol analyzer in this platform classifies and filters vulnerable protocols to avoid unnecessary computation load. The use of linear algorithms in conjunction with learning algorithms allows the HADM to achieve improved efficiency in terms of accuracy and computation time in order to detect cyber-attacks over existing solutions.
Mehrnoosh Monshizadeh, Vikramajeet Khatri, Buse Atli, Raimo Kantola

Network Deployment

Frontmatter
Implementation and Evaluation of Distributed Geographical Routing
Abstract
Geocast has the potential to facilitate message delivering for geographically scoped information in many future scenarios such as vehicular networking and crisis control. An efficient geographic routing protocol is needed to enable Internet-wide geocast on the network level. In this paper we evaluate an implementation of a path based geographic routing protocol. We specifically look at the behavior and performance of this protocol during network convergence. We show that our implementation constructs forwarding trees that are close to a shortest path tree in link cost. We also show that our algorithm converges relatively quickly in case the network changes.
Bernd Meijerink, Geert Heijenk
Testbed Evaluation of Optimized REACT over Multi-hop Paths
Abstract
REACT is a distributed resource allocation protocol that computes a max-min allocation of airtime for mesh networks. The allocation adapts automatically to changes in local traffic load and in local network views. SALT, a new contention window tuning algorithm, ensures that each node secures the airtime allocated to it by REACT. REACT and SALT are extended to the multi-hop flow scenario with the introduction of a new airtime reservation algorithm. With a reservation in place, multi-hop TCP flows show increased throughput when running over SALT and REACT compared to running over 802.11 DCF. All results are obtained from experimentation on the w-iLab.t wireless network testbed in Belgium.
Matthew J. Mellott, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello
Segmented Source Routing for Handling Link Failures in Software Defined Network
Abstract
When a link fails in Software Defined Networks (SDN), the flows that use the failed link need to be rerouted over other paths. To achieve this rerouting task, researchers have proposed reactive and proactive recovery approaches. In reactive approach, upon failure, SDN controller computes new paths for the affected flows and installs them on demand. In proactive approach, the SDN controller pre-calculates backup paths and installs them on the switches in advance. While proactive approach minimizes packet loss and delay, it introduces a new problem, namely excessive usage of limited TCAM memory at SDN switches. In this paper, we consider two promising techniques (namely source routing and segment routing), and propose a new proactive technique called Segmented Source Routing (SSR). SSR uses source routing but in a segmented manner: one from the failure detecting node to an emergency node and one from emergency node to the destination. After addressing various challenges in placing emergency nodes and assigning emergency nodes to flows, our simulations shows that SSR maintains the same level of performance of pure source routing while significantly reducing the memory overhead, computation overhead, and the packet sizes as it shortens the source routes and avoids storing them at every node.
Sharvari Komajwar, Turgay Korkmaz
Protocol Heterogeneity Issues of Incremental High-Density Wi-Fi Deployment
Abstract
Going beyond the traditional coverage-oriented Wi-Fi network design, the recent Wi-Fi networks are designed for high traffic demand with high density deployments. A university campus environment is particularly unique in that a large number of users with multiple heterogeneous devices demand high capacity and performance from a wireless network over a wide geographical area. From a network management perspective, not only should the network support heterogeneous Wi-Fi protocols and devices, but high-density access points (APs) are needed to handle the high traffic demands. To meet the rising demands Wi-Fi AP upgrades are deployed incrementally over an extended period to cover the vast area found in a campus setting, which is different from a building-level Wi-Fi network.
In this paper, we present a measurement study to bring forth wireless network management issues faced during incremental Wi-Fi deployment on a university campus network. We discuss various design considerations given to incremental deployments of Wi-Fi 802.11 (ac) including replacing older Wi-Fi versions, and addressing compatibility, data rate, coverage, and performance concerns. In addition, we perform pre-and-post upgrade evaluations using different network performance analysis tools. This study will shed light on heterogeneous large-scale Wi-Fi network management issues, as these will become applicable with the increasing prevalence of large metro area wireless networks.
Haymanot Gebre-Amlak, Md Tajul Islam, Daniel Cummins, Mohammed Al Mansoori, Baek-Young Choi
How to Quantify Trust in Your Network Emulator?
Abstract
Network emulators are used in many contexts of communication networks for the design and the development of network management and routing strategies as well as for the tuning of multimedia services as Voice Over IP, video streaming, TV on-demand, to cite a few. These devices are generally used for modifying, in a controlled way, data traffic flows by changing, in real time, several critical parameters as delay, packet loss percentage, throughput, and so on. Due to very attractive features as high versatility and configurability and low cost, the solutions based on general purpose hardware platforms and free/open-source software are the most ones adopted in the practice for implementing network emulators. Nevertheless, in such architectures the complex interaction of software and hardware sections should affect the accuracy and repeatability of such systems in correctly emulating the desired network behaviors. Consequently, a suitable pre-characterization stage of such kind of network emulators should be performed before they are used. In this framework, the paper describes a methodological approach for designing suitable test-bed and measurement procedure able to reliably characterize the performance of such systems. The final aim of the research activity is to provide a suitable uncertainty model and a confidence level for the parameters provided by network emulators, which can drive the final users in more reliably analyzing the experimental results coming from their test campaigns and which involve the network emulators.
Domenico Capriglione, Gianni Cerro, Luigi Ferrigno, Gianfranco Miele
On the Fraction of LoS Blockage Time in mmWave Systems with Mobile Users and Blockers
Abstract
Today, one of the emerging trends for the next generation (5G) networks is utilizing higher frequencies in closer premises. As one of the enablers, small cells appear as a cost-effective way to reliably expand network coverage and provide significantly increased capacity for end users. The ultra-high bandwidth available at millimeter (mmWave, 30–300 GHz) and Terahertz (THz, 0.3–3 THz) frequencies can effectively realize short-range wireless access links in small cells. Those technologies could also be utilized for direct communications for users in proximity. At the same time, the performance of mobile wireless systems operating in those frequency bands depends on the availability of line-of-sight (LoS) between communicating entities. In this paper, we estimate the fraction of LoS time for randomly chosen node moving according to different mobility models in a field of N moving blocking nodes for both base station and device-to-device (D2D) connectivity scenarios. We also provide an extension to the case of a random number of moving blockers. The reported results can be further used to assess the amount of traffic offloaded to other technologies having greater coverage, e.g., LTE.
Dmitri Moltchanov, Aleksandr Ometov

Network Security

Frontmatter
An Anti-jamming Strategy When it Is Unknown Which Receivers Will Face with Smart Interference
Abstract
The paper considers a communication system consisting of a communication node utilizing multiple antennas in order to communicate with a group of receivers, while potentially facing interference from one or more jammers. The jammers impact the scenario by possibly interfering some of the receivers. The objective of the jammers is to reduce the throughput of nearby receivers, while taking into account the cost/risk of jamming. The fact that jammers face a cost implies that they might not choose to interfere, and thus the communication node faces uncertainty about which of its receivers will be jammed. This uncertainty is modeled by the communicator having only a priori probabilities about whether each receiver will face hostile interference or not, and if he does face such jamming, whether the jamming attack is smart or not. The goal of the communication node is to distribute total power resources to maximize the total throughput associated with communicating with all of the receivers. The problem is formulated as a Bayesian game between the communication system and the jammers. A waterfilling equation to find the equilibrium is derived, and its uniqueness is proven. The threshold value on the power budget is established for the receivers to be non-altruistic.
Andrey Garnaev, Wade Trappe, Athina Petropulu
Quantifying the Information Leak in IEEE 802.11 Network Discovery
Abstract
Wi-Fi is often the easiest and most affordable way to get a device connected. When a device connects to any Wi-Fi network its identifier (SSID) is stored in the device. These SSIDs are sometimes intentionally exposed to the outside world during periodic network discovery routines. In this paper we quantify the information leak that is present in the current network discovery protocol. Our collected data shows how common it is for a device to leak information and what can be derived from the names of networks a user has connected to in the past. We introduce a way to measure the uniqueness of an entity, which is based on the set of leaked SSID names. We apply previously proposed methods of MAC address randomization reversal on our data and evaluate entity uniqueness. We show how unique SSID names backfire against attempts to obfuscate user devices. Finally we evaluate an existing alternative network discovery scheme that does not leak information.
Otto Waltari, Jussi Kangasharju
Pairing-Based Cryptography on the Internet of Things: A Feasibility Study
Abstract
Pairing-based cryptography (PBC) has recently received much attention, since the mathematical building block of pairings paved the ground for devising efficient cryptographic protocols exploiting an old inspiration, i.e., to produce the public key of an entity based on its identity. The so-called Identity-Based Cryptography (IBC) simplifies key management procedures, since it does not require certificate-based infrastructures. Moreover, it is an elliptic curve cryptosystem which entails that it offers the same security levels as other public key systems with much smaller key lengths. The above characteristics make it an attractive solution for resource-constrained environments such as the Internet of Things (IoT), where strong confidentiality and signature schemes are necessary. In this article, we conducted feasibility tests of pairing-based cryptography for middle-class IoT devices, such as the Raspberry Pi 3 platform.
Ioanna Karantaidou, Spyros T. Halkidis, Sophia Petridou, Lefteris Mamatas, George Stephanides

Aerial Networks

Frontmatter
QoS-Based Mobility System for Autonomous Unmanned Aerial Vehicles Wireless Networks
Abstract
In the era of the Unmanned Aerial Vehicles (UAVs) several kinds of applications were born to make use of these autonomous vehicles, from surveillance to emergency management, from entertainment to package delivery. All these systems are based on the autonomous capability of the unmanned vehicles. The common factor of such systems is the use of an ad-hoc wireless network that enables the communication among the vehicles. However, guaranteeing an effective level of Quality-of-Service in the UAVs wireless network is hard to reach because of the unpredictable nature of such a system. Multiple solutions have emerged to address this problem, like enhanced communication protocols or mobility control systems that exploit the autonomous mobility of such vehicles. Nevertheless, none of those solutions have real affect on the end-to-end QoS performance. This paper aims to address the issue of guaranteeing the wireless network connectivity while providing Quality-of-Service at network layer, i.e., the proposed system will dynamically adapt its topology in order to increase the end-to-end network performance by using nature-inspired algorithm.
Angelo Trotta, Luca Sciullo
Implementing a System Architecture for Data and Multimedia Transmission in a Multi-UAV System
Abstract
The development of Unmanned Aerial Vehicles (UAV) along with the ubiquity of Internet of Things (IoT) enables the creation of systems that can provide real-time multimedia and data streaming. However, the high mobility of the UAVs introduces new constraints, like unstable network communications and security pitfalls. In this work, the experience of implementing a system architecture for data and multimedia transmission using a multi-UAV system is presented. The system aims at creating a bridge between UAVs and other types of devices, such as smartphones and sensors, while coping with the multiple fallbacks in an unstable communication environment.
Borey Uk, David Konam, Clément Passot, Milan Erdelj, Enrico Natalizio
Wireless Nanosensor Network with Flying Gateway
Abstract
The use of unmanned aerial vehicles (UAVs) with a nano communication networks can significantly expand the network’s capabilities. In addition, UAVs can automate the process of data collection and reduce its cost. This article expands the application that uses UAV to collect data from passive nanosensor devices. The article considers the specifics of the THz frequency range for the energy supply of nanodevices, as well as for communication with them. The paper presents a mathematical model of these processes and simulation results.
Rustam Pirmagomedov, Mikhail Blinnikov, Ruslan Kirichek, Andrey Koucheryavy
3D Folded Loop UAV Antenna Design
Abstract
Utilization of Unmanned Aerial Vehicles (UAVs), also known as “drones”, has a great potential for many emerging applications, such as delivering the connectivity on-demand, providing services for public safety, or recovering after damage to the communication infrastructure. Notably, nearly any application of drones requires a stable link to the ground control center, yet this functionality is commonly added at the last moment in the design, necessitating compact antenna designs. In this work, we propose a novel electrically small antenna element based on the 3D folded loop topology, which could be easily located inside the UAV airframe, yet still delivering good isolation from the drones own noise sources. The complete manufacturing technique along with corresponding simulations/measurements are presented. Measurements and evaluations show that the proposed antenna design is an option to achieve genuinely isotropic radiation in a small size without sacrificing efficiency.
Alexander Pyattaev, Dmitri Solomitckii, Aleksandr Ometov

Vehicular and Content Delivery Networks

Frontmatter
D2D Data Offloading in Vehicular Networks with Delivery Time Selection
Abstract
Within the framework of a Device-to-Device (D2D) data offloading system for cellular networks, we propose a Content Delivery Management System (CDMS) in which the instant for transmitting a content to a requesting node, through a D2D communication, is selected to minimize the energy consumption required for transmission. The proposed system is particularly fit to highly dynamic scenarios, such as vehicular networks, where the network topology changes at a rate which is comparable with the order of magnitude of the delay tolerance. Through extensive system level simulations, we compare the energy consumed by the devices to perform D2D data offloading using the proposed scheme with the energy consumed when using a benchmark scheme (proposed in previous works) without optimal transmission instant selection. The results show that, in specific scenarios, compared to the benchmark system in which the transmission instant is not optimized, the proposed system allows a reduction of the energy consumed for D2D communications above 90%.
Loreto Pescosolido, Marco Conti, Andrea Passarella
Adaptive V2V Routing with RSUs and Gateway Support to Enhance Network Performance in VANET
Abstract
In a VANET communication, link stability can neither be guaranteed nor make the established route link permanent due to the dynamic nature of the network. In V2V communication without the involvement of any infrastructural units like RSU access points or gateway, the probability of successful link establishment decreases when vehicle’s speed varies, red traffic light increases, cross-road increases and finally when the density of the running vehicles is sparse. To ensure route establishment and control route request broadcast in a sparse VANET with cross-road layout, RSUs are used in this paper for route discovery within one gateway zone when a next hop vehicle to relay the route request packet is unavailable. RSUs are static but the vehicles are dynamic in nature, so relying completely on RSU for forwarding data is not recommended because chances of link failure, link re-establishment, and handoff overhead will be high. So, in this paper, RSUs and Gateways are evoked for route discovery and data forwarding only when necessary. Moreover, a local route repair is attempted in this paper when the path length is high to reduce or avoid loss of buffered packets along the route and to maintain a more stable link with the help of RSUs.
Jims Marchang, Benjamin Sanders, Dany Joy
DFCV: A Novel Approach for Message Dissemination in Connected Vehicles Using Dynamic Fog
Abstract
Vehicular Ad-hoc Network (VANET) has emerged as a promising solution for enhancing road safety. Routing of messages in VANET is challenging due to packet delays arising from high mobility of vehicles, frequently changing topology, and high density of vehicles, leading to frequent route breakages and packet losses. Previous researchers have used either mobility in vehicular fog computing or cloud computing to solve the routing issue, but they suffer from large packet delays and frequent packet losses. We propose Dynamic Fog for Connected Vehicles (DFCV), a fog computing based scheme which dynamically creates, increments and destroys fog nodes depending on the communication needs. The novelty of DFCV lies in providing lower delays and guaranteed message delivery at high vehicular densities. Simulations were conducted using hybrid simulation consisting of ns-2, SUMO, and Cloudsim. Results show that DFCV ensures efficient resource utilization, lower packet delays and losses at high vehicle densities.
Anirudh Paranjothi, Mohammad S. Khan, Mohammed Atiquzzaman
Parametric-Decomposition Based Request Routing in Content Delivery Networks
Abstract
Content Delivery Networks (CDNs) enable the rapid web service access by meeting the client requests using the optimal surrogate server located at their nearby. However, the optimal surrogate server can suddenly be overloaded by the spiky characteristics of the high-bandwidth client requests. This accumulates both the drop rates and response times of the client requests. To solve these problems and balance the load on surrogate servers, we propose a Parametric-Decomposition based request routing at the surrogate servers in CDNs. With the Parametric Decomposition method, we combine the high-bandwidth client requests on origin server with our proposed Superposition and Queuing procedures. Then, we split these requests into more than one surrogate server through proposed Splitting and Adjustment procedures. We model the origin and surrogate servers based on G/G/1 queuing system to determine the load status. In case of high congestion on the origin server, we split client requests to the different surrogate servers instead of selecting one. The split sizes of whole content are adjusted by defining a novel splitter index parameter based on the queuing load and waiting time of surrogate servers. The results reveal that the proposed strategy reduces the load on surrogate servers by 42% compared to the conventional approaches. Moreover, the latency and request drops are decreased by 44% and 57% compared to the conventional approaches, respectively.
Tuğçe Bilen, Dinçer Salih Kurnaz, Serkan Sevim, Berk Canberk
Backmatter
Metadaten
Titel
Wired/Wireless Internet Communications
herausgegeben von
Kaushik Roy Chowdhury
Marco Di Felice
Prof. Ibrahim Matta
Bo Sheng
Copyright-Jahr
2018
Electronic ISBN
978-3-030-02931-9
Print ISBN
978-3-030-02930-2
DOI
https://doi.org/10.1007/978-3-030-02931-9