{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:01:35Z","timestamp":1648638095443},"reference-count":25,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T00:00:00Z","timestamp":1308096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"DOI":"10.1007\/s11235-011-9506-4","type":"journal-article","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T06:05:17Z","timestamp":1308117917000},"source":"Crossref","is-referenced-by-count":0,"title":["Stock provisioning strategies for QoS at the interdomain level"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loubna","family":"Echabbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chahinez","family":"Hamlaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,15]]},"reference":[{"key":"9506_CR1","unstructured":"Barth, D., Echabbi, L., Hamlaoui, C., & Vial, S. (2005). An economic and algorithmic model for qos provisioning bgp interdomain network. In EuroNGI workshop on QoS and traffic control."},{"key":"9506_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/SFCS.2000.892069","volume-title":"IEEE symposium on foundations of computer science","author":"T. Roughgarden","year":"2000","unstructured":"Roughgarden, T., & Tardos, E. (2000). How bad is selfish routing? In IEEE symposium on foundations of computer science (pp.\u00a093\u2013102). [Online]. Available: citeseer.ist.psu.edu\/roughgarden01how.html ."},{"key":"9506_CR3","unstructured":"Correa, J. R., Schulz, A. S., & Stier-Moses, N. E. (2004). Selfish routing in capacitated networks (pp.\u00a0961\u2013976). Nov. 2004. [Online]. Available: citeseer.ist.psu.edu\/correa03selfish.html ."},{"key":"9506_CR4","unstructured":"Czumaj, A., Krysta, P., & Vocking, B. (2002). Selfish traffic allocation for server farms. In 34th ACM symp. on theory of computing (STOC \u201902). [Online]. Available: citeseer.ist.psu.edu\/article\/czumaj02selfish.html ."},{"key":"9506_CR5","unstructured":"Czumaj, A., & Vocking, B. (2002). Tight bounds for worst-case equilibria. [Online]. Available: citeseer.ist.psu.edu\/article\/czumaj02tight.html ."},{"key":"9506_CR6","first-page":"404","volume-title":"Lecture notes in computer science","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In Lecture notes in computer science (Vol.\u00a01563, pp.\u00a0404\u2013413). Berlin: Springer. [Online]. Available: citeseer.ist.psu.edu\/koutsoupias99worstcase.html ."},{"key":"9506_CR7","unstructured":"Roughgarden, T. (2002). The price of anarchy is independent of the network topology. In 34th ACM symposium on the theory of computing. [Online]. Available: citeseer.ist.psu.edu\/roughgarden02price.html ."},{"key":"9506_CR8","first-page":"104","volume-title":"ACM symposium on theory of computing","author":"T. Roughgarden","year":"2001","unstructured":"Roughgarden, T. (2001). Stackelberg scheduling strategies. In ACM symposium on theory of computing (pp.\u00a0104\u2013113). [Online]. Available: citeseer.ist.psu.edu\/roughgarden00stackelberg.html ."},{"key":"9506_CR9","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/1007912.1007941","volume-title":"SPAA\u00a0\u201904: Proceedings of the sixteenth annual ACM symposium on parallelism in algorithms and architectures","author":"S. Suri","year":"2004","unstructured":"Suri, S., Toth, C. D., & Zhou, Y. (2004). Selfish load balancing and atomic congestion games. In SPAA\u00a0\u201904: Proceedings of the sixteenth annual ACM symposium on parallelism in algorithms and architectures (pp.\u00a0188\u2013195). New York: ACM Press."},{"key":"9506_CR10","unstructured":"Cristallo, G., & Jacquenet, C. An approach to inter-domain traffic engineering. [Online]. Available: citeseer.ist.psu.edu\/cristallo02approach.html ."},{"key":"9506_CR11","series-title":"Lecture notes in computer science","volume-title":"Quality of service in the emerging networking panorama: Fifth international workshop on quality of future Internet services","year":"2004","unstructured":"Sol\u00e9-Pareta, J., Smirnov, M., Mieghem, P. V., Domingo-Pascual, J., Monteiro, E., Reichl, P., Stiller, B., & Gibbens, R. J. (Eds.) (2004). Quality of service in the emerging networking panorama: Fifth international workshop on quality of future Internet services, QofIS 2004. Lecture notes in computer science (Vol.\u00a03266). Berlin: Springer."},{"key":"9506_CR12","unstructured":"Norden, S., & Turner, J. Inter-domain qos routing algorithms. [Online]. Available: citeseer.ist.psu.edu\/norden02interdomain.html ."},{"key":"9506_CR13","first-page":"253","volume-title":"IEEE Communications Magazine","author":"M. Howarth","year":"2005","unstructured":"Howarth, M., Flegas, P., Pavlou, G., Wang, N., Trimintzios, P., Griffin, D., Griem, J., Boucadair, M., Morand, P., Asgari, H., & Georgatsos, P. (2005). Provisioning for inter-domain quality of service: the mescal approach. In IEEE Communications Magazine (pp.\u00a0253\u2013278)."},{"key":"9506_CR14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/1073814.1073869","volume-title":"PODC\u201905: Proceedings of the twenty-fourth annual ACM symposium on principles of distributed computing","author":"A. Hayrapetyan","year":"2005","unstructured":"Hayrapetyan, A., Tardos, E., & Wexler, T. (2005). A network pricing game for selfish traffic. In PODC\u201905: Proceedings of the twenty-fourth annual ACM symposium on principles of distributed computing (pp.\u00a0284\u2013291). New York: ACM Press."},{"key":"9506_CR15","unstructured":"Kelly, F., Maulloo, A., & Tan, D. (1998). Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49. [Online]. Available: citeseer.ist.psu.edu\/kelly98rate.html ."},{"key":"9506_CR16","unstructured":"Shu, J., & Varaiya, P. (2003). Pricing network services. [Online]. Available: citeseer.ist.psu.edu\/shu03pricing.html ."},{"key":"9506_CR17","unstructured":"Alpcan, T., & Basar, T. (2003). A utility-based congestion control scheme for Internet-style networks with delay. [Online]. Available: citeseer.ist.psu.edu\/alpcan03utilitybased.html ."},{"key":"9506_CR18","first-page":"1","volume-title":"ICC","author":"D. Barth","year":"2009","unstructured":"Barth, D., Mautor, T., & Monteiro, D. V. (2009). Impact of alliances on end-to-end qos satisfaction in an interdomain network. In ICC (pp.\u00a01\u20136)."},{"key":"9506_CR19","first-page":"368","volume-title":"QofIS","author":"P. Georgatsos","year":"2004","unstructured":"Georgatsos, P., Spencer, J., Griffin, D., Damilatis, T., Asgari, H., Griem, J., Pavlou, G., & Morand, P. (2004). Provider-level service agreements for inter-domain qos delivery. In QofIS (pp.\u00a0368\u2013377)."},{"key":"9506_CR20","unstructured":"A.\u00a0M. (2006). Using repeated games to design incentive-based routing systems. In 25th IEEE INFOCOM."},{"key":"9506_CR21","unstructured":"A.\u00a0M., & Wroclawski, J. (2004). On the benefits and feasibility of incentive based routing infrastructure. In ACM SIGCOMM\u201904 workshop (PINS)."},{"key":"9506_CR22","unstructured":"Feigenbaum, J., Papadimitriou, C., Sami, R., & Shenker, S. (2002). A bgp-based mechanism for lowest-cost routing. In ACM symposium on principles of distributed computing. [Online]. Available: citeseer.ist.psu.edu\/feigenbaum02bgpbased.html ."},{"key":"9506_CR23","unstructured":"La, R., & Anantharam, V. (2002). Optimal routing control: Repeated game approach. In IEEE transactions on automatic control. [Online]. Available: citeseer.ist.psu.edu\/article\/la02optimal.html ."},{"key":"9506_CR24","unstructured":"V. A. (2001). The omnet++ discret event simulation system. In European simulation multiconference."},{"key":"9506_CR25","first-page":"745","volume":"14","author":"D. Barth","year":"2008","unstructured":"Barth, D., Echabbi, L., & Hamlaoui, C. (2008). Optimal transit prices negotiation: The distributed learning perspective. Journal of Universal Computer Science, 14, 745\u2013768.","journal-title":"Journal of Universal Computer Science"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-011-9506-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-011-9506-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-011-9506-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:50:11Z","timestamp":1559371811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-011-9506-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,15]]},"references-count":25,"alternative-id":["9506"],"URL":"https:\/\/doi.org\/10.1007\/s11235-011-9506-4","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,15]]}}}