Routing in turn-prohibition based feed-forward networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3042, Issue , 2004, Pages 1168-1179

  Fidler, Markus ^a   Einhoff, Gerrit ^a  

^a UNIVERSITY HOSPITAL RWTH AACHEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

QUEUEING THEORY; ROUTING ALGORITHMS;

COMMUNICATIONS SYSTEMS; CYCLIC DEPENDENCIES; DIJKSTRA ALGORITHMS; FEED FORWARD; FEED-FORWARD NETWORK; QUEUING THEORY; TURN PROHIBITION;

ALGORITHMS;

EID: 35048828774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24693-0_96     Document Type: Article

References (17)

1. S. Blake, D. Blake, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An Architecture for Differentiated Services. RFC 2475, December 1998.
2. C.-S. Chang. Performance Guarantees in Communication Networks. Springer, 2000.
3. B. Davie, A. Charny, J.C.R. Bennett, K. Benson, J.Y. Le Boudec, W. Courtney, S. Davari, V. Firoiu, and D. Stiliadis. An Expedited Forwarding PHB (Per-Hop Behavior). RFC 3246, March 2002.
4. J. Duato, S. Yalamanchili, and N. Lionel. Interconnection Networks: An Engineering Approach. Morgan Kaufmann, 2003.
5. Gerrit Einhoff. Quality of Service Routing for an IP Premium Service based on MPLS Traffic Engineering. Master's Thesis, Aachen University, June 2003.
6. M. Fidler, and V. Sander. A Parameter Based Admission Control for Differentiated Services Networks, Elsevier Computer Networks, 44(4):463-479, 2004.
7. B. R. Haverkort. Performance of Computer Communication Systems: A Model-Based Approach. John Wiley & Sons, January 1999.
8. G. Hoffmann. G-WiN - the Gbit/s Infrastructure for the German Scientific Community. Proceedings of Terena Networking Conference, 2000.
9. M. S. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. Proceedings of IEEE INFOCOM (2), pages 884-893, 2000.
10. J.-Y. Le Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queueing Systems for the Internet. Number 2050 in LNCS. Springer, July 2002.
11. Q. Ma and P. Steenkiste. On Path Selection for Traffic with Bandwidth Guarantees. Proceedings of IEEE International Conference on Network Protocols, October 1997.
12. Q. Ma, P. Steenkiste, and H. Zhang. Routing High-Bandwidth Traffic in Max-Min Fair Share Networks. Proceedings of ACM SIGCOMM, pages 206-217, 1996.
13. M. D. Schroeder et al. Autonet: A High-speed, Self-configuring Local Area Network Using Point-to-point Links. IEEE Journal on Selected Areas in Communications, 9(8):1318-1335, October 1991.
14. V. Sander. Design and Evaluation of a Bandwidth Broker that Provides Network Quality of Service for Grid Applications, volume 16 of NIC. February 2003. PhD Thesis, Aachen University.
15. D. Starobinski, M. Karpovsky, and L. Zakrevski. Application of Network Calculus to General Topologies using Turn-Prohibition. IEEE/ACM Transactions on Networking, June 2003.
16. N. Taft-Plotkin, B. Bellur, and R. Ogier. Quality-of-Service Routing Using Maximally Disjoint Paths. Proceedings of IEEE/IFIP IWQoS, pages 119-128, June 1999.
17. Z. Wang and J. Crowcroft. Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal of Selected Areas in Communications, 14(7):1228-1234, 1996.