{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:34:24Z","timestamp":1725496464746},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540726050"},{"type":"electronic","value":"9783540726067"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72606-7_96","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T16:02:47Z","timestamp":1196092967000},"page":"1120-1131","source":"Crossref","is-referenced-by-count":5,"title":["On the Schedulability of Measurement Conflict in Overlay Networks"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Fraiwan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Manimaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"96_CR1","unstructured":"Akamai Technologies (Feb. 14, 2007), \n                      \n                        http:\/\/www.akamai.com"},{"key":"96_CR2","volume-title":"Proc. of IEEE RTSS\u201905","author":"P. Calyam","year":"2005","unstructured":"Calyam, P., et al.: Enhanced EDF scheduling algorithms for orchestrating network-wide active measurements. In: Proc. of IEEE RTSS\u201905, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"96_CR3","volume-title":"Proc. of IEEE ICNP","author":"C. Tang","year":"2003","unstructured":"Tang, C., Mckinley, P.: On the cost-quality tradeoff in topology-aware overlay path probing. In: Proc. of IEEE ICNP, IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"96_CR4","volume-title":"Proc. of IEEE ICNP","author":"W. Cui","year":"2002","unstructured":"Cui, W., Stoica, I., Katz, R.: Backup path allocation based on a correlated link failure probability model in overlay networks. In: Proc. of IEEE ICNP, IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"96_CR5","unstructured":"Zseby, T., Zander, S., Carle, G.: Evaluation of Building Blocks for Passive One-Way-Delay Measurements. In: Passive and Active Measurements Workshop (2001)"},{"key":"96_CR6","doi-asserted-by":"crossref","unstructured":"Jain, M., Dovrolis, C.: End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput. In: Proc. of SIGCOMM\u201902 (2002)","DOI":"10.1145\/633025.633054"},{"key":"96_CR7","volume-title":"Proc. of ACM IMC","author":"J. Strauss","year":"2003","unstructured":"Strauss, J., Katabi, D., Kaashoek, F.: A measurement study of available bandwidth estimation tools. In: Proc. of ACM IMC, Oct. 2003, ACM Press, New York (2003)"},{"key":"96_CR8","volume-title":"Computers and Intractability: A guide to the theorey of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A guide to the theorey of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"96_CR9","volume-title":"Proc. IEEE E2EMON","author":"P. Calyam","year":"2005","unstructured":"Calyam, P., et al.: OnTimeMeasure: A Scalable Framework for scheduling active measurements. In: Proc. IEEE E2EMON, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"96_CR10","volume-title":"IEEE High-performance Distributed Computing Conference","author":"B. Gaildioz","year":"2000","unstructured":"Gaildioz, B., Wolski, R., Tourancheau, B.: Synchronizing Network Probes to avoid Measurement Intrusiveness with the Network Weather Service. In: IEEE High-performance Distributed Computing Conference, IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"96_CR11","volume-title":"Proc. 7th IEEE RTSS","author":"L. Sha","year":"1986","unstructured":"Sha, L., Lehoczky, J., Rajkumar, R.: Solutions for some practical problems in prioritized preemptive scheduling. In: Proc. 7th IEEE RTSS, IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"96_CR12","unstructured":"Ribeiro, V., et al.: pathchirp: Effecient available bandwidth estimation for network paths. In: Passive and Active Measurement Workshop (2003)"},{"key":"96_CR13","volume-title":"Proc. of the twenty-sixth annual ACM symposium on Theory of computing","author":"M. Halldorsson","year":"1994","unstructured":"Halldorsson, M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded degree graphs. In: Proc. of the twenty-sixth annual ACM symposium on Theory of computing, ACM Press, New York (1994)"},{"key":"96_CR14","unstructured":"PlanetLab (February 14, 2007), \n                      \n                        http:\/\/www.planet-lab.org\/"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72606-7_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T17:49:59Z","timestamp":1551116999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72606-7_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540726050","9783540726067"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72606-7_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}