On the schedulability of measurement conflict in overlay networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4479 LNCS, Issue , 2007, Pages 1120-1131

  Fraiwan, Mohammad ^a   Manimaran, G ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONCURRENT ENGINEERING; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS; TOPOLOGY; ALGORITHMS; NEXT GENERATION NETWORKS; OVERLAY NETWORKS; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS;

OVERLAY NETWORKS; RESEARCH PROBLEMS; SCHEDULABILITY; ACTIVE MEASUREMENT; CONFLICT-AWARE SCHEDULING; DESIGN PROBLEMS; MEASUREMENT CONFLICT; NETWORK MONITORING; NETWORK TOPOLOGY; QOS MEASUREMENT;

WIRELESS NETWORKS; WIRELESS AD HOC NETWORKS;

EID: 37249038990     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72606-7_96     Document Type: Conference Paper

References (14)

1. Akamai Technologies (February 14, 2007); http://www.akamai.com
2. Calyam, P., Lee, C., Arava, P., Krymskiy, D.: Enhanced EDF scheduling algorithms for orchestrating network-wide active measurements. Proc. of IEEE RTSS'05.
3. Tang, C., Mckinley, P.: On the cost-quality tradeoff in topology-aware overlay path probing. Proc. of IEEE ICNP 2003.
4. Cui, W., Stoica, I., Katz, R.: Backup path allocation based on a correlated link failure probability model in overlay networks. Proc. of IEEE ICNP 2002.
5. Zseby, T., Zander, S., Carle, G.: Evaluation of Building Blocks for Passive One-Way-Delay Measurements. Passive and Active Measurements Workshop 2001.
6. Jain, M., Dovrolis, C.: End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput. Proc. of SIGCOMM'02.
7. Strauss, J., Katabi, D., Kaashoek, F.: A measurement study of available bandwidth estimation tools. Proc. of ACM IMC Oct. 2003.
8. Garey, M., Johnson, D.: Computers and Intractability: A guide to the theorey of NP-completeness. W. H. Freeman, 1979.
9. Calyam, P., Lee, C., Arava, P., Krymskiy, D., Lee, D.: OnTimeMeasure: A Scalable Framework for scheduling active measurements. Proc. IEEE E2EMON 2005.
10. Gaildioz, B., Wolski, R., Tourancheau, B.: Synchronizing Network Probes to avoid Measurement Intrusiveness with the Network Weather Service. IEEE High-performance Distributed Computing Conference 2000.
11. Sha, L., Lehoczky, J., Rajkumar, R.: Solutions for some practical problems in prioritized preemptive scheduling. Proc. 7th IEEE RTSS 1986.
12. Ribeiro, V., Riedi, R., Baraniuk, R., Navratil, J., Cotrell, L.: pathchirp: Effecient available bandwidth estimation for network paths. In Passive and Active Measurement Workshop 2003.
13. Halldorsson, M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded degree graphs. Proc. of the twenty-sixth annual ACM symposium on Theory of computing. 1994.
14. PlanetLab (February 14, 2007); http://www.planet-lab.org/