@inproceedings{mmns2003,
  author     = "G. R\'etv\'ari",
  title      = "Minimum Interference Routing: The Precomputation Perspective",
  booktitle  = {Proc., 6th IFIP/IEEE International Conference on Management of Multimedia Networks and Services (MMNS)},
  series     = {Lecture Notes in Computer Science},
  pages      = {246--258},
  month      = {September},
  year       = "2003",
  address    = {Belfast, UK},
  paper      = {http://lendulet.tmit.bme.hu/~retvari/publications/mmns_2003.pdf},
  doi        = {10.1007/978-3-540-39404-4_19},
  abstract   = {This paper focuses on the selection of bandwidth-guaranteed
                  channels for communication sessions that require it.  The
                  basic idea comes from Minimum Interference Routing: select
                  a feasible path that puts the least possible restriction on
                  the transmission capacity offered by the network for other
                  communicating parties. This is achieved by circumventing
                  certain critical bottleneck links. The main contribution of
                  the paper is a method to assess the degree of link
                  criticality facilitating efficient route precomputation
                  even in the case, when up to date resource availability
                  information is not immediately available.}
}

%%% ------------- 2004 ------------- %%%

{"_id":"8a3J2cRCskHseQSa8","bibbaseid":"rtvri-minimuminterferenceroutingtheprecomputationperspective-2003","downloads":0,"creationDate":"2017-09-29T21:08:10.475Z","title":"Minimum Interference Routing: The Precomputation Perspective","author_short":["Rétvári, G."],"year":2003,"bibtype":"inproceedings","biburl":"http://lendulet.tmit.bme.hu/~retvari/tmp/publications.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["G."],"propositions":[],"lastnames":["Rétvári"],"suffixes":[]}],"title":"Minimum Interference Routing: The Precomputation Perspective","booktitle":"Proc., 6th IFIP/IEEE International Conference on Management of Multimedia Networks and Services (MMNS)","series":"Lecture Notes in Computer Science","pages":"246--258","month":"September","year":"2003","address":"Belfast, UK","paper":"http://lendulet.tmit.bme.hu/~retvari/publications/mmns_2003.pdf","doi":"10.1007/978-3-540-39404-4_19","abstract":"This paper focuses on the selection of bandwidth-guaranteed channels for communication sessions that require it. The basic idea comes from Minimum Interference Routing: select a feasible path that puts the least possible restriction on the transmission capacity offered by the network for other communicating parties. This is achieved by circumventing certain critical bottleneck links. The main contribution of the paper is a method to assess the degree of link criticality facilitating efficient route precomputation even in the case, when up to date resource availability information is not immediately available.","bibtex":"@inproceedings{mmns2003,\n author = \"G. R\\'etv\\'ari\",\n title = \"Minimum Interference Routing: The Precomputation Perspective\",\n booktitle = {Proc., 6th IFIP/IEEE International Conference on Management of Multimedia Networks and Services (MMNS)},\n series = {Lecture Notes in Computer Science},\n pages = {246--258},\n month = {September},\n year = \"2003\",\n address = {Belfast, UK},\n paper = {http://lendulet.tmit.bme.hu/~retvari/publications/mmns_2003.pdf},\n doi = {10.1007/978-3-540-39404-4_19},\n abstract = {This paper focuses on the selection of bandwidth-guaranteed\n channels for communication sessions that require it. The\n basic idea comes from Minimum Interference Routing: select\n a feasible path that puts the least possible restriction on\n the transmission capacity offered by the network for other\n communicating parties. This is achieved by circumventing\n certain critical bottleneck links. The main contribution of\n the paper is a method to assess the degree of link\n criticality facilitating efficient route precomputation\n even in the case, when up to date resource availability\n information is not immediately available.}\n}\n\n%%% ------------- 2004 ------------- %%%\n\n","author_short":["Rétvári, G."],"key":"mmns2003","id":"mmns2003","bibbaseid":"rtvri-minimuminterferenceroutingtheprecomputationperspective-2003","role":"author","urls":{},"downloads":0},"search_terms":["minimum","interference","routing","precomputation","perspective","rétvári"],"keywords":[],"authorIDs":[],"dataSources":["Byw3wEC6P9WCPMPit"]}