A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Using pathchar to estimate Internet link characteristics
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Future Generation Computer Systems - Special issue on metacomputing
Scheduling From the Perspective of the Application
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Synchronizing Network Probes to avoid Measurement Intrusiveness with the Network Weather Service
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Legion: The Next Logical Step Toward a Nationwide Virtual Computer
Legion: The Next Logical Step Toward a Nationwide Virtual Computer
Impact of Path Diversity on Multi-homed and Overlay Networks
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
H.323 beacon: an H.323 application related end-to-end performance troubleshooting tool
Proceedings of the ACM SIGCOMM workshop on Network troubleshooting: research, theory and operations practice meet malfunctioning reality
TBI: End-to-End Network Performance Measurement Testbed for Empirical Bottleneck Detection
TRIDENTCOM '05 Proceedings of the First International Conference on Testbeds and Research Infrastructures for the DEvelopment of NeTworks and COMmunities
Packet-dispersion techniques and a capacity-estimation methodology
IEEE/ACM Transactions on Networking (TON)
Change-Point Monitoring for the Detection of DoS Attacks
IEEE Transactions on Dependable and Secure Computing
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Ontimemeasure: a scalable framework for scheduling active measurements
E2EMON '05 Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop
The NLAMR network analysis infrastructure
IEEE Communications Magazine
Mitigating interference in a network measurement service
Proceedings of the Nineteenth International Workshop on Quality of Service
Hi-index | 14.98 |
Recent computing applications such as videoconferencing and Grid computing run their tasks on distributed computing resources connected through networks. For such applications, knowledge of the network status such as delay, jitter, and available bandwidth can help them select proper network resources to meet the Quality of Service (QoS) requirements. Also, the applications can dynamically change the resource selection if the current selection is found to experience poor performance. For such purposes, Internet Service Providers (ISPs) have started to instrument their networks with Network Measurement Infrastructures (NMIs) that run active measurement tasks periodically and/or on-demand. However, one problem that most network engineers have overlooked is the measurement conflict problem, which happens when multiple active measurement tasks inject probing packets to the same network segment at the same time, resulting in misleading reports of network performance due to their combined effects. This paper proposes enhanced EDF (Earliest Deadline First) algorithms that allow "Concurrent Executions to orchestrate offline/online measurement jobs in a conflict-free manner. The simulation study shows that our measurement scheduling mechanism can improve the schedulable utilization of offline measurement tasks up to 300% and the response time of on-demand jobs up to 50%. Further, we implement and deploy our scheduling mechanism in a real working NMI for monitoring the Internet2 Abilene network. As a case study, we show the utility of our algorithms in the widely-used Network Weather Service (NWS).