Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems

Details Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems

2009-06-01

arxiv.org/abs/0906.0376v1

Proceedings of the 17th International Conference on Control Systems and Computer Science (CSCS), vol. 1, pp. 273-280, Buchares

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we address several network design, clustering and Quality of Service (QoS) optimization problems and present novel, efficient, offline algorithms which compute optimal or near-optimal solutions. The QoS optimization problems consist of reliability improvement (by computing backup shortest paths) and network link upgrades (in order to reduce the latency on several paths). The network design problems consist of determining small diameter networks, as well as very well connected and regular network topologies. The network clustering problems consider only the restricted model of static and mobile path networks, for which we were able to develop optimal algorithms.

Affiliated with

Also associated with

No associations

Rating

Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems 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 Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234227