Internode Distance and Optimal Routing in a Class of Alternating Group Networks

2006 ◽  
Vol 55 (12) ◽  
pp. 1645-1648 ◽  
Author(s):  
Baoxing Chen ◽  
Wenjun Xiao ◽  
B. Parhami
Keyword(s):  
Alternating Group ◽  
Optimal Routing ◽  
Internode Distance

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

Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

Networks ◽  
2004 ◽  
Vol 44 (4) ◽  
pp. 302-310 ◽  
Author(s):  
Jou-Ming Chang ◽  
Jinn-Shyong Yang ◽  
Yue-Li Wang ◽  
Yuwen Cheng
Keyword(s):  
Fault Tolerant ◽  
Alternating Group ◽  
Hamiltonian Connectivity
Sign in / Sign up

Export Citation Format

Share Document