In this paper, 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 is minimized and service-nodes are maximally utilized.