{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T06:42:02Z","timestamp":1672814522628},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. T\u00e9l\u00e9commun."],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1007\/bf03002698","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T08:34:26Z","timestamp":1625646866000},"page":"150-168","source":"Crossref","is-referenced-by-count":0,"title":["Calcul des m\u00e9triques de routage pour Internet"],"prefix":"10.1007","volume":"56","author":[{"given":"W.","family":"Ben-Ameur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Liau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03002698_CR1","doi-asserted-by":"crossref","unstructured":"Alizadeh (F.), Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAMJournal on Optimization, (5) : pp. 13\u201351, 95.","DOI":"10.1137\/0805002"},{"issue":"1","key":"BF03002698_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/1097-0037(200008)36:1<17::AID-NET3>3.0.CO;2-Z","volume":"36","author":"(W.) Ben-Ameur","year":"2000","unstructured":"Ben-Ameur (W.), Constrained length connectivity and survivable networks,Networks, 36(1): pp. 17\u201333, 2000.","journal-title":"Networks"},{"key":"BF03002698_CR3","unstructured":"Ben-Ameur (W.), Multi-hour design of survivable internet networks,Submited to Telecommunication Systems, 2000."},{"key":"BF03002698_CR4","unstructured":"Ben-Ameur (W.) andGourdin (E.), Internet routing and related topology issues,Submited to SIAM J. Discrete Mathematics (presented inDRCN2000), 2000."},{"key":"BF03002698_CR5","unstructured":"Ben-Ameur (W.),Gourdin (E.),Liau (B.) andMichel (N.), Dimensioning of Internet networks, Inproceeding of DRCN2000, pp. 56\u201361, Munich, April. 2000."},{"key":"BF03002698_CR6","volume-title":"proc. Francoro 2","author":"(W.) Ben-Ameur","year":"98","unstructured":"Ben-Ameur (W.) andLiau (B.), Am\u00e9liorations de la m\u00e9thode de benders pour la synth\u00e8se de r\u00e9seaux s\u00e9curis\u00e9s, Inproc. Francoro 2, Sousse \u2014 Tunisie, Avril 98."},{"issue":"1","key":"BF03002698_CR7","first-page":"9","volume":"11","author":"(W.) Ben-Ameur","year":"1999","unstructured":"Ben-Ameur (W.) andNace (D.), M\u00e9thodes, techniques et strat\u00e9gies de reroutage pour les r\u00e9seaux de t\u00e9l\u00e9communication,Calculateurs Parall\u00e8les, R\u00e9seaux et Syst\u00e8mes R\u00e9partis, 11(1): pp. 9\u201335, 1999.","journal-title":"Calculateurs Parall\u00e8les, R\u00e9seaux et Syst\u00e8mes R\u00e9partis"},{"key":"BF03002698_CR8","unstructured":"Berge (C.),Theory of graphs and its applications. Mathnen, London."},{"key":"BF03002698_CR9","doi-asserted-by":"crossref","unstructured":"Burton (D.) andToint (Ph.-L.), On an instance of the inverse shortest paths problem.Mathematical Programming, (53) : pp. 45\u201361, 92.","DOI":"10.1007\/BF01585693"},{"key":"BF03002698_CR10","unstructured":"Crawley (E.),Nair (R.),Rajagopalan (R.) andSandick (H.), A framework for QoS-based routing in the internet,IETF Request for comments, (2386), 98."},{"key":"BF03002698_CR11","unstructured":"Diestel (R.),Graph theory, Springer, 1997."},{"issue":"3","key":"BF03002698_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"(S. E.) Dreyfus","year":"69","unstructured":"Dreyfus (S. E.), An appraisal of some shortest-path algorithms,Journal of O.R.S.A, 17(3): pp. 395\u2013412, 69.","journal-title":"Journal of O.R.S.A"},{"key":"BF03002698_CR13","unstructured":"Farago (A.),Szentesi (A.) andSzviatovszki (B.), Allocation of administrative weights in PNNI, InProc. Networks 98, pp. 621\u2013625, Italy, oct 1998."},{"key":"BF03002698_CR14","unstructured":"Geffard (G.) andOudheusten (V.), Multiflots monorout\u00e9s par programmation lin\u00e9aire en 0 \u2014 1, Technical report, Centre National \u010f\u00c9tudes des t\u00e9l\u00e9communications, 1999. de\/dac\/oat\/16.99."},{"key":"BF03002698_CR15","unstructured":"Girard (A.),Routing and Dimensioning in Circuit-smitched Networks, 1990."},{"key":"BF03002698_CR16","unstructured":"Gondran (M.) andMinoux (M.),Graphes et algorithmes. Eyrolles, 1995."},{"key":"BF03002698_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"(M.) Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel (M.), Lovasz (L.) andSchrijver (A.), The ellipsoid method and its consequences in combinatorial optimization,Combinatorica, 1: pp. 169\u2013197, 1981.","journal-title":"Combinatorica"},{"key":"BF03002698_CR18","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel (M.),Lovasz (L.) andSchrijver (A.),Geometric Algorithms and combinatorial optimization, Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"BF03002698_CR19","unstructured":"Hedrick (C.), Routing information protocol,IETF Request for comments, (1058), 88."},{"key":"BF03002698_CR20","unstructured":"Huitema (C.),Le routage dans \u013eInternet, Eyrolles, 1995."},{"key":"BF03002698_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"(N.) Katoh","year":"1982","unstructured":"Katoh (N.), Ibaraki (T.) andMine (H.), An efficient algorithm for K shortest simple paths,Networks, 12: pp. 411\u2013427, 1982.","journal-title":"Networks"},{"issue":"6","key":"BF03002698_CR22","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/90.748088","volume":"6","author":"(D.) Lorenz","year":"1998","unstructured":"Lorenz (D.) andOrda (A.), QoS routing in networks with uncertain parameters,IEEE\/ACM Transactions on Networking, 6(6): pp. 768\u201377S, 1998.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"BF03002698_CR23","volume-title":"Francoro 2","author":"(J.L.) Lutton","year":"98","unstructured":"Lutton (J.L.) andGeffard (J.), Dimensionnement de r\u00e9seaux s\u00e9curis\u00e9s, InFrancoro 2, Sousse \u2014 Tunisie, Avril 98."},{"issue":"5","key":"BF03002698_CR24","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1145\/174147.169748","volume":"40","author":"(A.J.) Marie","year":"1993","unstructured":"Marie (A.J.) andG\u00fbN (L.), Parallel queues with resquencing.Journal of the ACM, 40 (5): pp. 1188\u20131208, Nov 1993.","journal-title":"Journal of the ACM"},{"key":"BF03002698_CR25","unstructured":"Minoux (M.),Programmation Math\u00e9matique-Th\u00e9orie et Algorithmes, Dunod, 1983."},{"key":"BF03002698_CR26","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"(M.) Minoux","year":"1989","unstructured":"Minoux (M.), Network synthesis and optimum network design problems: Models, solution methods and applications,Networks, 19: pp. 313\u2013360, 1989.","journal-title":"Networks"},{"key":"BF03002698_CR27","unstructured":"Moy. (J.), ospf version 2,IETF Request for comments, (1583), 94."},{"key":"BF03002698_CR28","doi-asserted-by":"crossref","unstructured":"Nemhauser (G.L.) andWolsey (L.A.),Integer and Combinatorial Optimization, Wiley, 1988.","DOI":"10.1002\/9781118627372"},{"key":"BF03002698_CR29","unstructured":"Oran (D.), osi is-is intra-domain routing protocol,IETF Request for comments, (1142), 90."},{"key":"BF03002698_CR30","doi-asserted-by":"crossref","unstructured":"Park (K.),Kang (S.) andPark (S.), An integer programming approach to the bandwidth packing problem,Management Science, 42(9), 96.","DOI":"10.1287\/mnsc.42.9.1277"},{"issue":"5","key":"BF03002698_CR31","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/90.649563","volume":"5","author":"(V.) Paxson","year":"1997","unstructured":"Paxson (V.), End-to-end routing behavior in the internet.IEEE\/ACM Transactions on Networking, 5(5): pp. 601\u2013615, Oct 1997.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"BF03002698_CR32","unstructured":"Peterson (L.) andDavie (B.),Computer Networks \u2014 A Systems Approach, Morgan Kaufmann, 2000."},{"key":"BF03002698_CR33","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TCOM.1980.1094690","volume":"28","author":"(M.) Schwartz","year":"1980","unstructured":"Schwartz (M.) andStern (T.), Routing techniques used in computer communication networks,IEEE Trans. on Communications, COM-28: pp. 539\u2013552, 1980.","journal-title":"IEEE Trans. on Communications, COM"},{"key":"BF03002698_CR34","unstructured":"Villamizar (C.), mpls optimized multipath (mpls \u2014 omp),IETF draft, 99."},{"issue":"7","key":"BF03002698_CR35","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"(Z.) Wang","year":"1996","unstructured":"Wang (Z.) andCrowcroft (J.), Quality-of-service routing for supporting multimedia applications,IEEE J. on Selected Arens in Communications, 14(7): pp. 1228\u20131234, 1996.","journal-title":"IEEE J. on Selected Arens in Communications"},{"key":"BF03002698_CR36","doi-asserted-by":"crossref","unstructured":"Yen (J.Y.), Finding the K shortest loopless paths in a network,Management Science, (17): pp. 712\u2013716, 71.","DOI":"10.1287\/mnsc.17.11.712"}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03002698.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF03002698\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03002698.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T05:43:23Z","timestamp":1672724603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF03002698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":36,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["BF03002698"],"URL":"https:\/\/doi.org\/10.1007\/bf03002698","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}