Deterministic optimal routing for two heterogeneous parallel servers

2002 ◽  
Author(s):  
K. Oida ◽  
K. Shinjo
Keyword(s):  
Optimal Routing ◽  
Parallel Servers

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.

Distributed Aggregation/Disaggregation Algorithms for Optimal Routing in Data Networks

1988 ◽  
Author(s):  
Wei K. Tsai ◽  
G. Huang ◽  
John K. Antonio ◽  
Wei-T. Tsai
Keyword(s):  
Data Networks ◽  
Optimal Routing

scholarly journals OPMSS: Optimal Producer Mobility Support Solution for Named Data Networking

2021 ◽  
Vol 11 (9) ◽  
pp. 4064
Author(s):  
Muktar Hussaini ◽  
Muhammad Ali Naeem ◽  
Byung-Seo Kim
Keyword(s):  
Optimal Routing ◽  
Data Path ◽  
Named Data Networking ◽  
Packet Losses ◽  
Average Delay ◽  
Internet Architecture ◽  
Mobility Support ◽  
Signaling Overhead ◽  
Handoff Latency ◽  
Data Networking

Named data networking (NDN) is designed as a clean-slate Internet architecture to replace the current IP Internet architecture. The named data networking was proposed to offer vast advantages, especially with the advent of new content distributions in IoT, 5G and vehicular networking. However, the architecture is still facing challenges for managing content producer mobility. Despite the efforts of many researchers that curtailed the high handoff latency and signaling overhead, there are still some prominent challenges, such as non-optimal routing path, long delay for data delivery and unnecessary interest packet losses. This paper proposed a solution to minimize unnecessary interest packet losses, delay and provide data path optimization when the mobile producer relocates by using mobility update, broadcasting and best route strategies. The proposed solution is implemented, evaluated and benchmarked with an existing Kite solution. The performance analysis result revealed that our proposed Optimal Producer Mobility Support Solution (OPMSS) minimizes the number of unnecessary interest packets lost on average by 30%, and an average delay of 25% to 30%, with almost equal and acceptable signaling overhead costs. Furthermore, it provides a better data packet delivery route than the Kite solution.

scholarly journals Urgency-aware Optimal Routing in Repeated Games through Artificial Currencies

2021 ◽  
Author(s):  
Mauro Salazar ◽  
Dario Paccagnan ◽  
Andrea Agazzi ◽  
W.P.M.H. (Maurice) Heemels
Keyword(s):  
Repeated Games ◽  
Optimal Routing

scholarly journals System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion

2005 ◽  
Vol 53 (4) ◽  
pp. 600-616 ◽  
Author(s):  
Olaf Jahn ◽  
Rolf H. Möhring ◽  
Andreas S. Schulz ◽  
Nicolás E. Stier-Moses
Keyword(s):  
Optimal Routing ◽  
Traffic Flows ◽  
System Optimal
Sign in / Sign up

Export Citation Format

Share Document