A Novel Mathematical Model for the Unique Shortest Path Routing Problem

Details A Novel Mathematical Model for the Unique Shortest Path Routing Problem A Novel Mathematical Model for the Unique Shortest Path Routing Problem

2008-06-30

arxiv.org/abs/0807.0038v2

Mathematics

Optimization and Control

31 pages, 4 figures

Scientific paper

Link weights are the principal parameters of shortest path routing protocols, the most commonly used protocols for IP networks. The problem of optimally setting link weights for unique shortest path routing is addressed. Due to the complexity of the constraints involved, there exist challenges to formulate the problem properly, so that a solution algorithm may be developed which could prove to be more efficient than those already in existence. In this paper, a novel complete formulation with a polynomial number of constraints is first introduced and then mathematically proved to be correct. It is further illustrated that the formulation has advantages over a prior one in terms of both constraint structure and model size for a proposed decomposition method to solve the problem.

Affiliated with

Also associated with

No associations

Rating

A Novel Mathematical Model for the Unique Shortest Path Routing Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Novel Mathematical Model for the Unique Shortest Path Routing Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Novel Mathematical Model for the Unique Shortest Path Routing Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80199