School of Computing

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

Su-Wei Tan, Sze-Wei Lee, and Benoit Vaillaint

Computer Communications Journal, 25(17):182-196, November 2002.

Bibtex Record

@article{1640,
author = {Su-Wei Tan and Sze-Wei Lee and Benoit Vaillaint },
title = {Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows},
month = {November},
year = {2002},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2002/1640},
    publication_type = {article},
    submission_id = {18172_1056970641},
    journal = {Computer Communications Journal},
    volume = {25},
    number = {17},
    publisher = {Elsevier Science},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014