@inproceedings{networking2006,
  author     = "G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler",
  title      = "On Improving the Accuracy of {OSPF Traffic Engineering}",
  booktitle  = "Lecture Notes in Computer Science: Proceedings of the Fifth International IFIP-TC6 Networking Conference",
  address    = "Coimbra, Portugal",
  year       = {2006},
  pages      = {51-62},
  paper      = {http://lendulet.tmit.bme.hu/~retvari/publications/mspr_networing_2006.pdf},
  doi        = {10.1007/11753810_5},
  abstract   = {The conventional forwarding rule used by IP networks is to
                  always choose the path with the shortest length -- in terms
                  of administrative link weights assigned to the links -- to
                  forward traffic.  Lately, it has been proposed to use
                  shortest-path-first routing to implement Traffic
                  Engineering in IP networks, promising with a big boost in
                  the profitability of the legacy network infrastructure. The
                  idea is to set the link weights so that the shortest paths,
                  and the traffic thereof, follow the paths designated by the
                  operator.  Unfortunately, traditional methods to calculate
                  the link weights usually produce a bunch of superfluous
                  shortest paths, often leading to congestion along the
                  unconsidered paths.  In this paper, we introduce and
                  develop novel methods to increase the accuracy of this
                  process and, by means of extensive simulations, we show
                  that our proposed solution produces remarkably high quality
                  link weights.}
}

{"_id":"eQ6S7k3unF4MnWzjQ","bibbaseid":"rtvri-bir-cinkler-onimprovingtheaccuracyofospftrafficengineering-2006","downloads":0,"creationDate":"2017-09-29T21:08:10.485Z","title":"On Improving the Accuracy of OSPF Traffic Engineering","author_short":["Rétvári, G.","Bíró, J. J.","Cinkler, T."],"year":2006,"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":[]},{"firstnames":["J.","J."],"propositions":[],"lastnames":["Bíró"],"suffixes":[]},{"firstnames":["T."],"propositions":[],"lastnames":["Cinkler"],"suffixes":[]}],"title":"On Improving the Accuracy of OSPF Traffic Engineering","booktitle":"Lecture Notes in Computer Science: Proceedings of the Fifth International IFIP-TC6 Networking Conference","address":"Coimbra, Portugal","year":"2006","pages":"51-62","paper":"http://lendulet.tmit.bme.hu/~retvari/publications/mspr_networing_2006.pdf","doi":"10.1007/11753810_5","abstract":"The conventional forwarding rule used by IP networks is to always choose the path with the shortest length -- in terms of administrative link weights assigned to the links -- to forward traffic. Lately, it has been proposed to use shortest-path-first routing to implement Traffic Engineering in IP networks, promising with a big boost in the profitability of the legacy network infrastructure. The idea is to set the link weights so that the shortest paths, and the traffic thereof, follow the paths designated by the operator. Unfortunately, traditional methods to calculate the link weights usually produce a bunch of superfluous shortest paths, often leading to congestion along the unconsidered paths. In this paper, we introduce and develop novel methods to increase the accuracy of this process and, by means of extensive simulations, we show that our proposed solution produces remarkably high quality link weights.","bibtex":"@inproceedings{networking2006,\n author = \"G. R\\'etv\\'ari and J. J. B\\'ir\\'o and T. Cinkler\",\n title = \"On Improving the Accuracy of {OSPF Traffic Engineering}\",\n booktitle = \"Lecture Notes in Computer Science: Proceedings of the Fifth International IFIP-TC6 Networking Conference\",\n address = \"Coimbra, Portugal\",\n year = {2006},\n pages = {51-62},\n paper = {http://lendulet.tmit.bme.hu/~retvari/publications/mspr_networing_2006.pdf},\n doi = {10.1007/11753810_5},\n abstract = {The conventional forwarding rule used by IP networks is to\n always choose the path with the shortest length -- in terms\n of administrative link weights assigned to the links -- to\n forward traffic. Lately, it has been proposed to use\n shortest-path-first routing to implement Traffic\n Engineering in IP networks, promising with a big boost in\n the profitability of the legacy network infrastructure. The\n idea is to set the link weights so that the shortest paths,\n and the traffic thereof, follow the paths designated by the\n operator. Unfortunately, traditional methods to calculate\n the link weights usually produce a bunch of superfluous\n shortest paths, often leading to congestion along the\n unconsidered paths. In this paper, we introduce and\n develop novel methods to increase the accuracy of this\n process and, by means of extensive simulations, we show\n that our proposed solution produces remarkably high quality\n link weights.}\n}\n\n","author_short":["Rétvári, G.","Bíró, J. J.","Cinkler, T."],"key":"networking2006","id":"networking2006","bibbaseid":"rtvri-bir-cinkler-onimprovingtheaccuracyofospftrafficengineering-2006","role":"author","urls":{},"downloads":0},"search_terms":["improving","accuracy","ospf","traffic","engineering","rétvári","bíró","cinkler"],"keywords":[],"authorIDs":[],"dataSources":["Byw3wEC6P9WCPMPit"]}