{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:31:28Z","timestamp":1672965088553},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0169-7552(98)00259-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:57:10Z","timestamp":1027637830000},"page":"429-443","source":"Crossref","is-referenced-by-count":4,"title":["Convergence routing on disjoint spanning trees"],"prefix":"10.1016","volume":"31","author":[{"given":"B\u00fclent","family":"Yener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Ofek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0169-7552(98)00259-1_BIB1","doi-asserted-by":"crossref","unstructured":"P. Baran, On distributed communication networks, IEEE Trans. Communications Systems CS-12 (1-2) (March 1964) 1\u20139.","DOI":"10.1109\/TCOM.1964.1088883"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB2","unstructured":"B. Bollab\u00e1s, A. Thomason, Random graphs of small order, Annal. Discrete Mathematics 28 (1985) 47\u201397."},{"key":"10.1016\/S0169-7552(98)00259-1_BIB3","doi-asserted-by":"crossref","unstructured":"W. Bux, F.H. Closs, K. Kummerle H.J. Keller, H.R. Mueller, Architecture and design of a reliable token-ring network, IEEE J. Selected Areas in Comm. SAC-1 (5) (November 1983) 756\u2013765.","DOI":"10.1109\/JSAC.1983.1146004"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB4","doi-asserted-by":"crossref","unstructured":"S.M. Chase, An implemented algorithm for winning shannon switching games, Commn. ACM 15 (1972) 253\u2013256.","DOI":"10.1145\/361284.361293"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB5","doi-asserted-by":"crossref","unstructured":"J. Chen, I. Cidon, Y. Ofek, A local fairness algorithm for gigabit LANs\/MANs with spatial reuse, IEEE J. Selected Areas in Comm. 11 (8) (October 1993) 1183\u20131192.","DOI":"10.1109\/49.245907"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB6","doi-asserted-by":"crossref","unstructured":"I. Cidon, Y. Ofek, Meta Ring \u2013 a full-duplex ring with fairness and spatial reuse, IEEE Trans. Comm. COM-41 (1) (January 1993) 110\u2013120.","DOI":"10.1109\/26.212370"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB7","unstructured":"J. Edmonds, Edge disjoint branchings, in: R. Rustin (Ed.), Combinatorial Algorithms, 1972, pp. 91\u201396."},{"key":"10.1016\/S0169-7552(98)00259-1_BIB8","doi-asserted-by":"crossref","unstructured":"W.D. Farmer, E.E. Newhall, An experimental distributed switching system to handle bursty computer traffic, Proc. ACM Symp. on Problems in Optimization of Data Communicartion Systems, 1969, pp. 1\u201333.","DOI":"10.1145\/800165.805237"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB9","doi-asserted-by":"crossref","unstructured":"G. Kishi, Y. Kajitani, Maximally distant trees and principal partition of a linear graph, IEEE Trans. Circuit Theory CT-16 (1969) 323\u2013330.","DOI":"10.1109\/TCT.1969.1082966"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB10","doi-asserted-by":"crossref","unstructured":"H. Gabow, Forests, frames, and games: Algorithms for matroid sum and applications, Algorithmica 7 (1992) 465\u2013497.","DOI":"10.1007\/BF01758774"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB11","doi-asserted-by":"crossref","unstructured":"T. Kameda, S. Toida, Efficient algorithms for determining and extermal tree of a graph, Proc. 14th Annual IEEE Symp. on Switching and Automata Theory, 1973, pp. 12\u201315.","DOI":"10.1109\/SWAT.1973.6"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB12","doi-asserted-by":"crossref","unstructured":"A. Lehman, A solution to Shannon switching game, SIAM J. Appl. Math. 12 (1964) 687\u2013725.","DOI":"10.1137\/0112059"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB13","doi-asserted-by":"crossref","unstructured":"N.F. Maxemchuk, Routing in the manhattan street network, IEEE Trans. Comm. COM-35 (5) (May 1987) 503\u2013512.","DOI":"10.1109\/TCOM.1987.1096802"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB14","doi-asserted-by":"crossref","unstructured":"R.M. Metcalfe, D.R. Boggs, Ethernet: Distributed packet switching for lacal computer networks, Comm. ACM 19 (7) (July 1976) 395\u2013404.","DOI":"10.1145\/360248.360253"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB15","doi-asserted-by":"crossref","unstructured":"H. Nagamochi, T. Ibaraki, A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica (1992) 583\u2013596.","DOI":"10.1007\/BF01758778"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB16","doi-asserted-by":"crossref","unstructured":"Y. Ofek, Overview of the MetaRing architecture, Computer Networks and ISDN Systems 26 (6\u20138) (1994) 817\u2013830.","DOI":"10.1016\/0169-7552(94)90047-7"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB17","doi-asserted-by":"crossref","unstructured":"Y. Ofek, B. Yener, M. Yung, Concurrent asynchronous broadcast on the metanet, IEEE Trans. Comput. C-46 (7) (July 1997) 737\u2013748.","DOI":"10.1109\/12.599894"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB18","doi-asserted-by":"crossref","unstructured":"Y. Ofek, M. Yung, Efficient mechanism for fairness and deadlock-avoidance in high-speed networks, 4th Int. Workshop on Distributed Algorithms, September 1990, pp. 192\u2013212.","DOI":"10.1007\/3-540-54099-7_14"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB19","doi-asserted-by":"crossref","unstructured":"Y. Ofek, M. Yung, Principles for high speed network control: lossless-ness and deadlock-freeness, self-routing and a single buffer per link, 9th Annual ACM Symp. on Principles of Distributed Computing (PODC), August 1990, pp. 161\u2013175.","DOI":"10.1145\/93385.93414"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB20","unstructured":"Y. Ofek, M. Yung, The integrated Meta Net architecture: A switch-based multimedia LAN for parallel computing and real-time traffic, IEEE INFOCOM'94, 1994."},{"key":"10.1016\/S0169-7552(98)00259-1_BIB21","doi-asserted-by":"crossref","unstructured":"Y. Ofek, M. Yung, METANET: Principles of an arbitrary topology LAN, IEEE Trans. Networking 3 (2) (April 1995) 169\u2013180.","DOI":"10.1109\/90.374118"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB22","doi-asserted-by":"crossref","unstructured":"T. Ohtsuki, Y. Ishizaki, H. Watanabe, Topological degrees of freedom and mixed analysis of electrical networks, IEEE Trans. Circuit Theory CT-17 (1970) 491\u2013499.","DOI":"10.1109\/TCT.1970.1083186"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB23","doi-asserted-by":"crossref","unstructured":"P. Eppstein, Z. Galil, G.F. Italiano, A. Nissenzweig, Sparsification \u2013 a technique for speeding up dynamic graph algorithms, IEEE FOCS'92, vol. 24, 1992, pp. 60\u201370.","DOI":"10.1109\/SFCS.1992.267818"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB24","doi-asserted-by":"crossref","unstructured":"Y. Shiloach, Edge-disjoint branching in directed multigraphs, Inform. Process. Lett. 8 (1979) 24\u201327.","DOI":"10.1016\/0020-0190(79)90086-3"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB25","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, A good algorithm for edge-disjoint branching, Inform. Process. Lett. 3 (1974) 51\u201353.","DOI":"10.1016\/0020-0190(74)90024-6"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB26","doi-asserted-by":"crossref","unstructured":"B. Yener, S. Matsoukas and Y. Ofek, Iterative approach to optimize convergence routing priorities, IEEE\/ACM Trans. Networking 5 (4) (1997) 530\u2013543.","DOI":"10.1109\/90.649468"},{"key":"10.1016\/S0169-7552(98)00259-1_BIB27","doi-asserted-by":"crossref","unstructured":"B. Yener, Y. Ofek, M. Yung, Configuration and performance issues in the Meta Net design, IEEE 18th Conf. on Local Computer Networks, September 1993.","DOI":"10.1109\/LCN.1993.591236"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169755298002591?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169755298002591?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T01:07:41Z","timestamp":1580864861000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169755298002591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0169755298002591"],"URL":"https:\/\/doi.org\/10.1016\/s0169-7552(98)00259-1","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}