skip to main content
Guest
e-Shelf
My Account
Sign out
Sign in
This feature requires javascript
Tags
e-Journals
e-Books
Databases
USP Libraries
Help
Help
Language:
English
Spanish
Portuguese (Brazil)
This feature required javascript
This feature requires javascript
Primo Search
General Search
General Search
Physical Collection
Physical Collections
USP Intelectual Production
USP Production
Search For:
Clear Search Box
Search in:
General Search
Or hit Enter to replace search target
Or select another collection:
Search in:
General Search
Advanced Search
Browse Search
This feature requires javascript
This feature requires javascript
Task-execution scheduling schemes for network measurement and monitoring
Qin, Zhen ; Rojas-Cessa, Roberto ; Ansari, Nirwan
Computer communications, 2010-02, Vol.33 (2), p.124-135
[Peer Reviewed Journal]
Kidlington: Elsevier B.V
Full text available
Citations
Cited by
View Online
Details
Reviews & Tags
More
Times Cited
This feature requires javascript
Actions
Add to e-Shelf
Remove from e-Shelf
E-mail
Print
Permalink
Citation
EasyBib
EndNote
RefWorks
Delicious
Export RIS
Export BibTeX
This feature requires javascript
Title:
Task-execution scheduling schemes for network measurement and monitoring
Author:
Qin, Zhen
;
Rojas-Cessa, Roberto
;
Ansari, Nirwan
Subjects:
Active measurement
;
Applied sciences
;
Clique
;
Computer science
;
control theory
;
systems
;
Computer systems and distributed systems. User interface
;
Exact sciences and technology
;
Graph coloring
;
Information retrieval. Graph
;
Network measurement
;
Scheduling
;
Software
;
Theoretical computing
Is Part Of:
Computer communications, 2010-02, Vol.33 (2), p.124-135
Description:
Measurement is a required process in high performance networks for efficient quality-of-service (QoS) provisioning and service verification. Active measurement is an attractive approach because the measurement traffic injected into the network can be controlled and the measurement tasks can be distributed throughout the network. However, the execution of measurement tasks in common parts of a network may face contention for resources, such as computational power, memory, and link bandwidth. This contention could jeopardize measurement accuracy and affect network services. This contention for limited resources defines a conflict between measurement tasks. Furthermore, we consider two sets of measurement tasks, those used to monitor network state periodically, called periodic tasks, and those for casual measurements issued as needed, called on-demand measurement tasks. In this paper, we propose a novel scheduling scheme to resolve contention for resources of both periodic and on-demand measurement tasks from graph coloring perspective, called ascending order of the sum of clique number and degree of tasks. The scheme selects tasks according to the ascending order of the sum of clique number and conflict task degree in a conflict graph and allows concurrent execution of multiple measurement tasks for high resource utilization. The scheme decreases the average waiting time of all tasks in periodic measurement tasks scheduling. For on-demand measurement tasks, the proposed scheme minimizes the waiting time of inserted on-demand tasks while keeping time space utilization high. In other words, the total time spent on finishing all the tasks is shortened. We evaluate our proposed schemes under different measurement task assignment scenarios through computer simulations, and compare the performance of this scheme with others that also allow concurrent task execution. The simulation results show that the proposed scheme produces effective contention resolution and low execution delays.
Publisher:
Kidlington: Elsevier B.V
Language:
English
Links
View record in Pascal Francis
This feature requires javascript
This feature requires javascript
Back to results list
Previous
Result
10
Next
This feature requires javascript
This feature requires javascript
Searching Remote Databases, Please Wait
Searching for
in
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Show me what you have so far
This feature requires javascript
This feature requires javascript