{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:20Z","timestamp":1725492380172},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423034"},{"type":"electronic","value":"9783540477341"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47734-9_52","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:08:18Z","timestamp":1191719298000},"page":"527-537","source":"Crossref","is-referenced-by-count":4,"title":["Virtual Path Layout in ATM Path with Given Hop Count"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Choplin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","volume-title":"Technical Report UM-CS-1997-036","author":"W. Aiello","year":"1997","unstructured":"W. Aiello, S. N. Bhatt, F. R. K. Chung, A. L. Rosenber, and R. K. Sitaraman. Augmented ring networks. Technical Report UM-CS-1997-036, University of Massachusetts, Amherst, Computer Science, June, 1997."},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Becchetti and Gaibisso. Lower bounds for the virtual path layout problem in ATM networks. In Theory and Practice of Informatics, Seminar on Current Trends in Theory and Practice of Informatics, LNCS, volume 24. 1997.","DOI":"10.1007\/3-540-63774-5_116"},{"key":"52_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0056475","volume-title":"Proc. of the 12th International Conference on Distributed Computing, Andros Greece","author":"J.-C. Bermond","year":"1998","unstructured":"J-C. Bermond, N. Marlin, D. Peleg, and S. Perennes. Directed Virtual Path layout in ATM networks. In Proc. of the 12 th International Conference on Distributed Computing, Andros Greece, 1998. LNCS 1499, pages 75\u201388."},{"key":"52_CR4","unstructured":"J-C. Bermond, N. Marlin, D. Peleg, and S. Perennes. Virtual Paths Layout with Low Congestion or Low Diameter in ATM Networks. In 1\u00e9re rencontre francophone\u2026 ALGOTEL\u2019 99, Mai 1999."},{"key":"52_CR5","unstructured":"Pascal Chanas. Dimensionnement de r\u00e9seaux ATM. PhD thesis, CNET Sophia, Sept. 1998."},{"key":"52_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/3-540-63165-8_208","volume-title":"24th International Colloquium on Automata, Languages and Programming (ICALP)","author":"T. Eilam","year":"1997","unstructured":"T. Eilam, M. Flammini, and S. Zaks. A complete characterization of the path layout construction problem for ATM networks with given hop count and load. In 24th International Colloquium on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Computer Science, pages 527\u2013537. Springer-Verlag, 1997."},{"key":"52_CR7","unstructured":"M. Feighlstein and S. Zaks. Duality in chain ATM virtual path layouts. In 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Monte Verita, Ascona, Switzerland, July 1997."},{"key":"52_CR8","unstructured":"G. Gauyacq. Routages uniformes duns les graphes sommet-transitifs. PhD thesis, Universit\u00e9 Bordeaux I, 1995."},{"issue":"6","key":"52_CR9","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/90.556344","volume":"4","author":"O. Gerstel","year":"1996","unstructured":"O. Gerstel, I. Cidon, and S. Zaks. The layout of virtual paths in ATM networks. IEEE\/ACM Transactions on Networking, 4(6):873\u2013884, 1996.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"52_CR10","unstructured":"Ornan Gerstel, Israel Cidon, and Shmuel Zaks. Optimal Virtual Path Layout in ATM Networks with Shared Routing Table Switches. Chicago Journal of Theoretical Computer Science, 1996(3), October 1996."},{"key":"52_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1007\/3-540-60313-1_167","volume-title":"3rd Annual European Symposium on Algorithms","author":"O. Gerstel","year":"1995","unstructured":"O. Gerstel, A. Wool, and S. Zaks. Optimal Layouts on a Chain ATM Network. In 3rd Annual European Symposium on Algorithms, volume LNCS 979, pages 508\u2013522. Springer Verlag, 1995."},{"key":"52_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1007\/3-540-60313-1_167","volume-title":"3rd Annual European Symposium on Algorithms (ESA)","author":"O. Gerstel","year":"1995","unstructured":"O. Gerstel, A. Wool, and S. Zaks. Optimal layouts on a chain ATM network. In 3rd Annual European Symposium on Algorithms (ESA), (LNCS 979), Corfu, Greece, pages 508\u2013522, 1995. To appear in Discrete Applied Mathematics."},{"key":"52_CR13","first-page":"235","volume-title":"Symposium on Principles of Distributed Computing (PODC\u2019 94)","author":"O. Gerstel","year":"1994","unstructured":"Ornan Gerstel and Shmuel Zaks. The virtual path layout problem in fast networks. In Symposium on Principles of Distributed Computing (PODC\u2019 94), pages 235\u2013243, New York, USA, August 1994. ACM Press."},{"key":"52_CR14","unstructured":"D. Kofman and M. Gagnaire. R\u00e9tseaux haut debit, reseaux ATM, reseaux locaux et reseaux tout-optiques. InterEditions-Masson, 1998."},{"key":"52_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/S0129054197000100","volume":"8","author":"E. Kranakis","year":"1997","unstructured":"E. Kranakis, D. Krizanc, and A. Pelc. Hop-congestion trade-offs for high-speed networks. International Journal of Foundations of Computer Science, 8:117\u2013126, 1997.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"52_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","volume":"23","author":"J.-C. Meyer","year":"1989","unstructured":"J-C. Meyer, M-C. Heydemann, and D. Sotteau. On Forwarding indices of networks. Discrete Applied Mathematics 23:103\u2013123, 1989.","journal-title":"Discrete Applied Mathematics"},{"key":"52_CR17","unstructured":"M. De Pricker. Asynchronous Transfer Mode, Solution for Broadband ISDN. Prentice Hall, August 1995."},{"key":"52_CR18","unstructured":"L. Stacho and I. Vrt\u2019o. Virtual path layouts in atm networks. In Structure, Information and Communication Complexity, 3rd Colloquium, SIROCCO, pages 2699278. Carleton University Press, 1996."},{"key":"52_CR19","doi-asserted-by":"crossref","unstructured":"S. Zaks. Path Layout in ATM Networks \u2014 A Survey. In The DIMACS Workshop on Networks in Distributed Computing, DIMACS Center, Rutgers University, Oct. 1997. manuscript.","DOI":"10.1090\/dimacs\/045\/09"}],"container-title":["Lecture Notes in Computer Science","Networking \u2014 ICN 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47734-9_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:48:41Z","timestamp":1556884121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47734-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423034","9783540477341"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-47734-9_52","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}