By Topic

Request-service scheduling in dynamic communication networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Roosta, S.H. ; Dept. of Comput. Sci., South Carolina Univ., Spartanburg, SC, USA

Summary form only given. We investigate the problem of propagating of data to nodes and scheduling of available nodes in a dynamic data communication network. The goal of scheduling algorithm is to find a request-service scheduling such that the total communication cost is minimized. In the special case in which all requests are of equal priorities and all services have equal performance, the scheduling problem becomes the mapping of the maximum number of requests to the free service-nodes. Scheduling in a communication network entails the efficient search of a mapping from request-nodes to free service-nodes such that circuit blockage in the network are minimized and service-nodes are maximally utilized.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004