Design & Verification Multimedia using Routing IP

ABSTRACT The multimedia transmission streams imposes a minimum bandwidth requirement on the path being used to ensure end-to-end Quality-of service guarantees. The goal of routing algorithms is to find a loop-less path satisfying a given set of constraints on parameters like bandwidth, delay, etc. The path selection process could return either the entire path to the destination or the best next hop for the request. The first case is called as Source routing and the second is referred to as Distributed routing proposed system uses a new distributed routing algorithm for unicast flows, which has a very low call establishment overhead. We present a systematic evaluation of four routing algorithms that offer different tradeoffs between limiting the pathhop count and balancing the network load.