Using Maximum and Maximum Concurrent Multicommodity Flows for Qos Routing in the Internet

Abstract

Once we connect the network cable to a plug-in jack on the wall, 'connecting' is a mundane event unless the service is unavailable. "How can we use limited resources efficiently in the Internet?" is an important question for future development. Efficiency is a requirement for next generation networks and will be a major benefit of QoS routing in the Internet. In this research, we simulated a simple network topology using general Maximum Flow, Maximum Multicommodity Flow and Maximum Concurrent Flow algorithms to calculate advertised bandwidth capacities. Under sensitivity to (1) number of events, (2) average time between requests and (3) time between updates, the results from the simulations showed that the Maximum Multicommodity Flow Algorithm is more conservative than a general Maximum Flow Algorithm. The Maximum Concurrent Flow Algorithm did not perform well compared to the others in this simulation.