Optimal scheduling policy for AFDX End-Systems with virtual links of identical bandwidth allocation gap size

Author(s):  
R. Nishi ◽  
G. Zhu ◽  
Y. Savaria
2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Dongha An ◽  
Kyong Hoon Kim ◽  
Ki-Il Kim

As the bandwidth and scalability constraints become important design concerns in airborne networks, a new technology, called Avionics Full Duplex Switched Ethernet (AFDX), has been introduced and standardized as a part 7 in ARNIC 664. However, since previous research interests for AFDX are mainly bounded for analyzing the response time where flows information is given, configuration problem for both Maximum Transmission Unit (MTU) and Bandwidth Allocation Gap (BAG) over virtual links in AFDX networks has not been addressed yet even though it has great impact on required bandwidth. Thus, in this paper, we present two configuration approaches to set MTU and BAG values on virtual links efficiently while meeting the requirement of AFDX. The first is to search available feasible configuration (MTU, BAG) pairs to satisfy application requirements as well as AFDX switch constraints, and the second is to get an optimal pair to minimize required bandwidth through well-known branch-and-bound algorithm. We analyze the complexity of the proposed algorithm and then evaluate the proposed algorithm by simulation. Finally, we prove that the proposed schemes are superior to general approach in the aspects of speed and required bandwidth in AFDX networks.


2019 ◽  
Vol 51 (3) ◽  
pp. 278-293
Author(s):  
Adarsh Anand ◽  
◽  
Subhrata Das ◽  
Mohini Agarwal ◽  
V.S.S. Yadavalli ◽  
...  

2018 ◽  
Vol 45 (3) ◽  
pp. 217-223
Author(s):  
Y. Lu ◽  
S.T. Maguluri ◽  
M.S. Squillante ◽  
T. Suk ◽  
X. Wu

Author(s):  
Erhun Özkan

A fork-join processing network is a queueing network in which tasks associated with a job can be processed simultaneously. Fork-join processing networks are prevalent in computer systems, healthcare, manufacturing, project management, justice systems, and so on. Unlike the conventional queueing networks, fork-join processing networks have synchronization constraints that arise because of the parallel processing of tasks and can cause significant job delays. We study scheduling in fork-join processing networks with multiple job types and parallel shared resources. Jobs arriving in the system fork into arbitrary number of tasks, then those tasks are processed in parallel, and then they join and leave the network. There are shared resources processing multiple job types. We study the scheduling problem for those shared resources (i.e., which type of job to prioritize at any given time) and propose an asymptotically optimal scheduling policy in diffusion scale.


2021 ◽  
Author(s):  
Yue Hu ◽  
Carri W. Chan ◽  
Jing Dong

Service systems are typically limited resource environments where scarce capacity is reserved for the most urgent customers. However, there has been a growing interest in the use of proactive service when a less urgent customer may become urgent while waiting. On one hand, providing service for customers when they are less urgent could mean that fewer resources are needed to fulfill their service requirement. On the other hand, using limited capacity for customers who may never need the service in the future takes the capacity away from other more urgent customers who need it now. To understand this tension, we propose a multiserver queueing model with two customer classes: moderate and urgent. We allow customers to transition classes while waiting. In this setting, we characterize how moderate and urgent customers should be prioritized for service when proactive service for moderate customers is an option. We identify an index, the modified [Formula: see text]-index, which plays an important role in determining the optimal scheduling policy. This index lends itself to an intuitive interpretation of how to balance holding costs, service times, abandonments, and transitions between customer classes. This paper was accepted by David Simchi-Levi, stochastic models and simulation.


2018 ◽  
Vol 22 (1) ◽  
pp. 121-133 ◽  
Author(s):  
Geunchul Park ◽  
Seungwoo Rho ◽  
Jik-Soo Kim ◽  
Dukyun Nam

Sign in / Sign up

Export Citation Format

Share Document