Inverse optimization in high-speed networks

Faragó, András; Szentesi, A.; Szviatovszki, Balázs

doi:10.1016/s0166-218x(02)00235-4

Cited by 34 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bley and Koch (2002) present an integer linear programming approach without additional variables for the routing metric for a survivable network design problem with unique shortest paths. Farago et al (2003) studiy a special case of ISP where the given paths are known to be shortest paths with respect to the number of links and the task is to find the link weights so that all these paths are unique. On the other hand, Holmberg and Yuan (2004) generalized the approach to solve a network design problem with unsplittable shortest path routing and multi-cast commodities.…”

Section: Unique Shortest Pathsmentioning

confidence: 99%

Intra-domain traffic engineering with shortest path routing protocols

et al. 2009

View full text Add to dashboard Cite

Throughout the last decade, extensive deployment of popular intradomain routing protocols such as open shortest path first and intermediate systemintermediate system, has drawn an ever increasing attention to Internet traffic engineering. This paper reviews optimization techniques that have been deployed for managing intra-domain routing in networks operated with shortest path routing protocols, and the state-of-the-art research that has been carried out in this direction.

show abstract

Section: Unique Shortest Pathsmentioning

confidence: 99%

Intra-domain traffic engineering with shortest path routing protocols

et al. 2009

View full text Add to dashboard Cite

show abstract

“…More work has been done on the single path case (see e.g. [12] and [13]) than on the more general case. However, to enable the use of load balancing, which may be important in practice, an SP-graph must be allowed to contain several paths between a pair of nodes.…”

Section: Problem Formulationmentioning

confidence: 99%

“…(If the paths are known, it is a simple matter to calculate the actual traffic.) Similar problems have previously been treated as optimization problems in [2,12,13,19], and in larger models for network design in [3,18]. Most of this work is done for undirected graphs and for single shortest paths.…”

Section: Introductionmentioning

confidence: 99%

Valid cycles: A source of infeasibility in open shortest path first routing

Broström

Holmberg

2008

Networks

View full text Add to dashboard Cite

Many telecommunication networks use the open shortest path first (OSPF) protocol for the routing of traffic. In such networks, each router sends the traffic on the shortest paths to the destination, with respect to the link weights assigned. An interesting question is whether or not a set of desired routing patterns can be obtained in an OSPF network by assigning appropriate weights. If not, we wish to find the source of the infeasibility. We study these issues by formulating a mathematical model and investigating its feasibility. A certain structure, called valid cycle, is found to be present in most infeasible instances. This yields new necessary conditions, stronger than those previously known, for the existence of weights yielding a set of given desired shortest path graphs. A valid cycle indicates which parts of the routing patterns are in conflict and can be used for changing the routing patterns to make the problem feasible. A polynomial algorithm for finding valid cycles is presented, the method is illustrated by a numerical example, and computational tests are reported.

show abstract

“…The Unmanned aerial vehicle, was changed in unmanned aircraft system to reflect the fact that these complex systems include ground control station and other elements beside the actual air vehicles. The wireless ad-hoc networks to consist of a collection of wireless nodes that communicate with a common wireless medium, mobile ad hoc networks are gaining momentum because they help realize network services for mobile users in areas with no preexisting communications infrastructure [1]. Ad hoc Networks to enable independent wireless nodes, each limited in transmission and processing power to be as a whole providing wider networking coverage and processing capabilities.…”

Section: Introductionmentioning

confidence: 99%

UAV Cloud Operating System

et al. 2018

View full text Add to dashboard Cite

Abstract. Unmanned aerial vehicle (UAV) which is a special case of mobile ad-hoc networks (MANETs) that attracts many researchers as it becomes a scope for both military and civilian applications. Also the trend of cloud computing when it is combined with UAV highlights this field of research in many aspects, but the most significant point of research is the operating system for the cloud. This paper investigates UAV cloud operating system showing the throughput (bits/Sec) for the system implemented when using both Windows and Linux operating systems in order to select the operating system used based on a real scientific results.

show abstract

Inverse optimization in high-speed networks

Cited by 34 publications

References 10 publications

Intra-domain traffic engineering with shortest path routing protocols

Intra-domain traffic engineering with shortest path routing protocols

Valid cycles: A source of infeasibility in open shortest path first routing

UAV Cloud Operating System

Contact Info

Product

Resources

About