Scheduling algorithms for conducting conflict-free measurements in overlay networks

Fraiwan, Mohammad; Manimaran, G.

doi:10.1016/j.comnet.2008.06.006

Cited by 13 publications

(43 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [4], [8], two measurements are considered interfering when they share a common sub-path. On an Internet scale, a common measurement sub-path can be difficult to identify since the network topologies and routes are not always available (some routers do not respond in trace-routes, and alias resolution of interfaces of the same router remains a difficult problem).…”

Section: Understanding Measurement Interferencementioning

confidence: 99%

“…An earliest deadline first scheduling algorithm (EDF-CE) is then used to schedule measurements. In [8], the tasks are grouped into periods such that all tasks within a period are non-conflicting. The tasks within the same period are executed concurrently.…”

Section: Related Workmentioning

confidence: 99%

“…In [4] and [8], a task conflict graph is constructed to represent interference. A task (a measurement request) is denoted by a vertex and a conflict is represented by an edge between the tasks.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Mitigating interference in a network measurement service

Gangam

Fahmy

2011

2011 IEEE Nineteenth IEEE International Workshop on Quality of Service

View full text Add to dashboard Cite

Shared measurement services offer key advantages over conventional ad-hoc techniques for network monitoring. A measurement service may receive measurement requests concurrently from different applications and network administrators. These measurement requests are often served by injecting active network measurement traffic between two hosts. Two active measurements are said to interfere when the probe packets of one measurement tool are viewed as network traffic by the other. This may lead to faulty measurement readings.In this paper, we model the measurement interference problem, and show how to schedule measurement tasks to reduce interference and hence increase measurement accuracy. We propose twelve computationally tractable algorithms that decrease the total completion time (makespan) of measurement tasks, while avoiding interference. Our evaluation shows that the algorithm we refer to as Largest Area First, Busiest Node First -Earliest Interval Schedule (LAFBNF-EIS) has a mean makespan of about 5% more than the theoretical lower bound over our set of measurement workloads. 1

show abstract

Section: Understanding Measurement Interferencementioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Mitigating interference in a network measurement service

Gangam

Fahmy

2011

2011 IEEE Nineteenth IEEE International Workshop on Quality of Service

View full text Add to dashboard Cite

show abstract

“…Measurements are critical for most of the papers in this Special issue. The last few years have seen an increasing interest in designing and applying more accurate measurement methods for various complex networks of interest [9]. A main goal of analyzing complex networks is to extract interesting information and illuminating properties from them.…”

Section: Related Workmentioning

confidence: 99%

The community Analysis of User Behaviors Network for Web Traffic

Cai¹,

Shu²,

Wang³

2011

JSW

View full text Add to dashboard Cite

Understanding the structure and dynamics of the user behavior networks for web traffic (To be convenient in next sections, we refer to replace it as UBNWT) that connect users with servers across the Internet is a key to modeling the network and designing future application. The Web-visited bipartite networks, called the user behavioral networks, display a natural bipartite structure: two kinds of nodes coexist with links only between nodes of different types. We obtained the result that the out-degree distribution of clients (the host initiating the connection), the in-degree distribution of servers (the host receiving the connection) and the strength distribution (the exchange bytes between clients and servers) are approximately power-law, whose exponential is between 1.7 and 3.4. The clustering coefficient of clients and servers is larger than that in randomized, degree preserving versions of the same graph, which indicate a modular structure of UBNWT. Finally, based on the algorithm of finding the community structure in bipartite network, we divided the clients into different communities, through manual examination of hosts in these communities, the typical normal (interest) and abnormal (DOS) communities were found. Interestingly, the loyalty of clients belonging to the same community in different time is higher than 80%. The structure analysis of UBNWT is very helpful for the network management, resource allocation, traffic engineering and security.

show abstract

“…• We evaluate our method and compare it with a previous method [12] by simulations with both generated and real Internet topologies.…”

Section: Introductionmentioning

confidence: 99%

A Distributed Mechanism for Probing Overlay Path Bandwidth Using Local Information Exchange

Dinh

Hasegawa

Murata

2014

IEICE Trans. Commun.

View full text Add to dashboard Cite

Available bandwidth, along with latency and packet loss rate, is an essential metric for the efficient operation of overlay network applications. However, the measurement of available bandwidth creates a larger traffic overhead than other metrics. Measurement conflicts on routeoverlapping paths can also seriously degrade measurement accuracy and cause a non-negligible increase in the network load. In this paper, we propose a distributed method for measuring the available bandwidth in overlay networks that can reduce measurement conflicts while maintaining high measurement accuracy at low cost. Our main idea is that neighboring overlay nodes exchange route information to detect overlapping paths and share the measurement results of overlapping paths to configure parameter settings for available bandwidth measurements. Our simulation results show that the relative errors in the measurement results of our method are approximately only 65% of those of the existing method. The measurement accuracy of our method remains better than that of the existing method when the total measurement traffic loads of both methods are equal.

show abstract

Scheduling algorithms for conducting conflict-free measurements in overlay networks

Cited by 13 publications

References 21 publications

Mitigating interference in a network measurement service

Mitigating interference in a network measurement service

The community Analysis of User Behaviors Network for Web Traffic

A Distributed Mechanism for Probing Overlay Path Bandwidth Using Local Information Exchange

Contact Info

Product

Resources

About