Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.