{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T21:31:21Z","timestamp":1700256681729},"reference-count":21,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5337,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In virtual circuit networks, all the packets in a session are transmitted over exactly one path established between the origin and the destination. For each origin\u2013destination pair, it is assumed that there are multiple sessions. We consider the problem of choosing a path for each session so as to minimize the average packet delay in the network. We formulate this problem as a nonlinear multicommodity flow problem with integer decision variables. An iterative scheme that is similar to local search is developed to solve this problem. In each iteration, we apply Lagrangean relaxation and a multiplier adjustment procedure to solve a restricted problem. We show that the Lagrangean dual problem can be solved exactly by solving a convex program. In computational experiments, our algorithm determines solutions that are within 1% of an optimal solution in minutes of CPU time for networks with 26\u201361 nodes. In addition, we show that our proposed algorithm is better both theoretically and computationally than K(0)\u2010ordering, single\u2010path routing, or round\u2010off Frank\u2013Wolfe heuristics.<\/jats:p>","DOI":"10.1002\/net.3230220205","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:18:06Z","timestamp":1178972286000},"page":"185-208","source":"Crossref","is-referenced-by-count":17,"title":["A routing algorithm for virtual circuit data networks with multiple sessions per O\u2014D pair"],"prefix":"10.1002","volume":"22","author":[{"given":"James R.","family":"Yee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank Y. S.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Nonlinear Programming: Theory and Algorithm","author":"Bazaraa M. S.","year":"1979"},{"key":"e_1_2_1_3_2","unstructured":"D. P.Bertsekas A class of optimal routing algorithms for communications networks.Proceedings of the 1980 International Conference on Circuits and Computers Atlanta GA (November1980)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096159"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223806"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(81)90016-X"},{"key":"e_1_2_1_7_2","unstructured":"A.Danet R.Despres A. L.Rest G.Pichon andS.Ritzenthaler The French public packet switching service: The TRANSPAC network.Proceeding of the Third International Computer Communication Conference(1976)251\u2013260."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030202"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095752"},{"key":"e_1_2_1_11_2","unstructured":"M.Gerla Routing and flow control in ISDN's.Proceedings of the 1986 ICCC(1986)643\u2013647."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1147\/sj.182.0263"},{"key":"e_1_2_1_13_2","volume-title":"Functional Description of GTE Telenet Packet Switching Networks","year":"1982"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580223"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094697"},{"key":"e_1_2_1_16_2","volume-title":"Queueing Systems","author":"Kleinrock L.","year":"1975"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"Y. S.LinandJ. R.Yee A distributed routing algorithm for virtual circuit data networks.Proceedings 1989 INFOCOM(1989)200\u2013207.","DOI":"10.1109\/INFCOM.1989.101453"},{"key":"e_1_2_1_18_2","unstructured":"A.Rajaraman Routing in TYMNET.Proceedings of the European Computer Conference(1978)."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094274"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/9.8646"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1095020"},{"key":"e_1_2_1_22_2","unstructured":"J. Y.Yee Distributed Routing and Flow Control Algorithms for Communication Networks. PhD Thesis Massachusetts Institute of Technology (December1985)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T20:12:37Z","timestamp":1698091957000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1002\/net.3230220205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}