Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/9459
Title: | STUDY OF QoSFINDER FOR ROUTING MULTIMEDIA FLOWS |
Authors: | Babji, M. |
Keywords: | ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING |
Issue Date: | 1997 |
Abstract: | Continuous media such as audio and video are very time sensitive, in nature. So in order to transmit such media it meets certain QoS requirements. The selection of a network route for a particular media stream should hence take into account which route is best-suited for providing this QoS. QoSFinder is a method for QoS based routing of multimedia streams. It is based on the path vector protocol. The QoS parameters used here are throughput, delay, loss rate and cost. It shows that, its heuristic is superior to metrics that are only based on one of these parameters. QoSFinder increases the probability of finding the suitable paths through networks for distributed multimedia applications. Also it shows that efficiency is considerably increased by using first order routing strategy. However, first order routing strategy eliminates the ping-pong type loops, higher order loops still occurs. So, the efficiency is further increased by increasing the order of the routing strategy. But the major problem with increasing the order of the routing strategy is that it needs more memory space at each node to keep the information of more number of nodes. So the efficiency of the routing is increased by increasing the order of the routing strategy at the cost of overhead. |
URI: | http://hdl.handle.net/123456789/9459 |
Other Identifiers: | M.Tech |
Research Supervisor/ Guide: | Verma, S. K. |
metadata.dc.type: | M.Tech Dessertation |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECD247814.pdf | 2.41 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.