New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints

Details New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints

2009-12-04

arxiv.org/abs/0912.0803v1

Proceedings of the 8th RoEduNet International Conference, pp. 7-12, Galati, Romania, 3-4 December, 2009. (ISBN: 978-606-8085-1

Computer Science

Data Structures and Algorithms

Scientific paper

The problem of efficiently delivering data within networks is very important nowadays, especially in the context of the large volumes of data which are being produced each year and of the increased data access needs of the users. Efficient data delivery strategies must satisfy several types of Quality of Service (QoS) constraints which are imposed by the data consumers. One possibility of achieving this goal (particularly in the case of in-order data transfers) is to choose a satisfactory network delivery path. In this paper we present novel algorithmic approaches for computing optimal network paths which satisfy several types of (QoS) constraints.

Affiliated with

Also associated with

No associations

Rating

New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints 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 New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-420409