{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:10:09Z","timestamp":1763201409958},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729891"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72990-7_10","type":"book-chapter","created":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T16:23:08Z","timestamp":1188663788000},"page":"65-76","source":"Crossref","is-referenced-by-count":1,"title":["Recovery, Routing and Load Balancing Strategy for an IP\/MPLS Network"],"prefix":"10.1007","author":[{"given":"Eligijus","family":"Kubilinskas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faisal","family":"Aslam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateusz","family":"Dzida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pi\u00f3ro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Gruber, C.G., Koster, A.M., Orlowski, S., Wess\u00e4ly, R., Zymolka, A.: A new model and computational study for demand-wise shared protection. Technical Report ZIB-Report 05-55, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Berlin-Dahlem, Germany (2005)"},{"key":"10_CR2","unstructured":"Jain, V., Alagar, S., Baig, S.I., Venkatesan, S.: Optimal quasi-path restoration in telecom backbone networks. In: 13th International Conference on System Engineering, Las Vegas, USA, CS\u2013175\u2013CS\u2013180 (1999)"},{"key":"10_CR3","unstructured":"Patel, M., Chandrasekaran, R., Venkatesan, S.: Improved quasi-path restoration scheme and spare capacity assignment in mesh networks. Technical Report UTDCS-14-03, University of Texas at Dallas, Richardson, TX, USA (2003)"},{"issue":"5","key":"10_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/90.958325","volume":"9","author":"G. Mohan","year":"2001","unstructured":"Mohan, G., Murthy, C.S.R., Somani, A.K.: Efficient algorithms for routing dependable connections in WDM optical networks. IEEE\/ACM Transactions on Networking\u00a09(5), 553\u2013566 (2001)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10_CR5","unstructured":"Fredric, M.T., Somani, A.K.: A single-fault recovery strategy for optical networks using subgraph routing. In: 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM-2003), Budapest, Hungary (2003)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Ramasubramanian, S.: On failure dependent protection in optical grooming networks. In: International Conference on Dependable Systems and Networks (DSN\u201904), Florence, Italy, pp. 440\u2013449 (2004)","DOI":"10.1109\/DSN.2004.1311917"},{"key":"10_CR7","unstructured":"Kubilinskas, E., Aslam, F., Dzida, M., Pi\u00f3ro, M.: Network protection by single and failure-dependent backup paths\u2013modeling and efficiency comparison. In: 4th Polish-German Teletraffic Symposium (PGTS 2006), Wroclaw, Poland (2006)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Patel, M., Chandrasekaran, R., Venkatesan, S.: A comparative study of restoration schemes and spare capacity assignment in mesh networks. In: The 12th International Conference on Computer Communications and Networks (ICCCN 2003), pp. 399\u2013404. Dallas, TX, USA (2003)","DOI":"10.1109\/ICCCN.2003.1284200"},{"key":"10_CR9","volume-title":"Routing, Flow and Capacity Design in Communication and Computer Networks","author":"M. Pi\u00f3ro","year":"2004","unstructured":"Pi\u00f3ro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, San Francisco (2004)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Kodialam, M.S., Lakshman, T.V.: Minimum interference routing with applications to MPLS traffic engineering. In: Proc. of INFOCOM\u00a02, pp. 884\u2013893 (2000)","DOI":"10.1109\/INFCOM.2000.832263"},{"key":"10_CR11","unstructured":"Pi\u00f3ro, M., Dzida, M., Kubilinskas, E., Nilsson, P., Ogryczak, W., Tomaszewski, A., Zago\u017cd\u017con, M.: Applications of the max-min fairness principle in telecommunication network design. In: First Conference on Next Generation Internet Networks Traffic Engineering (NGI 2005), Rome, Italy (2005)"},{"key":"10_CR12","first-page":"2006","volume":"49","author":"F. Kelly","year":"1997","unstructured":"Kelly, F., Mauloo, A., Tan, D.: Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operations Research Society\u00a049, 2006\u20132017 (1997)","journal-title":"Journal of the Operations Research Society"},{"key":"10_CR13","unstructured":"Kubilinskas, E., Pi\u00f3ro, M., Nilsson, P.: Design models for multi-layer next generation Internet core networks carrying elastic traffic. In: Proc. 4th International Workshop on the Design of Reliable Communication Networks (DRCN 2003), Banff, Canada (2003)"},{"key":"10_CR14","unstructured":"Advanced CSPF Simulator, \n                    \n                      http:\/\/suraj.lums.edu.pk\/~te\/code.htm"}],"container-title":["Lecture Notes in Computer Science","Managing Traffic Performance in Converged Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72990-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:53:03Z","timestamp":1619502783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72990-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729891"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72990-7_10","relation":{},"subject":[]}}