{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:02:20Z","timestamp":1748923340623,"version":"3.41.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Technology and Management"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1015546212618","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T23:59:19Z","timestamp":1041119959000},"page":"229-245","source":"Crossref","is-referenced-by-count":1,"title":["Planning Models for Wide-Area Communication Network Design with Response-Time-Dependent Offered Traffic"],"prefix":"10.1007","volume":"3","author":[{"given":"Larry J.","family":"LeBlanc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sridhar","family":"Narasimhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Ran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"407332_CR1","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/TAC.1983.1103183","volume":"AC-28","author":"D. Bertsekas","year":"1983","unstructured":"D. Bertsekas and E. Gafni, Projected Newton methods and optimization of multicommodity flows, IEEE Transactions on Automatic Contr. AC-28 (1983) 1090-1096.","journal-title":"IEEE Transactions on Automatic Contr"},{"key":"407332_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02110041","volume":"3","author":"J. Chifflet","year":"1994","unstructured":"J. Chifflet, P. Mahey and V. Reynier, Proximal decomposition for multicommodity flow problems with convex costs, Telecommunication Systems 3 (1994) 1-10.","journal-title":"Telecommunication Systems"},{"key":"407332_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/trsc.14.1.42","volume":"14","author":"S. Dafermos","year":"1980","unstructured":"S. Dafermos, Traffic equilibrium and variational inequalities, Transportation Science 14 (1980) 42-54.","journal-title":"Transportation Science"},{"key":"407332_CR4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/0191-2615(82)90007-8","volume":"16B","author":"M. Florian","year":"1982","unstructured":"M. Florian and H. Spiess, The convergence of diagonalization algorithms for asymmetric network equilibrium problems, Transportation Research 16B (1982) 477-483.","journal-title":"Transportation Research"},{"key":"407332_CR5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230170307","volume":"17","author":"M. Florian","year":"1987","unstructured":"M. Florian, J. Guelat and H. Spiess, An efficient implementation of the PARTAN variant of the linear approximation method for network equilibrium problem, Networks 17 (1987) 319-339.","journal-title":"Networks"},{"key":"407332_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L. Fratta","year":"1973","unstructured":"L. Fratta, M. Gerla and L. Kleinrock, The flow-deviation algorithm: An approach to store-and-forward computer communication network design, Networks 3 (1973) 97-133.","journal-title":"Networks"},{"key":"407332_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","volume":"25","author":"R. Gallager","year":"1977","unstructured":"R. Gallager, A minimum delay routing algorithm using distributed computation, IEEE Transactions on Communications 25 (1977) 73-85.","journal-title":"IEEE Transactions on Communications"},{"key":"407332_CR8","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/TCOM.1983.1095752","volume":"31","author":"B. Gavish","year":"1983","unstructured":"B. Gavish and S. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Transactions on Communications 31 (1983) 1154-1161.","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"407332_CR9","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/26.20116","volume":"37","author":"B. Gavish","year":"1989","unstructured":"B. Gavish and I. Neuman, A system for routing and capacity assignment in computer communication networks, IEEE Transactions on Communications 37(4) (1989) 360-366.","journal-title":"IEEE Transactions on Communications"},{"issue":"7","key":"407332_CR10","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/26.153370","volume":"40","author":"B. Gavish","year":"1992","unstructured":"B. Gavish and I. Neuman, Routing in a network in unreliable components, IEEE Transactions on Communications 40(7) (1992) 1248-1258.","journal-title":"IEEE Transactions on Communications"},{"key":"407332_CR11","unstructured":"J. Goldman, Applied Data Communications: A Business-Oriented Approach, 2nd Ed. (Wiley, 1998)."},{"key":"407332_CR12","unstructured":"N. Keon, Pricing for multiple services in guaranteed quality of service telecommunications networks, Ph.D. dissertation, Systems Engineering Department, University of Pennsylvania (2000)."},{"key":"407332_CR13","unstructured":"L. Kleinrock, Queuing Systems, 2: Computer Applications (Wiley, 1976)."},{"key":"407332_CR14","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1109\/26.58755","volume":"38","author":"L. LeBlanc","year":"1990","unstructured":"L. LeBlanc, Design and operation of packet-switched networks with uncertain message requirements, IEEE Transactions on Communications 38 (1990) 1223-1230.","journal-title":"IEEE Transactions on Communications"},{"key":"407332_CR15","volume-title":"Mathematical programming algorithms for large-scale network equilibrium and network design problems","author":"L. LeBlanc","year":"1973","unstructured":"L. LeBlanc, Mathematical programming algorithms for large-scale network equilibrium and network design problems, Ph.D. dissertation, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL (1973)."},{"issue":"4","key":"407332_CR16","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1287\/trsc.15.4.306","volume":"15","author":"L. LeBlanc","year":"1981","unstructured":"L. LeBlanc and K. Farhangian, Efficient algorithms for solving elastic demand traffic assignment problems and mode split-assignment problems, Transportation Science 15(4) (1981) 306-317.","journal-title":"Transportation Science"},{"key":"407332_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/trsc.19.4.445","volume":"19","author":"L. LeBlanc","year":"1985","unstructured":"L. LeBlanc, R. Helgason and D. Boyce, Improved efficiency of the Frank-Wolfe algorithm for convex network programs, Transportation Science 19 (1985) 445-462.","journal-title":"Transportation Science"},{"key":"407332_CR18","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1016\/0169-7552(94)90021-3","volume":"26","author":"L. LeBlanc","year":"1994","unstructured":"L. LeBlanc and S. Narasimhan, Topological expansion of metropolitan area networks, Computer Networks and ISDN Systems 26 (1994) 1235-1248.","journal-title":"Computer Networks and ISDN Systems"},{"key":"407332_CR19","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/ijoc.11.2.188","volume":"11","author":"L. LeBlanc","year":"1999","unstructured":"L. LeBlanc, J. Chifflet and P. Mahey, Packet routing in telecommunication networks with path and flow restrictions, INFORMS Journal on Computing 11 (1999) 188-197.","journal-title":"INFORMS Journal on Computing"},{"key":"407332_CR20","unstructured":"H. Luna, P. Mahey, A. Ouorou and J. Chifflet, Multicommodity flows with price sensitive demands, in: Proceedings of the 5th International Conference on Telecommunication Systems Modeling and Analysis, Nashville, Tennessee (March 1997) pp. 583-593."},{"key":"407332_CR21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<227::AID-NET3>3.0.CO;2-F","volume":"31","author":"P. Mahey","year":"1998","unstructured":"P. Mahey, A. Ouorou, L. LeBlanc and J. Chifflet, A new proximal decomposition algorithm for routing in telecommunication networks, Networks 31 (1998) 227-238.","journal-title":"Networks"},{"key":"407332_CR22","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0169-7552(88)90048-7","volume":"15","author":"S. Narasimhan","year":"1988","unstructured":"S. Narasimhan, H. Pirkul and P. De, Route selection in backbone data communication networks, Computer Networks and ISDN Systems 15 (1988) 121-133.","journal-title":"Computer Networks and ISDN Systems"},{"key":"407332_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02094331","volume":"36","author":"I. Neuman","year":"1992","unstructured":"I. Neuman, A system for priority routing and capacity assignment in packet-switched networks, Annals of Operations Research 36 (1992) 225-246.","journal-title":"Annals of Operations Research"},{"key":"407332_CR24","volume-title":"Working Paper","author":"I. Neuman","year":"1989","unstructured":"I. Neuman, Class-dependent routing in backbone computer networks, Working Paper 131, Center for Research on Information Systems, New York University, New York, NY (1989)."},{"issue":"1","key":"407332_CR25","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/ijoc.6.1.50","volume":"6","author":"H. Pirkul","year":"1994","unstructured":"H. Pirkul and S. Narasimhan, Primary and secondary route selection in backbone computer networks, ORSA Journal on Computing 6(1) (1994) 50-60.","journal-title":"ORSA Journal on Computing"},{"key":"407332_CR26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01586091","volume":"32","author":"J.E. Spingarn","year":"1985","unstructured":"J.E. Spingarn, Applications of the method of partial inverse to convex programming decomposition, Math. Prog. 32 (1985) 199-223.","journal-title":"Math. Prog."}],"container-title":["Information Technology and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015546212618.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015546212618\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015546212618.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:23:41Z","timestamp":1748856221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015546212618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["407332"],"URL":"https:\/\/doi.org\/10.1023\/a:1015546212618","relation":{},"ISSN":["1385-951X","1573-7667"],"issn-type":[{"type":"print","value":"1385-951X"},{"type":"electronic","value":"1573-7667"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}