|
Routing is the process of finding a communication path between two devices in the network to transfer information flows from one device to another. We define the problem as: Given an arbitrary graph G=(V,E) and a set of flows F, where each edge on the graph has a capacity that represent the maximum number of flows that can be transmitted at a time on that edge, and each flow is characterized by the number of packets it holds and a release time, non-preemptively route all flows on graph G to optimize some objective function.
|