Constrained Average Design Method for QoS-Based Traffic Engineering at the Edge/Gateway Boundary in VANETs and Cyber-Physical Environments

2021 ◽  
pp. 98-120
Author(s):  
Daniel Minoli ◽  
Benedict Occhiogrosso
Keyword(s):  
Wireless Networks ◽  
Distributed Systems ◽  
Packet Loss ◽  
Traffic Engineering ◽  
Design Method ◽  
Cyber Physical Systems ◽  
Physical Environments ◽  
Latency Jitter ◽  
Tiered Networks ◽  
Physical Components

Cyber physical systems (CPSs) are software-intensive smart distributed systems that support physical components endowed with integrated computational capabilities. Tiered, often wireless, networks are typically used to collect or push the data generated or required by a distributed set of CPS-based devices. The edge-to-core traffic flows on the tiered networks can become overwhelming. Thus, appropriate traffic engineering (TE) algorithms are required to manage the flows, while at the same time meeting the delivery requirements in terms of latency, jitter, and packet loss. This chapter provides a basic overview of CPSs followed by a discussion of a newly developed TE method called ‘constrained average', where traffic is by design allowed to be delayed up to a specified, but small value epsilon, but with zero packet loss.

QoS-Aware Scheme for Mobility Management and Adaptive Resource Reservation in 4G Wireless Networks

2012 ◽  
pp. 65-94
Author(s):  
Sihem Trabelsi ◽  
Noureddine Boudriga
Keyword(s):  
Wireless Networks ◽  
Mobility Management ◽  
Packet Loss ◽  
Resource Reservation ◽  
Bandwidth Utilization ◽  
Handoff Latency ◽  
4G Wireless ◽  
Adaptive Resource

Simulations show that the proposed scheme achieves better results than those of other resource reservation schemes for metrics like bandwidth utilization, handoff latency, and packet loss.

scholarly journals PARD: Hybrid Proactive and Reactive Method Eliminating Flow Setup Latency in SDN

2020 ◽  
Vol 28 (4) ◽  
pp. 1547-1574
Author(s):  
Michal Rzepka ◽  
Piotr Borylo ◽  
Artur Lason ◽  
Andrzej Szymanski
Keyword(s):  
Packet Loss ◽  
Traffic Engineering ◽  
Hardware Design ◽  
Software Defined Networking ◽  
Fine Grained ◽  
Flow Table ◽  
Scientific Papers ◽  
Reactive Method ◽  
Full Maturity

Abstract Advantages of Software Defined Networking are unquestionable and are widely described in numerous scientific papers, business white papers and press articles. However, to achieve full maturity, crucial impediments to this concept and its shortcomings must be overcame. One of the most important issues regards significant setup latency of a new flow. To address this issue we propose PARD: a hybrid proactive and reactive method to manage flow table entries. Additional advantages of the proposed solution are, among the others, its ability to preserve all capabilities of Software Defined Networking, utilization of multiple flow tables, a possibility to employ fine-grained traffic engineering and, finally, compatibility with existing protocol and hardware design. It is shown that the proposed solution is able to significantly reduce latency of first packets of a new flow, which directly impacts packet loss and perceived throughput. Thus, our solution is expected to enable a wide deployment of Software Defined Networking concept without any need for protocol changes or, what is extremely important, hardware modifications.

scholarly journals Methods for Large-Scale Time-Triggered Network Scheduling

Electronics ◽  
2019 ◽  
Vol 8 (7) ◽  
pp. 738 ◽  
Author(s):  
Francisco Pozo ◽  
Guillermo Rodriguez-Navas ◽  
Hans Hansson
Keyword(s):  
Wireless Networks ◽  
Large Scale ◽  
Synthesis Method ◽  
Cyber Physical Systems ◽  
Network Scheduling ◽  
Synthesis Time ◽  
Physical Systems ◽  
Large Size ◽  
Np Complete ◽  
Communication Schedule

Future cyber–physical systems may extend over broad geographical areas, like cities or regions, thus, requiring the deployment of large real-time networks. A strategy to guarantee predictable communication over such networks is to synthesize an offline time-triggered communication schedule. However, this synthesis problem is computationally hard (NP-complete), and existing approaches do not scale satisfactorily to the required network sizes. This article presents a segmented offline synthesis method which substantially reduces this limitation, being able to generate time-triggered schedules for large hybrid (wired and wireless) networks. We also present a series of algorithms and optimizations that increase the performance and compactness of the obtained schedules while solving some of the problems inherent to segmented approaches. We evaluate our approach on a set of realistic large-size multi-hop networks, significantly larger than those considered in the existing literature. The results show that our segmentation reduces the synthesis time by up to two orders of magnitude.

Sign in / Sign up

Export Citation Format

Share Document