{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:14:57Z","timestamp":1774120497576,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/infcom.2012.6195833","type":"proceedings-article","created":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T22:26:40Z","timestamp":1337898400000},"page":"846-854","source":"Crossref","is-referenced-by-count":72,"title":["A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering"],"prefix":"10.1109","author":[{"given":"Emilie","family":"Danna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhasree","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjun","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","year":"0","journal-title":"Clp Coin-or Linear Programming"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993756"},{"key":"18","year":"0","journal-title":"Abilene backbone network"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"16","article-title":"Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering","author":"xu","year":"2011","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1755"},{"key":"14","author":"robert","year":"1985","journal-title":"Identifying the Set of Always-active Constraints in A System of Linear Inequalities by A Single Linear Program"},{"key":"11","article-title":"Max-min fairness in multi-commodity flows","volume":"35","author":"dritan nace","year":"2008","journal-title":"Computers and Operations Research"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2008.080403"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461911"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2006.20"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2008.4483669"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2003.1214147"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.905605"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"4","author":"bertsekas","year":"1992","journal-title":"Data Networks"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2002.1021717"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.188"}],"event":{"name":"IEEE INFOCOM 2012 - IEEE Conference on Computer Communications","location":"Orlando, FL, USA","start":{"date-parts":[[2012,3,25]]},"end":{"date-parts":[[2012,3,30]]}},"container-title":["2012 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6189419\/6195452\/06195833.pdf?arnumber=6195833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T16:27:05Z","timestamp":1490113625000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6195833\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/infcom.2012.6195833","relation":{},"subject":[],"published":{"date-parts":[[2012,3]]}}}