Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems

Details Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems

2009-06-18

arxiv.org/abs/0906.3483v1

Acta Universitatis Apulensis - Mathematics-Informatics, no. 18, pp. 111-128, 2009. (ISSN: 1582-5329)

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we consider several problems concerning packet routing in distributed systems. Each problem is formulated using terms from Graph Theory and for each problem we present efficient, novel, algorithmic techniques for computing optimal solutions. We address topics like: bottleneck paths (trees), optimal paths with non-linear costs, optimal paths with multiple optimization objectives, maintaining aggregate connectivity information under a sequence of network link failures, and several others.

Affiliated with

Also associated with

No associations

Rating

Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems 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 Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725855