Modeling Air-Traffic Service Time Uncertainties for Queuing Network Analysis

2012 ◽  
Vol 48 (1) ◽  
pp. 525-541 ◽  
Author(s):  
Jinwhan Kim ◽  
M. Tandale ◽  
P. K. Menon
2015 ◽  
Vol 77 (18) ◽  
Author(s):  
Aznida Hayati Zakaria ◽  
Md. Yazid Mohd Saman ◽  
Ahmad Shukri M Noor ◽  
Hasni Hassan

Mobile ad hoc network (MANET) is a group of mobile nodes establishing a wireless network without using centralized and fixed infrastructure.  In MANET, nodes may function as hosts and routers. The nodes can move freely and in arbitrary ways. The network topology in MANET is dynamic because of the frequent mobility of nodes, thus routing is challenging aspects in MANET.  Routing protocol plays a role in choosing and selecting the optimal route for transferring the packets of data from the source node to the destination node efficiently. Mostly the previous routing protocols are not practical to this dynamic network topology. Therefore designing an efficient routing protocol for this dynamic network is vital issue. In this paper, the author has proposed an approach, which selects shortest route for transferring the packets of data from source node to the destination node combining firefly algorithm and queuing network analysis. Firefly algorithm can be applied to find the shortest route in this routing problem. The response times taken to send packets of data can be calculated using the suggested queuing model. The result reveals that attractiveness of node in MANET decreases with the increasing value of response time.


Author(s):  
G. Menga ◽  
G. Bruno ◽  
R. Conterno ◽  
M. Dato

2020 ◽  
Vol 118 (1) ◽  
pp. 412-422
Author(s):  
Marissa Nitz ◽  
Deandra Smith ◽  
Beata Wysocki ◽  
Daren Knoell ◽  
Tadeusz Wysocki

Author(s):  
LIANG ZHU ◽  
PAUL SCHONFELD ◽  
YEON MYUNG KIM ◽  
IAN FLOOD ◽  
CHING-JUNG TING

An Artificial Neural Network (ANN) model has been developed for analyzing traffic in an inland waterway network. The main purpose of this paper is to determine how well such a relatively fast model for analyzing a queuing network could substitute for far more expensive simulation. Its substitutability for simulation is judged by relative discrepancies in predicting tow delays between the ANN and simulation models. This model is developed by integrating five distinct ANN submodels that predict tow headway variances at (1) merge points, (2) branching (i.e., diverging) points, (3) lock exits, and (4) link outflow points (e.g., at ports, junctions, or lock entrances), plus (5) tow queuing delays at locks. Preliminary results are shown for those five submodels and for the integrated network analysis model. Eventually, such a network analyzer should be useful for designing, selecting, sequencing, and scheduling lock improvement projects, for controlling lock operations, for system maintenance planning, and for other applications where many combinations of network characteristics must be evaluated. More generally, this method of decomposing complex queuing networks into elements that can be analyzed with ANNs and then recombined provides a promising approach for analyzing other queuing networks (e.g., in transportation, communication, computing, and production systems).


2021 ◽  
Vol 2091 (1) ◽  
pp. 012030
Author(s):  
A A Larionov ◽  
A A Mukhtarov ◽  
A M Sokolov

Abstract End-to-end delay is one of the key characteristics of communication network performance. This characteristic determines the possibility of using the network for various delay-critical applications like voice or video transmission. One of the widely used approaches to estimating delays is the use of the queuing theory. According to this approach, a telecommunication network is modeled using a multiphase queuing system. Communication channels are modeled using service devices, and the incoming traffic is modeled with random distributions of the inter-arrival intervals between packets. The accuracy of this network model directly depends on how well the service time distributions are chosen. These distributions must consider the specifics of complex telecommunication protocols, size distributions of the transmitted packets, and, in case of wireless channels, the rate of collisions and retransmissions. The paper presents a study of the accuracy of estimates of end-to-end delays in a multi-hop wireless network using a queuing network with a phase-type (PH) service time distributions. To calibrate the model, PH distributions are found using the moments-matching method based on sample data on the duration of packet transmission in IEEE 802.11 channels. This sample data was obtained using a simulation model written in NS-3, taking into account the features of the IEEE 802.11 protocol and the presence of collisions in the network. To evaluate the accuracy, end-to-end delays are calculated using the queuing network and the wireless network simulation model. It is shown that it is possible to obtain reasonably accurate estimates for small networks, but with an increase in the size of the network, the accuracy decreases. In conclusion, recommendations are given to improve the accuracy of modeling.


Sign in / Sign up

Export Citation Format

Share Document