Lee Goang Jun, Son Ji Yeon, Son Chang Won

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 1, pp. 237-245, Jan. 1997
10.3745/KIPSTE.1997.4.1.237,   PDF Download:

Abstract

In this paper, a flow control mechanism is proposed which is based on the priority control between communication path of a node. In this scheme, demanding length of a data queue for any path is pre-defined, then each node in that path is forced to maintains buffer size under the limit by controlling priority level of the path. The communication path is which requires higher bandwidth sets its demanding queue length smaller. By providing relationship between the priority of a path and length of its queue, the high bandwidth requesting path has a better chance to get high bandwidth by defining the smaller demanding queue size. And also, by forcing a path which has high flow rate to maintain small queue size in the path of the communication, the scheme keep the transmission delay of the path small. The size of the demanding queue of a path is regularly adjusted to meet the applications requirement, and the load status of the network during the lifetime of the communication. The priority control based on the demanding queue size is also provided in the intermediate nodes as well as the end nodes. By that the flow control can provide a quicker result than end-to-end flow control, it provides better performance advantage especially for the high speed network.

Statistics
Cite this article