Skip to main content
SpringerLink
Log in

Service Curve Based Routing Subject to Deterministic QoS Constraints

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We consider the problem of routing in packet-switching networks subject to deterministic QoS constraints with the objective of minimizing induced cost. In particular, we propose a novel blend of generic service curves as abstraction of network transport services, of the associated network calculus under min–plus algebra and of existing heuristics for the restricted shortest path problem. Since the minimum cost objective requires an unambiguous definition of link service cost, we derive a cost model for the deployed generic service curve abstraction. Furthermore we describe the details of the different steps of the developed routing algorithm in pseudo-code notation. Our approach is subdivided into a pre-computation and an on-demand phase. Within the on-demand phase we deploy tabu-search as local search heuristic to exploit the neighbourhood of a pre-computed minimum weight path. The presented approach provides a generic technical solution for minimum-cost routing subject to deterministic QoS constraints. It is specifically designed to provide a solution path whenever the computation is stopped. Although such solutions may be non-optimal and even infeasible with respect to the QoS demand, obtaining a possible path is important in the trade-off of required processing time and accuracy of results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1992).

    Google Scholar 

  2. S. Blake et al., An architecture for differentiated services, RFC 2475, Internet Engineering Task Force (1998).

  3. A. Bouch and M.A. Sasse, Network quality of service: What do users need?, in: Proc. of the 4th Internat. Distributed Conf. (IDC'99), 1999, pp. 78–90.

  4. J.Y. Le Boudec, Application of network calculus to guaranteed service networks, IEEE Transactions on Information Theory 3(44) (1998).

  5. C. Casetti, J. Kurose and D. Towsley, An adaptive algorithm for measurement-based admission control in integrated services packet networks, in: Proc. of the Protocols for High Speed Networks Workshop, 1996.

  6. C. Chang, Queue length and delay of deterministic and stochastic queueing networks, IEEE Transactions on Automatic Control 39 (1994) 913–931.

    Google Scholar 

  7. C.-S. Chang, Performance Guarantees in Communication Networks, Telecommunication Networks and Computer Systems (Springer, New York, 2000).

    Google Scholar 

  8. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, The MIT Electrical Engineering and Computer Science Series (MIT Press, Cambridge, MA, 1990).

    Google Scholar 

  9. R.L. Cruz and H.-N. Liu, End-to-end queueing delay in ATM networks, Journal of High Speed Networks 3(4) (1994).

  10. B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: Proc. of INFOCOM, Vol. 2, 2000, pp. 519–528.

    Google Scholar 

  11. General aspects of quality of service and network performance in digital networks, including ISDNs, Recommendation I.350, ITU-T (1993).

  12. F. Glover and M. Laguna, Tabu Search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves (Oxford, UK, 1993).

  13. R. Guerin, A. Orda and D. Williams, QoS routing mechanisms and OSPF extensions, in: Proc. of the 2nd Global Internet Miniconference, 1997.

  14. R. Hassin, Approximation schemes for the restricted shortest path problem, Mathematics of Operations Research 17 (1992) 36–42.

    Google Scholar 

  15. E. Horlait and N. Rouhana, Differentiated services and integrated services use of MPLS, in: Proc. of the 5th IEEE Symposium on Computers and Communications (ISCC), Antibes, France, 2000, pp. 194–200.

  16. B. Jamoussi et al., Constraint-based LSP setup using LDP, Internet Engineering Task Force, RFC 3212 (January 2002).

  17. K. Kar, M.S. Kodialam and T. Lakshman, Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications.

  18. M.S. Kodialam and T.V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, in: Proc. of INFOCOM, Vol. 2, 2000, pp. 884–893.

    Google Scholar 

  19. S. Leonardi, On-line network routing, in: Online Algorithms (1996) pp. 242–267.

  20. D. Lorenz and A. Orda, QoS routing in networks with uncertain parameters, IEEE/ACMTransactions on Networking 6(6) (1998) 768–778.

    Google Scholar 

  21. D. Lorenz et al., Efficient QoS partition and routing of unicast and multicast, in: Proc. of IWQoS 2000, June 2000.

  22. D. Lorenz et al., How good can IP routing be?, Technical Report 2001-17, DIMACS (2001).

  23. Q. Ma and P. Steenkiste, Routing traffic with quality-of-service guarantees in integrated services networks, in: Proc. of NOSSDAV '98, 1998.

  24. A. Orda and A. Sprintson, QoS Routing: The precomputation perspective, in: Proc. of INFOCOM, Vol., 1, 2000, pp. 128–136.

    Google Scholar 

  25. A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE/ACM Transactions on Networking 2(2) (1994) 137–150.

    Google Scholar 

  26. A. Pouele, GEANT perspective of virtual networks and implementation proposal, in: 20th NORDUnet Networking Conf., Copenhagen, Denmark, 2002.

  27. D. Raz and Y. Shavitt, Optimal partition of QoS requirements with discrete cost functions, IEEE Journal on Selected Areas in Communications 18(12) (2000).

  28. S. Recker, W. Geisselhardt and I. Wolff, Applicability of traffic engineered routing in mobile data networks, in: Proc. of IASTED Symposium on Communication Systems and Networks, Malaga, Spain, 2002.

  29. J. Sairamesh, D.F. Ferguson and Y. Yemini, An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks, in: INFOCOM, Boston, MA, USA, 1995, pp. 1111–1119.

  30. A. Shaikh, J. Rexford and K. Shin, Efficient precomputation of quality-of-service routes, in: Workshop on Network and Operating Systems Support for Digital Audio and Video, 1998, pp. 15–27.

  31. D. Stiliadis and A. Varma, Latency-rate servers: a general model for analysis of traffic scheduling algorithms, IEEE/ACM Transactions on Networking 6(5) (1998) 611–624.

    Google Scholar 

  32. I. Stoica and H. Zhang, Providing guaranteed services without per flow management, in: Proc. of SIGCOMM'99, Boston, MA, 1999, pp. 81–94.

  33. Terms and definitions related to quality of service and network performance including dependability, Recommendation E.800, ITU-T (1994).

  34. P. Trimintzios et al., Engineering the multi-service Internet: MPLS and IP-based techniques, in: Proc. of IEEE Internat. Conf. on Telecommunications, Romania, Bucharest, June 2001.

  35. H.R. Varian, Microeconomic Analysis, 3rd ed. (W.W. Norton, 1999).

  36. Z. Wang and J. Crowcroft, Quality-of-service routing for supporting multimedia applications, IEEE Journal of Selected Areas in Communications 14(7) (1996) 1228–1234.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMST GmbH, Information and Communications Systems, Carl-Friedrich-Gauß-Str. 2, 47475, Kamp-Lintfort, Germany

    Stephan Recker

Authors
  1. Stephan Recker
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Recker, S. Service Curve Based Routing Subject to Deterministic QoS Constraints. Telecommunication Systems 24, 385–413 (2003). https://doi.org/10.1023/A:1026191519109

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026191519109

Search

Navigation