Path optimization of box-covering based routing to minimize average packet delay in software defined network

2020 ◽  
Vol 13 (3) ◽  
pp. 932-939 ◽  
Author(s):  
UmaMaheswari Gurusamy ◽  
K. Hariharan ◽  
M. S. K. Manikandan
Keyword(s):  
Packet Delay ◽  
Path Optimization ◽  
Software Defined Network ◽  
Average Packet Delay

Average packet delay of CSMA/CA with finite user population

2005 ◽  
Vol 9 (3) ◽  
pp. 273-275
Author(s):  
A. Gkelias ◽  
M. Dohler ◽  
V. Friderikos ◽  
A.H. Aghvami
Keyword(s):  
Packet Delay ◽  
Average Packet Delay

The Analysis of Input Queueing Techniques on a Crosspoint Packet Switch

1997 ◽  
Vol 07 (04) ◽  
pp. 319-331
Author(s):  
Jung Hoon Paik ◽  
Chae Tak Lim
Keyword(s):  
Markov Chain ◽  
Packet Delay ◽  
Contention Resolution ◽  
Input Buffer ◽  
New Approach ◽  
Average Packet Delay ◽  
N Input ◽  
Packet Switch ◽  
Input Queueing ◽  
The Relationship

In this paper, an N × N input-buffered crosspoint packet switch which selects a Head of the Line, HOL, packet in contention randomly is analyzed with a new approach. The approach is based on both a Markov chain representation of the input buffer and the probability that a HOL packet is successfully served. The probability as a function of N is derived, and it makes it possible to express the average packet delay and the average number of packets in the buffer as a function of N. The new contention resolution policy based on the occupancy of the input buffer is also presented and analyzed with this same approach and the relationship between the two selection policies is analyzed.

scholarly journals Minimization method for average packet delay in data transmission networks

2019 ◽  
Vol 149 ◽  
pp. 177-184 ◽  
Author(s):  
Sergiy Panchenko ◽  
Karyna Trubchaninova ◽  
Ilja Korago
Keyword(s):  
Data Transmission ◽  
Packet Delay ◽  
Minimization Method ◽  
Transmission Networks ◽  
Average Packet Delay

ANALYTICAL MODELING FOR MULTI-TIER DYNAMIC RESOURCE RESERVATION ALGORITHMS WITH THRESHOLD DERIVATIONS

2005 ◽  
Vol 06 (02) ◽  
pp. 131-174
Author(s):  
S. Shamala ◽  
M. Othman ◽  
R. Johari ◽  
M. Y. Saman
Keyword(s):  
Discrete Event ◽  
Packet Delay ◽  
Resource Reservation ◽  
Current Status ◽  
Average Packet Delay ◽  
Event Simulation ◽  
Delay Sensitive ◽  
Semi Markov Process ◽  
Accurate Performance ◽  
Dynamic Resource

The Multi-Tier (M-Tier) algorithm proposed in [1], has enabled an enhanced correlation between dynamic resource utilization and QoS guarantees. The algorithm favored the delay sensitive applications. Indirectly, this infers that the assignment of priorities practiced in the algorithm is static. In redesigning the algorithm, priority assignments should be able to be implemented dynamically. Thus, enabling an embedded element to provide implementation mobility. This would depend upon the current status of the classified buffers and the tolerance level of the delay sensitive traffic. Integrating control parameters to enable alternation in scheduling priorities is an option to resolve the element of partiality present in the M-Tier algorithm. Thereafter, the proposed algorithm will be denoted as the M-Tier(T) algorithm [2]. The paper proposes a detailed mathematical model for the analysis of dynamic resource reservation algorithms implemented in IP switches. The semi-markov process (SMP) approach utilized provides an accurate performance prediction and representation of resource reservation mechanisms. The algorithm correlates the average packet delay and packet loss ratio parameters to activate the dynamic resource reservation mechanism in a hierarchical manner. The developed models are validated through discrete-event simulation. The performance of the algorithm is studied in terms of average packet delay and network throughput.

CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS

2001 ◽  
Vol 12 (06) ◽  
pp. 775-790 ◽  
Author(s):  
K. OIDA ◽  
K. SHINJO
Keyword(s):  
Optimization Problem ◽  
Numerical Solutions ◽  
Heavy Traffic ◽  
Packet Delay ◽  
Optimal Routing ◽  
Service Rate ◽  
Arrival Times ◽  
Average Packet Delay ◽  
Parallel Servers

This paper presents characteristics of optimal routing that assigns each arriving packet to one of two heterogeneous parallel servers, each with its own queue. The characteristics are derived from numerical solutions to an optimization problem, which is to find optimal routing that minimizes the average packet delay under the condition that all of the packets' arrival times as well as all of the packets' sizes are completely known in advance. There are four characteristics: (1) Under light or moderate traffic, the average packet delay of optimal routing is almost the same as that of join the shortest delay (JSD) policy. (2) Under heavier traffic, optimal routing comes to more often use fix queue based on size (FS) policy. (3) Under heavy traffic, optimal routing assigns small packets to the slower server. (4) As the ratio of the slower server's service rate to the faster server's service rate decreases, optimal routing comes to more often use FS policy under light or moderated traffic. These characteristics are verified by the fact that a mimic optimal routing designed based on the four characteristics attains almost the same performance as optimal routing.

Performance Analysis of DCF- Two Way Handshake vs RTS/CTS During Train-Trackside Communication in CBTC based on WLAN802.11b

2020 ◽  
Vol 13 (3) ◽  
pp. 345-352
Author(s):  
Bhupendra Singh ◽  
Rajesh Mishra
Keyword(s):  
Delay Time ◽  
Wireless Local Area Network ◽  
Local Area Network ◽  
Packet Delay ◽  
Packet Transmission ◽  
Area Network ◽  
Delay Model ◽  
Medium Access ◽  
Average Packet Delay ◽  
Train Control

Background: Wireless Local Area Network (WLAN) is used primarily in CBTC because of easy availability of commercial WLAN equipment. In present scenario, WLAN Medium Access Control (MAC) protocol is a well-known protocol which is used to satisfy real-time traffic and delay- sensitive applications. The bidirectional train-trackside communication is the fundamental key of train control in CBTC. Methods: DCF describes two basic techniques used for packet transmission: First technique is a Two Way Handshake (TWH) mechanism and another is Four Way Handshake (FWH) mechanisms. RTS/CTS FWH protocol specified by IEEE802.11b is introduced to rectify the Hidden Node Problem (HNP) encounters in TWH protocol. That is why the TWH mechanism of DCF technique suffers from higher average packet delay time when this protocol is applied to CBTC. DCF- Four Way Handshake (FWH), Request To Send (RTS) and Clear To Send (CTS) delay model is proposed to develop Communication Based Train Control (CBTC) system. Results: FWH is applied in CBTC to overcome the packet delay and throughput limitations of Two Way Handshake (TWH) mechanism of distributed coordination function (DCF) based technique. An experiment is designed to simulate and compare the performance of RTS/CTS delay model against TWH mechanism of DCF. Conclusion: It was found that the Average packet delay is slightly higher and throughput is lesser in RTS/CTS in comparison to TWH method. By comparing the performance of these two medium access mechanism in CBTC it was found that for multiple retransmissions with various data rates the RTS/CTS model had better packet delay time than TWH.

Sign in / Sign up

Export Citation Format

Share Document