A metric for dynamic routing based on variational principles

Authors:
A. M. Sukhov;D. Yu. Chemodanov
Affiliations:
Samara State Aerospace University, Moskovskoe sh. 34, Samara, 443086, Russia. E-mails: amskh@yandex.ru, duman190@gmail.com;Samara State Aerospace University, Moskovskoe sh. 34, Samara, 443086, Russia. E-mails: amskh@yandex.ru, duman190@gmail.com
Venue:
Journal of High Speed Networks
Year:
2013

Citing 6
Cited 0

A Note on Dijkstra's Shortest Path Algorithm

Journal of the ACM (JACM)
Interdomain Multicast Solutions Guide

Interdomain Multicast Solutions Guide
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Guidelines for interdomain traffic engineering

ACM SIGCOMM Computer Communication Review
Packet-dispersion techniques and a capacity-estimation methodology

IEEE/ACM Transactions on Networking (TON)
Metarouting

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, variational principles from theoretical physics are used to describe the process of routing in computer networks as an alternate approach to the traditional graph theory principles. The total traffic currently served on all hops of the route has been chosen as the quantity to minimize. A universal metric has been found for dynamic routing, taking into account the packet loss effect. An attempt was made to derive the metrics of the most popular dynamic routing protocols such as RIP, OSPF, EIGRP from the universal metric.