Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/312065
Full metadata record
DC FieldValueLanguage
dc.coverage.spatial
dc.date.accessioned2021-01-18T11:41:26Z-
dc.date.available2021-01-18T11:41:26Z-
dc.identifier.urihttp://hdl.handle.net/10603/312065-
dc.description.abstractThe increase in demand of several new generation applications over Internet becomes an important issue and challenge. These applications require data either to be transmitted from one source to many receivers or many sources to many receivers. The multicast routing is proposed as one of the vital mechanisms to communicate a message from one source to multiple receivers or multiple sources to multiple receivers. The applications involving one-to-many data transmission requires to build tree structure spanning over the sender and receivers. Building up such a tree satisfying multiple requirements like delay, multicast delay variation, bandwidth and loss probability is NP- Complete. Though many heuristics have been proposed in the recent literatures to solve this problem, still finding an optimal multicast tree with multiple constraints in polynomial time is a nontrivial task. This motivates us to take up research to propose efficient meta-heuristics for constructing QoS-aware source based multicast tree under multiple constraints. For many-to-many applications, the core based tree (CBT) has the advantage over source based tree because in CBT only one entry is required for all sources. The sources transmit the data to the receivers through the core node. The real time messages transmitted over the CBT requires the optimal placement of the core node so that the messages can be transmitted to all the receivers within a restricted time and also at the same time. Many algorithms have been devised during past to discover the best location of core for the smooth delivery of real-time messages. However, finding the optimal placement of core still remains a challenge till date. This motivates us to work in this direction for finding the best position of core node for QoS-aware multicasting in network multimedia applications. newlineIn this thesis, first the source based multicast routing task is formulated as a single objective task. First we present an efficient hybrid bacteria foraging and particle swarm optimization algorithm
dc.format.extent189 p.
dc.languageEnglish
dc.relation
dc.rightsuniversity
dc.titleSupporting QoS aware Multicasting in Network Applications
dc.title.alternative
dc.creator.researcherSahoo, Satya Prakash
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Information Systems
dc.subject.keywordEngineering and Technology
dc.description.note
dc.contributor.guideKabat, M R
dc.publisher.placeSambalpur
dc.publisher.universityVeer Surendra Sai University of Technology
dc.publisher.institutionDepartment of Computer Science and Engineering and IT
dc.date.registered
dc.date.completed2020
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 and IT

Files in This Item:
File Description SizeFormat 
80_recommendation.pdfAttached File803.53 kBAdobe PDFView/Open
bibliography.pdf589.04 kBAdobe PDFView/Open
certificate.pdf388.43 kBAdobe PDFView/Open
chapte-1.pdf978.54 kBAdobe PDFView/Open
chapter-2.pdf873.29 kBAdobe PDFView/Open
chapter-3.pdf1.21 MBAdobe PDFView/Open
chapter-4.pdf1.69 MBAdobe PDFView/Open
chapter-5.pdf1.55 MBAdobe PDFView/Open
chapter-6.pdf1.88 MBAdobe PDFView/Open
list of figure.pdf378.78 kBAdobe PDFView/Open
list of symbols.pdf558.87 kBAdobe PDFView/Open
list of table.pdf702.38 kBAdobe PDFView/Open
table of content.pdf586.96 kBAdobe PDFView/Open
title.pdf279.66 kBAdobe 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: