Routing Protocols with Smallest Maximal Latency


  • Gábor Kuruc
  • Krisztina Lója


There are a lot of routing protocols that minimize the total latency of the network. These have the drawback of causing too high latency for some traffic. The goal of this paper is to suggest an approach that takes into account not only the total latency but also the greatest latency in the network. Providers of voice, video or other real-time services should use a routing method that guarantees a routing path with minimal SLA (service level agreement) via the entire network for each customer. The cost base routing selection method that this paper suggests, tries to increase the minimum SLA in the entire network. The goal is to create a cheaper transport network with higher SLA without more passive network capacity.


selfish routing, latency, fairness, non-cooperative game theory, routing protocols, Nash flow.

How to Cite

Kuruc, G., Lója, K. “Routing Protocols with Smallest Maximal Latency”, Periodica Polytechnica Electrical Engineering, 49(3-4), pp. 209–221, 2005.