{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:46:45Z","timestamp":1744436805424},"reference-count":26,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(98)80002-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"157-178","source":"Crossref","is-referenced-by-count":13,"title":["Optimal layouts on a chain ATM network"],"prefix":"10.1016","volume":"83","author":[{"given":"Ornan (Ori)","family":"Gerstel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avishai","family":"Wool","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)80002-4_BIB1","series-title":"IEEE Infocom'94","first-page":"192","article-title":"Virtual path layout design on ATM networks","author":"Ahn","year":"1994"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB2","series-title":"21st Symposium on Theory of Computing","first-page":"479","article-title":"Compact distributed data structures for adaptive routing","author":"Awerbuch","year":"1989"},{"issue":"2","key":"10.1016\/S0166-218X(98)80002-4_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0405013","article-title":"Routing with polynomial communication-space tradeoff","volume":"5","author":"Awerbuch","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(98)80002-4_BIB4","first-page":"111","article-title":"Trade-offs in non-reversing diameter","volume":"1","author":"Bodlaender","year":"1994","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0166-218X(98)80002-4_BIB5","article-title":"Broadband ISDN resource management: the role of, virtual paths","volume":"29","author":"Burgin","year":"1991","journal-title":"IEEE Common. Mag."},{"key":"10.1016\/S0166-218X(98)80002-4_BIB6","series-title":"The 8th International Workshop on Distributed Algorithms (LNCS 857)","first-page":"209","article-title":"A scalable approach to routing in ATM network","author":"Cidon","year":"1994"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB7","series-title":"IEEE Infocom'94","first-page":"184","article-title":"Connection management and rerouting in ATM networks","author":"Cohen","year":"1994"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB8","series-title":"27th Symposium on Foundations of Computer Science","first-page":"428","article-title":"Separator-based strategies for efficient message routing","author":"Frederickson","year":"1986"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","article-title":"Designing networks with compact routing tables","volume":"3","author":"Frederickson","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB10","article-title":"Virtual path design in ATM networks","author":"Gerstel","year":"1995"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB11","series-title":"IEEE Infocom'95","first-page":"330","article-title":"Dynamic maintenance of the virtual path layout","author":"Gerstel","year":"1995"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB12","series-title":"The 3rd Annual European Symposium on Algorithms (LNCS 979)","first-page":"508","article-title":"Optimal layouts on a chain ATM network","author":"Gerstel","year":"1995"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB13","series-title":"The 13th ACM Symp. on Principles of Distributed Computing","first-page":"235","article-title":"The virtual path layout problem in fast networks","author":"Gerstel","year":"1994"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB14","article-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB15","article-title":"Integrated Broadband networks: an Introduction to ATM-based networks","author":"H\u00e4ndler"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB16","unstructured":"ITU recommendation, I series (B-ISDN), Blue Book, November 1990."},{"key":"10.1016\/S0166-218X(98)80002-4_BIB17","first-page":"155","article-title":"Hierarchical routing for large networks; performance evaluation and optimization","volume":"1","author":"Kleinrock","year":"1977","journal-title":"Comput. Networks"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB18","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230100305","article-title":"Optimal clustering structures for hierarchical topological design of large computer networks","volume":"10","author":"Kleinrock","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB19","article-title":"The Art of Computer Programming","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB20","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB21","series-title":"IEEE Globecom'93","first-page":"436","article-title":"Virtual path assignment and virtual circuit routing in ATM networks","author":"Lin","year":"1993"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB22","series-title":"Gigabit Networking","author":"Partridge","year":"1994"},{"key":"10.1016\/S0166-218X(98)80002-4_BIB23","series-title":"20th Symposium on Theory of Computing","first-page":"43","article-title":"A tradeoff between space and efficiency for routing tables","author":"Peleg","year":"1985"},{"issue":"8","key":"10.1016\/S0166-218X(98)80002-4_BIB24","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/26.58754","article-title":"Broad-band ATM network architecture based on virtual paths","volume":"38","author":"Sato","year":"1990","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0166-218X(98)80002-4_BIB25","doi-asserted-by":"crossref","DOI":"10.1109\/49.64909","article-title":"Virtual path and link capacity design for ATM networks","volume":"9","author":"Sato","year":"1991","journal-title":"IEEE J. Selected Areas Commun."},{"key":"10.1016\/S0166-218X(98)80002-4_BIB26","series-title":"4th Int. Colloq. on Structural Information and Communication Complexity","article-title":"Duality in chain ATM virtual path layouts","author":"Feighelstein","year":"1997"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98800024?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98800024?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:51:22Z","timestamp":1556131882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98800024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X98800024"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)80002-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}