A new approach for delay-constrained routing

Computer Communications

Volumn 25, Issue 18, 2002, Pages 1751-1764

  Bettahar, Hatem ^a   Bouabdallah, Abdelmadjid ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Algorithm; Delay constrained routing; End to end delay; Multicast Routing; QoS

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; NETWORK PROTOCOLS;

DELAY-CONSTRAINED ROUTING;

ROUTERS;

EID: 0036891651     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(02)00103-2     Document Type: Article

References (20)

1. K. Almeroth, M. Ammar, Collecting and modelling the join/leave behaviour of multicast group members in the Mbone, Proceedings of the Symposium on High Performance Distributed Computing, Syracuse NY, 1996, pp. 209-2016.
2. Almeroth K., Ammar M. Multicast group behaviour in the internet's multicast backbone (Mbone). IEEE Communications Magazine. 35:1997.
3. G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, T. Przygienda, QOS routing mechanisms and OSPF extensions, RFC 2676, Experimental, August 1999.
4. H. Bettahar, A. Bouabdallah, C. Beaujean, A parameterized distributed unicast routing algorithm with end-to-end delay constraint, Proceedings of the Eighth IEEE International Conference on Telecommunications ICT 2001, Romania, Available at http://www.hds.utc.fr/̃hbettaha, vol. 3, 2001, pp. 65-70.
5. C. Beaujean, H. Bettahar, A. Bouabdallah, S. Cateloinand, E. Gourdin, Delay-based issues in IP networks, Networks 2000 Proceedings, Toronto, Canada, September 2000.
6. Chen S., Nahrstedt K. Finding multi-constrained paths. IEEE International Conference on Communications. 1998.
7. Carlberg K., Crowcroft J. Building shared trees using a one-to-many joining mechanism. ACM Computer Communication Review. 1997;5-11.
8. Dijkstra E. Two problems in connection with graphs. Numerische Mathematik. 1:(5):1959;269-271.
9. Faloutsos M., Banerjea A., Pankaj R. QoSMIC: Quality of Service sensitive Multicast Internet protoCol. Proceedings of SIGCOMM'98. 1998.
10. Jaffe J. Algorithms for finding paths with multiple constraints. Networks. 14:(1):1984;95-116.
11. A. Odlyzko, The internet and other networks: utilization rates and their implications, Available at http://www.research.att.com/̃amo, 1998.
12. Bellman R. Dynamic Programming, Princeton University press, Princeton, NJ, 1957.
13. H.F. Salama, Multicast routing for real-time communication on high-speed networks, PhD thesis, North Carolina State University, 1996.
14. Shin K., Chou C. A distributed route-selection scheme for establishing real-time channel. Proceedings of Sixth IFIP International Conference on High Performance Networking. 1995;319-329.
15. Sun Q., Langendorfer H. A new distributed routing algorithm for supporting delay-sensitive applications. Computer Communications. 21:(6):1998;572-578.
16. S. Verma, Multicast routing and resource allocation for high-speed networks, PhD thesis, Department of ECE, University of Toronto, 1998.
17. Q. Ma, Quality-of-Service routing in integrated services networks, PhD thesis, School of CS, Carnegie Mellon University, 1998.
18. Wang Z., Crowcroft J. Quality-of-Service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications. 14:(7):1996;1228-1234.
19. Waxman B. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications. 6:(9):1988;1617-1622.
20. R. Widyono, The design and evaluation of routing algorithms for real-time channels, Technical Report ICSI TR-94-024, Department of EECS, University of California at Berkeley, 1994.