Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/315205
Full metadata record
DC FieldValueLanguage
dc.coverage.spatial
dc.date.accessioned2021-02-15T05:23:03Z-
dc.date.available2021-02-15T05:23:03Z-
dc.identifier.urihttp://hdl.handle.net/10603/315205-
dc.description.abstractThe computer networks are also being used to send information in the form of data streams or packets to a selective, usually large number of users or destinations. These networks are experiencing explosive growth due to the advances in optical fiber and switch technologies. These networks are being used for various distributed multimedia applications such as audio/video-conferencing, remote education, E-commerce, software delivery, games, telephony, virtual whiteboard, etc. The applications such as video/audio conferencing are delay-sensitive whereas the applications such as interactive gaming are bandwidth-intensive. The factors, such as explosive growth of computer networks, users and variety of resource intensive networked applications, require efficient routing algorithms for optimizing the utilization of network resources. The multicast is a technique used to facilitate the information exchange by routing data from one or more sources to a potentially large number of destinations such that overall utilization of resources is minimized in some sense. For efficient multicasting, a tree is constructed, where due to the presence of smart switches; data traverses the link only once. The resource intensive applications have a wide diversity of Quality of Service (QoS) requirements for data transfer. The commonly used QoS measures are cost, bandwidth, end-to-end delay, delay jitter, packet loss ratio and hop count, etc. The QoS based routing aims at transferring information simultaneously from one or more sources (or senders) to a group of destinations (or receivers), namely the multicast group, by optimizing objective(s) while satisfying a set of QoS constraints. A solution to the QoS multicast routing problem is to build a multicast tree, Steiner tree, which spans from the source node to all destinations. The diverse QoS requirements make the routing problem intractable and NP-complete. The computation complexity increases in searching a tree for certain combinations of QoS requirements.
dc.format.extent159p.
dc.languageEnglish
dc.relation
dc.rightsuniversity
dc.titleMulticast routing algorithms for computer network
dc.title.alternative
dc.creator.researcherJain, Sushma
dc.subject.keywordHopfield Neural Network
dc.subject.keywordMulticast Routing
dc.subject.keywordOptimization
dc.description.note
dc.contributor.guideSharma, J. D.
dc.publisher.placePatiala
dc.publisher.universityThapar Institute of Engineering and Technology
dc.publisher.institutionDepartment of Computer Science and Engineering
dc.date.registered
dc.date.completed2012
dc.date.awarded
dc.format.dimensions
dc.format.accompanyingmaterialNone
dc.source.universityUniversity
dc.type.degreePh.D.
Appears in Departments:Department of Computer Science and Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File1.07 MBAdobe PDFView/Open
02_candidates declaration.pdf272.18 kBAdobe PDFView/Open
03_abstract.pdf1.39 MBAdobe PDFView/Open
04_acknowledgements.pdf1.35 MBAdobe PDFView/Open
05_table of contents.pdf1.36 MBAdobe PDFView/Open
06_list of figures.pdf1.02 MBAdobe PDFView/Open
07_list of tables.pdf1.01 MBAdobe PDFView/Open
08_chapter 1.pdf1.41 MBAdobe PDFView/Open
09_chapter 2.pdf1.41 MBAdobe PDFView/Open
10_chapter 3.pdf1.5 MBAdobe PDFView/Open
11_chapter 4.pdf3.56 MBAdobe PDFView/Open
12_chapter 5.pdf2.59 MBAdobe PDFView/Open
13_chapter 6.pdf3.21 MBAdobe PDFView/Open
14_chapter 7.pdf1.39 MBAdobe PDFView/Open
15_list of publications.pdf1.07 MBAdobe PDFView/Open
16_references.pdf1.06 MBAdobe PDFView/Open
17_appendix a.pdf1.45 MBAdobe PDFView/Open
18_appendix b.pdf1.38 MBAdobe PDFView/Open
80_recommendation.pdf1.41 MBAdobe PDFView/Open


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: