To see the other types of publications on this topic, follow the link: Multicast Networks.
Dissertations / Theses on the topic 'Multicast Networks'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Multicast Networks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Cheuk, Kin-Wai. "Island multicast : the combination of IP-multicast with application-level multicast /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20CHEUK.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.<br>Includes bibliographical references (leaves 34-37). Also available in electronic version. Access restricted to campus users.
2
Lee, Anna H. "Simplified random network codes for multicast networks." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33306.
Full textAbstract:
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.<br>Includes bibliographical references (p. 43).<br>Network coding is a method of data transmission across a network which involves coding at intermediate nodes. Network coding is particularly attractive for multicast. Building on the work done on random linear network codes, we develop a constrained, simplified code construction suitable for multicast in wireless networks. We analyze bounds on sufficient code size and code success probability via an algebraic framework for network coding. We also present simulation results that compare generalized random network codes with our code construction. Issues unique to the simplified code are explored and a relaxation of the code to improve code performance is discussed.<br>by Anna H. Lee.<br>M.Eng.and S.B.
3
Yiu, Wai-Pun. "Secure overlay multicast /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20YIU.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.<br>Includes bibliographical references (leaves 71-77). Also available in electronic version. Access restricted to campus users.
4
Jawhar, Shadi. "Multicast over optical networks." Rennes 1, 2011. http://www.theses.fr/2011REN1S051.
Full textAbstract:
Optical networks had been an important area of improvement in terms of its deployment as a core of the backbone of the international communication network. Fiber optics show a big evolution in terms of link capacity and speed compared to any other type of cables. Moreover, multicasting over IP networks had matured in the past years and this was because of the reduction in traffic which resulted when multiple clients requested to receive the same information from the same source. To support multicasting in optical networks, optical nodes have to branch one incoming light wave to more than one output port. Optical nodes must be equipped with light splitters that split one light wave to more than one output. Due to its complex design, a light splitter is very expensive equipment, thus, equipping all optical nodes with splitters will increase the cost of the optical network setup. This leads to a consensus that not all optical nodes on the network will possess this splitting capability. This document is divided into three main parts. In the first part, a brief description of multicast routing and optical networks is given respectively. Then an introduction of multicasting over optical networks is given. The main issue is that not all nodes in the network are multicast capable. The second part provides propositions to resolve network design faces of this main issue. This part studies the optimal density, placement and capabilities of those splitters in the network. Each of these propositions is simulated to evaluate its performance and criticize its efficiency. The last part of this document, describes a new signaling mechanism that modify the process of generating the multicast trees because of the light splitting limitation. This rerouting signaling mechanism depends on the number of the light splitters compared to the size of the network. At the end, conclusions for all the work done in the three parts are summarized, and a prospective is given. Next steps are identified to benefit of work done in real network design and development<br>Les réseaux optiques sont un domaine important de développement en termes de déploiement comme coeur de la dorsale du réseau de communication international. Les fibres optiques montrent une rapide évolution en termes de capacité et de vitesse de lien comparées à n'importe quel autre type de supports. Par ailleurs, le multicast sur réseaux IP a mûri ces dernières années. Il en résulte une grande réduction de trafic lorsque plusieurs clients demandent de recevoir la même information de la même source. Pour permettre le multicast dans les réseaux optiques, les noeuds optiques doivent diviser une onde lumineuse entrante et la commuter vers plusieurs ports de sortie. Les noeuds optiques doivent être équipés des répartiteurs de lumière ("light splitters") qui splitent une onde lumineuse vers plus d'une sortie. En raison de sa conception complexe, un répartiteur de lumière est un équipement très coûteux, de ce fait, équiper tous les noeuds optiques de répartiteurs peut augmenter inconsidérément le coût d'installation du réseau optique. Ceci mène à un consensus : tous les noeuds optiques du réseau ne sont pas capables de spliter la lumière. Le document est divisé en trois parties principales. Dans la première partie, une description du routage multicast et des réseaux optiques sont données successivement. Ensuite, nous introduisons le multicast sur les réseaux optiques. Le problème général est que tous les noeuds optiques dans le réseau ne sont pas capables de spliter. La deuxième partie propose plusieurs solutions pour résoudre ce problème général. Cette partie étudie la densité, le placement et les capacités de ces répartiteurs optiques dans le réseau. Chacune de ces solutions est simulée pour évaluer ses performances et pour analyser son efficacité. La dernière partie décrit un nouveau mécanisme de signalisation qui modifie le processus de construction d'un arbre multicast en raison de l'absence (ou la présence) d'un répartiteur optique dans les noeuds du réseau optique chargés de supporter l'arbre optique. Ce mécanisme de signalisation par reroutage dépend du nombre de répartiteurs de lumière comparé à la taille du réseau. En conclusion, le travail effectué dans les trois parties est récapitulé et une prospective est donnée. De prochaines étapes sont identifiées pour pleinement bénéficier de notre travail fait dans la conception et développement des futurs réseaux optiques
5
Miao, Jun. "Load balance in overlay multicast /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20MIAO.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.<br>Includes bibliographical references (leaves 59-62). Also available in electronic version. Access restricted to campus users.
6
Li, Fulu 1970. "Cooperative multicast in wireless networks." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/32507.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2005.<br>Includes bibliographical references (p. 102-106).<br>Wireless communication has fundamental impairments due to multi-path fading, attenuation, reflections, obstructions, and noise. More importantly, it has historically been designed to mimic a physical wire; in concept other communicators in the same region are viewed as crossed wires. Many systems overcome these limitations by either speaking more loudly, or subdividing the space to mimic the effect of a separate wire between each pair. This thesis will construct and test the value of a cooperative system where the routing and transmission are done together by using several of the radios in the space to help, rather than interfere. The novel element is wireless, cooperative multicast that could be the basis for a new broadcast distribution paradigm. In the first part of the thesis,. we investigate efficient ways to construct multicast trees by exploring cooperation among local radio nodes to increase throughput and conserve energy (or battery power), whereby we assume single transmitting node is engaged in a one-to-one or one-to-many transmission. In the second part of the thesis, we further investigate transmit diversity in the general context of cooperative routing, whereby multiple nodes are allowed for cooperative transmissions. Essentially, the techniques presented in the second part of the thesis can be further incorporated in the construction of multicast trees presented in the first part.<br>by Fulu Li.<br>S.M.
7
Ramasubramaniam, Venkata Lakshmanan. "A framework for reliable multicast protocol." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000599.
Full text
8
Martina, Jean Everson. "Verification of security protocols based on multicast communication." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609650.
Full text
9
alyanbaawi, ashraf. "DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.
Full textAbstract:
Multicasting can be done in two different ways: source based tree approach andshared tree approach. Shared tree approach is preferred over source-based treeapproach because in the later construction of minimum cost tree per source is neededunlike a single shared tree in the former approach. However, in shared tree approach asingle core needs to handle the entire traffic load resulting in degraded multicastperformance. Besides, it also suffers from „single point failure‟. Multicast is acommunication between one or multiple senders and multiple receivers, which used asa way of sending IP datagrams to a group of interested receivers in one transmission.Core-based trees major concerns are core selection and core as single point of failure.The problem of core selection is to choose the best core or cores in the network toimprove the network performance.In this dissertation we propose 1) a multiple core selection approach for core-based tree multicasting, senders can select different cores to have an efficient loadbalanced multicore multicasting. It will overcome any core failure as well. 2) Novel andefficient schemes for load shared multicore multicasting are presented. Multiple coresare selected statically, that is, independent of any existing multicast groups and also theselection process is independent of any underlying unicast protocol. Some of theselected cores can be used for fault- tolerant purpose also to guard against any possible core failures. 3) We have presented two novel and efficient schemes forgroup-based load shared multicore multicasting in which members of a multicast groupuse the same core tree for their multicasting. 4) We also presented two schemes aim atachieving low latency multicasting along with load sharing for delay sensitive multicastapplications. Besides, we have presented a unique approach for core migration, whichuses two very important parameters, namely, depth of a core tree and pseudo diameterof a core. One noteworthy point from the viewpoint of fault tolerance is that the degreeof fault-tolerance can be enhanced from covering single point-failure to any number ofcore failures.
10
Akkor, Gün. "Multicast communication support over satellite networks." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2452.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2005.<br>Thesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
11
ANAND, KUMAR. "A SCALABLE EXPLICIT MULTICAST PROTOCOL FOR MOBILE AD HOC NETWORKS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1099354888.
Full text
12
Jennings, Michael (Michael Vincent). "The application of network coding to multicast routing in wireless networks." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40532.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.<br>Includes bibliographical references (p. 58-62).<br>This thesis considers the application of network coding and opportunistic routing to improve the performance of multicast flows in wireless networks. Network coding allows routers to randomly mix packets before forwarding them. This randomness ensures that routers that hear the same transmission are unlikely to forward the same packets, which permits routers to exploit wireless opportunism with minimal coordination. By mixing packets, network coding is able to reduce the number of transmissions necessary to convey packets to multiple receivers, which can lead to a large increase in throughput for multicast traffic. We discuss the design of a multicast enabled variant of MORE, a network coding based protocol for file transfer in wireless mesh networks, and evaluate this extension, which we call MORE-M, in a 20-node indoor wireless testbed. We compare MORE-M to a wireless multicast protocol that takes an approach similar to that of wired multicast by using the ETX metric to build unicast routing trees. We also compare MORE-M to a multicast enabled variant of the ExOR routing protocol. Experiments show that MORE-M's gains increase with the number of destinations, and are 35-200% greater than that of ExOR. We then consider the problem of video streaming in a wireless local area network for applications such as video conferencing. A network coding based protocol that uses opportunistic receptions at clients is proposed. We evaluate the design in our testbed and demonstrate that the use of network coding and, in particular, the use of wireless opportunism increase the quality of the video stream.<br>by Michael Jennings.<br>S.M.
13
Coutinho, Nuno Alexandre Tavares. "Seamless integration of heterogeneous networks in multicast environments." Doctoral thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/14193.
Full textAbstract:
Doutoramento em Engenharia Electrotécnica<br>Nowadays, communication environments are already characterized by a myriad
of competing and complementary technologies that aim to provide an ubiquitous
connectivity service. Next Generation Networks need to hide this heterogeneity by
providing a new abstraction level, while simultaneously be aware of the underlying
technologies to deliver richer service experiences to the end-user. Moreover, the increasing
interest for group-based multimedia services followed by their ever growing
resource demands and network dynamics, has been boosting the research towards
more scalable and
exible network control approaches. The work developed in this
Thesis enables such abstraction and exploits the prevailing heterogeneity in favor
of a context-aware network management and adaptation. In this scope, we introduce
a novel hierarchical control framework with self-management capabilities that
enables the concept of Abstract Multiparty Trees (AMTs) to ease the control of
multiparty content distribution throughout heterogeneous networks.
A thorough evaluation of the proposed multiparty transport control framework was
performed in the scope of this Thesis, assessing its bene ts in terms of network selection,
delivery tree recon guration and resource savings. Moreover, we developed
an analytical study to highlight the scalability of the AMT concept as well as its
exibility in large scale networks and group sizes. To prove the feasibility and easy
deployment characteristic of the proposed control framework, we implemented a
proof-of-concept demonstrator that comprehends the main control procedures conceptually
introduced. Its outcomes highlight a good performance of the multiparty
content distribution tree control, including its local and global recon guration.
In order to endow the AMT concept with the ability to guarantee the best service
experience by the end-user, we integrate in the control framework two additional
QoE enhancement approaches. The rst employs the concept of Network Coding
to improve the robustness of the multiparty content delivery, aiming at mitigating
the impact of possible packet losses in the end-user service perception. The second
approach relies on a machine learning scheme to autonomously determine at each
node the expected QoE towards a certain destination. This knowledge is then used
by di erent QoE-aware network management schemes that, jointly, maximize the
overall users' QoE.
The performance and scalability of the control procedures developed, aided by the
context and QoE-aware mechanisms, show the advantages of the AMT concept
and the proposed hierarchical control strategy for the multiparty content distribution
with enhanced service experience. Moreover we also prove the feasibility of
the solution in a practical environment, and provide future research directions that
bene t the evolved control framework and make it commercially feasible.<br>Atualmente, os ambientes de comunicação caracterizam-se pela diversidade de tecnologias
concorrentes e complementares cujo principal objetivo é fornecer conectividade
de forma ubíqua. De forma a lidar com esta heterogeneidade, as redes
de próxima geração terão de suportar um novo nível de abstração, embora simultaneamente
necessitem de estar conscientes das tecnologias presentes de forma a
oferecer uma melhor experiência do serviço ao utilizador final. Para além disso,
o crescente interesse por comunicações multimédia para grupos de utilizadores e
as cada vez maiores exigências em termos de recursos e dinâmica da rede destes
serviços, tem motivado a investigação no sentido de desenvolver soluções de controlo
da rede mais escaláveis e flexíveis. O trabalho desenvolvido nesta Tese, não
só aborda o suporte da camada de abstração, como também explora a heterogeneidade
presente em prol de uma gestão e adaptação da rede consciente do seu
contexto. Neste âmbito, é introduzida nesta Tese uma nova estrutura hierárquica
de controlo com capacidades de auto-gestão que possibilitam o conceito de Abstract Multiparty Trees (AMTs) de forma a facilitar o controlo da distribuição de conteúdos para grupos através de redes heterogéneas.
Nesta Tese foi também realizada uma avaliação detalhada da estrutura de controlo
de forma a aferir os benefícios do controlo da rede baseado na informação
de contexto, no que diz respeito à seleção da rede, reconfiguração da árvore de
distribuição, poupança de recursos e operações de gestão. Para além disso, foi
também desenvolvido um estudo analítico para destacar a escalabilidade do conceito
AMT, bem como da sua flexibilidade perante redes de grande escala e um
vasto número de potenciais utilizadores. De forma a provar a viabilidade e fácil
aplicação da estrutura de controlo proposta, foi implementado um demonstrador
para prova de conceito que inclui os principais procedimentos de controlo introduzidos
conceptualmente. Os resultados da avaliação do demonstrador salientam
o bom desempenho no controlo da árvore de distribuição de conteúdos, bem como
nos processos de reconfiguração local e global da mesma.
Com o intuito de dotar o conceito AMT com a capacidade de garantir a melhor
experiência de serviço pelo utilizador final, integrou-se na estrutura de controlo
proposta dois mecanismos para melhorar a Qualidade de Experiência (QoE). O
primeiro baseia-se na utilização do conceito de Codificação de Rede para melhorar
a robustez da entrega de conteúdos a grupos, tendo como objetivo eliminar o impacto
da possível perda de pacotes na perceção do serviço por parte do utilizador.
O segundo mecanismo tira partido do conceito de aprendizagem automática para
que, de forma autónoma, seja capaz de determinar em cada nó da rede o valor
expectável de QoE para um dado destino. Este conhecimento é depois utilizado por
diferentes mecanismos de gestão de rede sensíveis a QoE para de forma conjunta
maximizar a percepção do serviço por parte dos utilizadores finais.
O desempenho e a escalabilidade dos processos de controlo desenvolvidos, com a
ajuda dos mecanismos sensíveis ao contexto e à QoE, demonstram as vantagens
do conceito AMT e da estrutura de controlo hierárquica para a distribuição de
conteúdos a grupos com uma experiência de serviço melhorada. Para além disso, é
também demonstrada a praticabilidade da nossa solução, bem como possíveis linhas
de investigação que podem melhorar a estrutura de controlo proposta e fazer
dela comercialmente aplicável.
14
Shrinivas, V. Prasanna. "Pricing Multicast Network Services." Thesis, Indian Institute of Science, 2001. https://etd.iisc.ac.in/handle/2005/270.
Full textAbstract:
Multicast has long been considered an attractive service for the Internet for the provision of multiparty applications. For over a decade now multicast has been a proposed IETF standard. Though there is a strong industry push towards deploying multicast, there has been little multicast deployment by commercial Internet Service Providers (ISPs) and more importantly most end-users still lack multicast capabilities. Depending on the underlying network infrastructure, the ISP has several options of implementing his multicast capabilities. With significantly faster and more sophisticated protocols being designed and prototyped, it is expected that a whole new gamut of applications that are delay sensitive will come into being. However, the incentives to resolve the conflicting interests of the ISPs and the end-users have to be provided for successful implementation of these protocols. Thus we arrive at the following economic questions: What is the strategy that will enable the ISP recover his costs ? How can the end-user be made aware of the cost of his actions ? Naturally, the strategies of the ISP and the end-user depend on each other and form an economic game. The research problems addressed in this thesis are:
A pricing model that is independent of the underlying transmission protocols is prefered. We have proposed such a pricing scheme for multicast independent of the underlying protocols, by introducing the concept of pricing points* These pricing points provide a range of prices that the users can expect during a particular time period and tune their usage accordingly. Our pricing scheme makes both the sender and receiver accountable. Our scheme also provides for catering to heterogeneous users and gives incentive for differential pricing.
We explore a number of formulations of resource allocation problems arising in communication networks as optimization models. Optimization-based methods were only employed for unicast congestion control. We have extended this method for single rate multicast. We have also devised an optimization-based approach for multicast congestion control that finds an allocation rate to maximize the social welfare. Finally we also show that the session-splitting problem can also be cast as an optimization problem.
The commonly used "max-min" fairness criteria suffers from serious limitations like discriminating sessions that traverse large number of links and poor network utilization. We provide an allocation scheme that reduces discrimination towards multicast sessions that traverse many links and also improves network utilization.
15
Shrinivas, V. Prasanna. "Pricing Multicast Network Services." Thesis, Indian Institute of Science, 2001. http://hdl.handle.net/2005/270.
Full textAbstract:
Multicast has long been considered an attractive service for the Internet for the provision of multiparty applications. For over a decade now multicast has been a proposed IETF standard. Though there is a strong industry push towards deploying multicast, there has been little multicast deployment by commercial Internet Service Providers (ISPs) and more importantly most end-users still lack multicast capabilities. Depending on the underlying network infrastructure, the ISP has several options of implementing his multicast capabilities. With significantly faster and more sophisticated protocols being designed and prototyped, it is expected that a whole new gamut of applications that are delay sensitive will come into being. However, the incentives to resolve the conflicting interests of the ISPs and the end-users have to be provided for successful implementation of these protocols. Thus we arrive at the following economic questions: What is the strategy that will enable the ISP recover his costs ? How can the end-user be made aware of the cost of his actions ? Naturally, the strategies of the ISP and the end-user depend on each other and form an economic game. The research problems addressed in this thesis are:
A pricing model that is independent of the underlying transmission protocols is prefered. We have proposed such a pricing scheme for multicast independent of the underlying protocols, by introducing the concept of pricing points* These pricing points provide a range of prices that the users can expect during a particular time period and tune their usage accordingly. Our pricing scheme makes both the sender and receiver accountable. Our scheme also provides for catering to heterogeneous users and gives incentive for differential pricing.
We explore a number of formulations of resource allocation problems arising in communication networks as optimization models. Optimization-based methods were only employed for unicast congestion control. We have extended this method for single rate multicast. We have also devised an optimization-based approach for multicast congestion control that finds an allocation rate to maximize the social welfare. Finally we also show that the session-splitting problem can also be cast as an optimization problem.
The commonly used "max-min" fairness criteria suffers from serious limitations like discriminating sessions that traverse large number of links and poor network utilization. We provide an allocation scheme that reduces discrimination towards multicast sessions that traverse many links and also improves network utilization.
16
Tsang, Cheuk-man Mark, and 曾卓敏. "Multicast techniques for bandwidth-demanding applications in overlay networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B40687508.
Full text
17
Tsang, Cheuk-man Mark. "Multicast techniques for bandwidth-demanding applications in overlay networks." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B40687508.
Full text
18
Wagh, Prasad J. "DiffServ overlay multicast for videoconferencing." Diss., Columbia, Mo. : University of Missouri-Columbia, 2005. http://hdl.handle.net/10355/4301.
Full textAbstract:
Thesis (M.S.)--University of Missouri-Columbia, 2005.<br>The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (January 10 , 2007) Includes bibliographical references.
19
Siebert, Christian. "Efficient Broadcast for Multicast-Capable Interconnection Networks." Master's thesis, Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601822.
Full textAbstract:
The broadcast function MPI_Bcast() from the MPI-1.1 standard is one of the most heavily used collective operations for the message passing programming paradigm. This diploma thesis makes use of a feature called "Multicast", which is supported by several network technologies (like Ethernet or InfiniBand), to create an efficient MPI_Bcast() implementation, especially for large communicators and small-sized messages. A preceding analysis of existing real-world applications leads to an algorithm which does not only perform well for synthetical benchmarks but also even better for a wide class of parallel applications. The finally derived broadcast has been implemented for the open source MPI library "Open MPI" using IP multicast. The achieved results prove that the new broadcast is usually always better than existing point-to-point implementations, as soon as the number of MPI processes exceeds the 8 node boundary. The performance gain reaches a factor of 4.9 on 342 nodes, because the new algorithm scales practically independently of the number of involved processes<br>Die Broadcastfunktion MPI_Bcast() aus dem MPI-1.1 Standard ist eine der meistgenutzten kollektiven Kommunikationsoperationen des nachrichtenbasierten Programmierparadigmas. Diese Diplomarbeit nutzt die Multicastfähigkeit, die von mehreren Netzwerktechnologien (wie Ethernet oder InfiniBand) bereitgestellt wird, um eine effiziente MPI_Bcast() Implementation zu erschaffen, insbesondere für große Kommunikatoren und kleinere Nachrichtengrößen. Eine vorhergehende Analyse von existierenden parallelen Anwendungen führte dazu, dass der neue Algorithmus nicht nur bei synthetischen Benchmarks gut abschneidet, sondern sein Potential bei echten Anwendungen noch besser entfalten kann. Der letztendlich daraus entstandene Broadcast wurde für die Open-Source MPI Bibliothek "Open MPI" entwickelt und basiert auf IP Multicast. Die erreichten Ergebnisse belegen, dass der neue Broadcast üblicherweise immer besser als jegliche Punkt-zu-Punkt Implementierungen ist, sobald die Anzahl von MPI Prozessen die Grenze von 8 Knoten überschreitet. Der Geschwindigkeitszuwachs erreicht einen Faktor von 4,9 bei 342 Knoten, da der neue Algorithmus praktisch unabhängig von der Knotenzahl skaliert
20
Tan, Guang. "Reliable and Efficient Multicast in Overlay Networks." Thesis, University of Warwick, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.487921.
Full textAbstract:
As a fundamental model of communication, multicast has long been treated as a network primitive, which leads to IP being viewed as the natural protocol layer for implementing multicast related functionality. However, after more than a decade's efforts from both the research community and industry, IP multicast is still plagued with concerns about its scaling and management limitations. This fact has led to considerable interest in alternative approaches that are implemented at the application layer, using only end-systems. In this new approach, participating hosts organize themselves into an overlay topology for data delivery, and all multicast-related functionality is implemented at the end systems instead of at the routers. This shifting of multicast support from routers to end systems has proven to be able to solve most problems associated with IP multicast, as is evident from the great success of some large-scale media streaming applications running on the current Internet. This thesis addresses two of the major technical challenges presented by overlay multicast: reliability and efficiency. In many application scenali.os, the end systems are non-dedicated machines and are thus dynamic in nature, leading to highly unreliable data delivery in the network. We consider this problem for two representative architectures of overlay multicast: application-specific overlays and Distributed Hash Table (DHT)-based overlays. For the first architecture, we focus on the tree overlay structure and propose a set ofnew algorithms that can significantly improve the reliability of data delivery, and validate it in the context of a media streaming application. For the DHT architecture, we present a stochastic analysis which not only sheds light on node lifetime characteristics in the multicast context, but also lends itself to th~ reliability analysis for general overlay based applications that involve persistent data transfer. The second theme of this thesis concerns the efficiency issues of overlay multicast, particularly those introduced by the 'anarchy' of overlay members. In the absence ofcentralized resource management, end systems are likely to behave in a self-interested way. The lack of motivation to contribute resources, and the potential unfairness of Quality ofService (QoS) among overlay members, therefore may lead to resource shortage which impairs system perfonnance. Taking an economic perspective to this problem, we develop bidding-based incentive and service differentiation mechanisms that can stimulate overlay members to contribute their resources, and that are strategy-proof, in the sense that individuals cannot take advantage of others without QoS penalty. We design mechanisms to stimulate contribution within single overlays as well as across multiple co-existing overlays, and confinn their efficacy through extensive simulations.
21
Österberg, Patrik. "Efficient multicast video streaming over heterogeneous networks /." Stockholm : KTH Microelectronics and Information Technology, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-510.
Full text
22
Constantinescu, Doru. "Overlay multicast networks : elements, architectures and performance /." Karlskrona : Department of Telecommunication Systems, School of Engineering, Blekinge Institute of Technology, 2007. http://www.bth.se/fou/Forskinfo.nsf/allfirst2/2f1401dd7b2385abc12573ad00599e74?OpenDocument.
Full text
23
Chiu, Hon-sun, and 邵漢新. "Receiver-driven layered multicast over IP networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29735853.
Full text
24
Lertpratchya, Daniel. "Robust multicast protocols for wireless multihop networks." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52221.
Full textAbstract:
The problem of multicasting in wireless multihop networks was studied in this dissertation. Nodes in the multicast routing structures were classified into different classes based on their roles in the multicast routing structures. Optimal multicast routing strategies for different classes were analyzed using the most accurate interference model. Based on the analyses, two algorithms to create interference-aware multicast routing tree and three algorithms to create interference-aware multicast routing mesh were proposed. The proposed multicast routing structures were evaluated using wireless network simulations. To improve the credibility of the wireless network simulations, a frame-level bursty link model was proposed and implemented in ns-3 network simulator. The results showed that, by taking interference into account when building multicast routing structures, the proposed multicast routing structures provided improved performance over other multicast routing structures that do not consider wireless interference when building multicast routing structures.
25
Mukanyiligira, Didacienne. "Virtualization of multicast services in WiMAX networks." Doctoral thesis, University of Cape Town, 2017. http://hdl.handle.net/11427/27360.
Full textAbstract:
Multicast service is one of the methods used to efficiently manage bandwidth when sending multimedia content. To improve bandwidth utilisation, virtualization is often invoked because of its additional features such as bandwidth sharing and support of services that require high volumes of transactional data. Currently, network providers are concerned with the bandwidth amount for efficient use of the limited wireless network capabilities and the provision of a better quality of service. The virtualization design of a multicast service framework should satisfy several objectives. For example, it should enable the interchange of service delivery between multiple networks with one shareable network infrastructure. Also, it should ensure efficient use of network resources and guarantee users' demands of Quality of Service (QoS). Thus, the design of virtualization of multicast service framework is a complex research study. Due to the bandwidth-related arguments, a strong focus has been put on technical issues that facilitate virtualization in wireless networks. A well-designed virtualized network guarantees users with the required quality service. Similarly, virtualization of multicast service is invoked to improve efficient utilisation of bandwidth in wireless networks. As wireless links prove to be unstable, packet loss is unavoidable when multicast service-oriented virtual artefacts are incorporated in wireless networks. In this thesis, a virtualized multicast framework was modelled by using Generalized Assignment Problem (GAP) methodology. Mixed Integer Linear Programing (MILP) was implemented in MATLAB to solve the GAP model. This was to optimise the allocation of multicast traffic to the appropriate virtual networks. Thus, the developed model allows users to have interchangeable services offered by multiple networks. Furthermore, Network Simulator version 3 (NS-3) was used to evaluate the performance of the virtualized multicast framework. Three applications, namely, voice over IP (VoIP), video streaming, and file download have been used to evaluate the performance of a multicast service virtualization framework in Worldwide Interoperability for Microwave Access (WiMAX) networks using NS-3. The performance evaluation was based on whether MILP is used or not used. The results of experimentation have revealed that there is good performance of virtual networks when multicast traffic is sent over one single virtual network instead of sending it over multiple virtual networks. Similarly, the results show that the bandwidth is efficiently used because the multicast traffic is not delivered through multiple virtual networks. Overall, the concepts, the investigations and the model presented in this thesis can enable mobile network providers to achieve efficient use of bandwidth and provide the necessary means to support services for QoS differentiations and guarantees. Also, the multicast service virtualization framework provides an excellent tool that can enable network providers to interchange services. The developed model can serve as a basis for further extension. Specifically, the extension of the model can boost load balancing in the flow allocation problem and activate a virtual network to deliver traffic. This may rely on the QoS policy between network providers. Therefore, the model should consider the number of users in order to guarantee improved QoS.
26
Asís, López Fuentes Francisco de. "Video multicast in peer-to-peer networks." München Verl. Dr. Hut, 2009. http://d-nb.info/992892244/04.
Full text
27
Wong, Wan-Ching. "SALM : an efficient application-level multicast protocol for dynamic groups /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20WONGW.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.<br>Includes bibliographical references (leaves 75-79). Also available in electronic version. Access restricted to campus users.
28
Boinpalli, Vamshi Krishna. "A Robust Wireless Multicast Protocol." Ohio University / OhioLINK, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1121356426.
Full text
29
Hughes, Frank Lawrence Kingsman. "Multicast communications in distributed systems." Thesis, University of Newcastle Upon Tyne, 1986. http://hdl.handle.net/10443/2007.
Full textAbstract:
One of the numerous results of recent developments in communication networks and distributed systems has been an increased interest in the study of applications and protocolsfor communications between multiple, as opposed to single, entities such as processes and computers. For example, in replicated file storage, a process attempts to store a file on several file servers, rather than one. MUltiple entity communications, which allow one-to-many and many-to-one communications, are known as multicast communications. This thesis examines some of the ways in which the architectures of computer networks and distributed systems can affect the design and development of multicast communication applications and protocols. To assist in this examination, the thesis presents three contributions. First, a set of classification schemes are developed for use in the description and analysis of various multicast communication strategies. Second, a general set of multicast communication primitives are presented, unrelated to any specific network or distributed system, yet efficiently implementable on a variety of networks. Third, the primitives are used to obtain experimental results for a study ofintranetwork and internetwork multicast communications.
30
Jiang, Tianji. "Accommodating heterogeneity and scalability for multicast communication." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/8190.
Full text
31
Khan, Nabeel Pervaiz. "Performance evaluation of on demand multicast routing protocol for ad hoc wireless networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 56 p, 2009. http://proquest.umi.com/pqdweb?did=1891510831&sid=1&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
32
Zhang, Zaichen, and 張在琛. "Network-supported internet multicast congestion and error control." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31243915.
Full text
33
Brahmadesam, Murali M. "Framework for scalable secure source specific multicast." [Gainesville, Fla.]: University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000509.
Full text
34
Donahoo, Michael J. "Application-based enhancement to network-layer multicast." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/9230.
Full text
35
Klinker, James Eric. "Scalable multicast tree construction for wide area networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA288318.
Full text
36
Thakur, Mohit [Verfasser]. "Relay Positioning for Multicast Relay Networks / Mohit Thakur." München : Verlag Dr. Hut, 2014. http://d-nb.info/105155022X/34.
Full text
37
Wang, Ning. "Scalable multicast provisioning in IP differentiated services networks." Thesis, University of Surrey, 2004. http://epubs.surrey.ac.uk/843389/.
Full textAbstract:
The emergence of point-to-multipoint applications with Quality of Service (QoS) requirements in the Internet has prompted research towards the deployment of multicast communications in Differentiated Services (DiffServ) environments. However, despite many past research efforts, global availability of IP multicast is still a pie in the sky for Internet users, let alone applications with QoS guarantees. One of the key factors that hamper associated progress is scalability, in terms of various types of states associated with routing and signaling in both multicast and QoS. In this thesis we aim at a scalable architectural design of multicast service provisioning for end users with heterogeneous QoS requirements, targeted to the DiffServ environment. Our architecture consists of three planes: management, control and data plane. First of all, we design and evaluate the Offline Multicast Traffic Engineering (OMTE) building block in the management plane for QoS aware multicast service dimensioning. The main novelty of this scheme is that we shift away from the commonly used Multi-Protocol Label Switching (MPLS) based traffic engineering, and address the bandwidth constrained IP multicast TE directly based on link state routing protocols. With this approach, end-to-end performance can be achieved without MPLS explicit routing that potentially suffers from scalability problems in terms of Label Switching Path (LSP) maintenance and is relatively expensive to deploy. In the control plane, we propose two different paradigms. QoS aware Source Specific Multicast (QSSM) is designed for dedicated multicast delivery tree construction in different QoS classes, while another overlay scheme, known as Differentiated QoS Multicast (DQM), attempts to build a single hybrid tree that exhibits heterogeneous QoS channels within the network. In both approaches, multicast group addresses are used to encode QoS class information, and the associated benefit is reflected in scalability and backwards compatibility; neither underlying multicast protocols nor existing routers need any extension for carrying and maintaining QoS states within the network. Finally, envisaging the importance of protecting dimensioned resources from Denial-of-Service (DoS) attacks from malicious hosts, we propose the Multicast Sender Access Control (MSAC) mechanism, which is indispensable in multicast security, but still lacks significant attention from the research community. We focus on bi-directional multicast trees, which is the most vulnerable routing paradigm to DoS attacks. Both intra- and inter-domain control mechanisms are addressed with scalability considerations in mind.
38
Gluhak, Alexander Daniel. "Multicast service delivery in next generation wireless networks." Thesis, University of Surrey, 2006. http://epubs.surrey.ac.uk/842851/.
Full textAbstract:
Mobile network operators have recently started looking into ways to increase their own network scalability, in order to support a large number of customers with new bandwidth consuming multimedia services. The two most promising solutions identified are to extend the existing networks with multicast capabilities and to cooperate with network operators of different wireless access technologies. As a consequence of these trends, a next generation network environment will allow mobile users to receive multimedia service data from a variety of multicast capable access networks. Although considerable progress has been made with the standardisation of multicast mechanisms such as Multimedia Broadcast and Multicast Services (MBMS) for UMTS networks, shortcomings still exist in emerging multicast technologies and their interworking with each other. One of the critical realisations leading to this research was the observation that the establishment and release of multicast bearers, particularly in UMTS networks, requires signalling intensive procedures, as compared to the simple mechanisms of IP multicast on the Internet. Especially for services such as location based multicast services, where a user is expected to change multicast groups more frequently, a considerable signalling burden may be added to a network. This is hardly acceptable for mobile networks, where wireless resources are valuable and scarce. One contribution made in this thesis extends the currently defined mechanisms in MBMS to allow the concurrent delivery of different versions of location based content using the same multicast bearer service. It is shown by simulation study that the proposed mechanism achieves significant signalling savings, especially over the air interface, compared to the case where separate multicast bearer services are utilised for the delivery of different location specific flows. Another significant observation was that the current receiver driven service model of IP multicast is not suitable to allow efficient multicast delivery in a wireless network environment with multiple access networks. This thesis argues that efficient multicast delivery requires mechanisms for delivery coordination, in order to avoid the same multicast traffic being delivered via multiple access networks to the same location. Based on a detailed analysis of the shortcomings of current IP multicast group management mechanism, two incremental solutions to achieve multicast delivery coordination in next generation networks are developed and their advantages and disadvantages thoroughly studied. The first approach achieves delivery coordination by introducing a group management support as a session layer solution, leaving the operation of current existing IP multicast mechanisms completely unchanged. The second approach provides a solution on the network layer to achieve multicast delivery coordination, and requires the modification of the current IP multicast group management mechanisms. Proof-of-concept prototypes are built to demonstrate the feasibility of both solutions. An evaluation of their performance is achieved by analytical and simulation study and is complemented by a testbed study of the prototypes.
39
Jennehag, Ulf. "Video streaming over multicast enabled wired IP networks /." Stockholm : Telecommunications Systems Laboratory, Dept. of Microelectronics and Information Technology, KTH, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-516.
Full text
40
Jyothula, Urmila. "Performance Evaluation of Multicast Behavior in Congested Networks." Thesis, Blekinge Tekniska Högskola, Institutionen för tillämpad signalbehandling, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-17816.
Full textAbstract:
Compuverde’s software-defined storage product uses multicast for the communication between servers in a cluster. The product makes use of IP UDP multicast for sending status messages between the servers that forms the storage cluster. The storage clusters capacity and performance scales linear to the number of servers in the cluster. The problem is that the multicast traffic also increases with the number of nodes. All nodes send to all other nodes in the cluster. In this document, we present a proposal on evaluation of IP multicast behavior in a network congested with traffic similar to that produced by Compuverde’s product. IP multicast is a method of sending Internet Protocol (IP) datagrams to a group of interested receivers in a single transmission. In order to provide an efficient, timely, and global many-to-many distribution of data, and as such may become the broadcast medium of choice in the future, IP multicasting is used[1]. The main benefit of IP Multicast is that it reduces the bandwidth consumption when data from a sender must reach multiple receivers. We are interested in studying the effects on the network when we send multicast packets at a rate closed to the operational limit of the switch. To be able to study this behavior at larger scale Compuverde’s will provide a cluster with 48 servers all connected to the same switch. In addition, we will compare the behavior of IPv4 multicast traffic to that of IPv6. Aims and Objectives: Our aim of my thesis is mainly to focus on IP multicast and compare the IPv4 multicast performance results to the results from IPv6 multicast. In addition, a C++ tool for generating multicast traffic will be developed on Linux. A detailed study on IP multicast (IPv4, IPv6). Detailed study on the design and efficient implementation of a multicast traffic generating tool. Detailed study on the switch that will be used in the project. Additional switches may be provided by BTH. Detailed study on the pattern of dropped packets when traffic rate approaches operational limit and other related impairments on QoS metrics (e.g., CPU utilization). Methods: The method is to develop a tool that will generate multicast load towards servers in a cluster. The data sent as multicast packets shall consist of information that will make it possible to detect packet loss on the receiving servers if the network gets congested. The first version of the tool shall use existing socket classes that are based on the IPv4 protocol and shall be written in C++. The tool shall be able to run in two modes at the same time: client mode and server mode. The server part of the tool shall subscribe to a predefined multicast address and receive incoming multicast packages. The client part of the tool shall send data packages to the same predefined multicast address at a configurable rate that will increase over time. The data in the packet that will be sent shall be constructed in a way that lets the receiver (server) detect if a packet is lost in transmission. The load should start small with a small number of servers in the cluster, and then in steps scale up the number of servers, until a maximum of 48 servers is reached. The rate that the multicast packets is sent should also be increased, until the switch gets overloaded and starts to drop packets. The pattern of how packets are dropped should be observed. For example such as, if it is biggerlarge chunks of packets that get dropped or if it is every second packet that gets dropped. The second version of the tool shall support IPv6 multicast. The second round of tests should be performed in a way that makes them comparable to the results from the IPv4 tests so it is possible to draw conclusions if one protocol performs better or is more reliable. Result: The maximum number of IPv4 packets a switch can handle is 140 packets per second. The maximum number of IPv6 packets a switch can handle is 6 packets per second. The CPU utilization is more while multicasting the IPv4 packets than while multicasting IPv6 packets by using switch, 95 Nodes. Conclusion: The IPv4 is most efficient protocol than IPv6 protocol while sending the packets at very high data rate. The CPU utilization is more higher for sending with the IPv6 protocol packets than with the IPv4 protocol.<br><p>no</p>
41
"Nonblocking multicast Clos networks." 2011. http://library.cuhk.edu.hk/record=b5894778.
Full textAbstract:
Wan, Yujie.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2011.<br>Includes bibliographical references (leaves 52-56).<br>Abstracts in English and Chinese.<br>Abstract --- p.i<br>Acknowledgement --- p.iii<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Nonblocking Conditions of Three-stage Clos Networks --- p.2<br>Chapter 1.2 --- Previous Works on Unicast Nonblocking Conditions --- p.4<br>Chapter 1.3 --- Previous Works on Multicast Nonblocking Conditions --- p.7<br>Chapter 1.4 --- Thesis Organization and Contributions --- p.9<br>Chapter 2 --- Unified Coloring Framework --- p.11<br>Chapter 2.1 --- Conflict Graph of Multicast Calls --- p.11<br>Chapter 2.2 --- Check of Unicast Nonblocking Conditions --- p.17<br>Chapter 2.3 --- Call Splitting and Hardware Models --- p.20<br>Chapter 3 --- SNB Conditions --- p.24<br>Chapter 3.1 --- Model 1 --- p.25<br>Chapter 3.2 --- "Model 0, 2, and 3" --- p.26<br>Chapter 3.2.1 --- Worst-Case Call Splitting --- p.26<br>Chapter 3.2.2 --- Proof of Nonblocking Conditions --- p.27<br>Chapter 3.3 --- Comparison and Discussion --- p.31<br>Chapter 4 --- WSNB and RNB Conditions --- p.33<br>Chapter 4.1 --- Review of Results for Model 1 --- p.33<br>Chapter 4.2 --- Review of Results for Model 2 --- p.35<br>Chapter 4.3 --- New Results for Model 3 --- p.36<br>Chapter 4.3.1 --- Proof of Nonblocking Conditions --- p.36<br>Chapter 4.3.2 --- WSNB Routing Algorithm --- p.39<br>Chapter 4.3.3 --- Comparison and Discussion --- p.40<br>Chapter 4.4 --- New Results for Model 0 --- p.41<br>Chapter 4.4.1 --- Equivalence between RNB Condition and K-partite Vertex Coloring --- p.41<br>Chapter 4.4.2 --- Proof of Nonblocking Conditions --- p.43<br>Chapter 4.4.3 --- Comparison and Discussion --- p.47<br>Chapter 5 --- Conclusion and Future Work --- p.49<br>Bibliography --- p.52
42
Won, Hyung Suk. "Multicast in wireless networks." 2009. http://www.lib.ncsu.edu/theses/available/etd-11032009-155948/unrestricted/etd.pdf.
Full text
43
Jaff, Esua K., Misfa Susanto, Muhammad Ali, Prashant Pillai, and Yim Fun Hu. "Network coding for multicast communications over satellite networks." 2015. http://hdl.handle.net/10454/11128.
Full textAbstract:
No<br>Random packet errors and erasures are common in satellite
communications. These types of packet losses could become significant in
mobile satellite scenarios like satellite-based aeronautical communications
where mobility at very high speeds is a routine. The current adaptive coding
and modulation (ACM) schemes used in new satellite systems like the DVBRCS2
might offer some solutions to the problems posed by random packet
errors but very little or no solution to the problems of packet erasures where
packets are completely lost in transmission. The use of the current ACM
schemes to combat packet losses in a high random packet errors and erasures
environment like the satellite-based aeronautical communications will result in
very low throughput. Network coding (NC) has proved to significantly improve
throughput and thus saves bandwidth resources in such an environment. This
paper focuses on establishing how in random linear network coding (RLNC)
the satellite bandwidth utilization is affected by changing values of the
generation size, rate of packet loss and number of receivers in a satellite-based
aeronautical reliable IP multicast communication. From the simulation results,
it shows that the bandwidth utilization generally increases with increasing
generation size, rate of packet loss and number of receivers.
44
Zhou, Hu. "Content-based multicast in ad hoc networks." Thesis, 2000. http://hdl.handle.net/1957/32691.
Full textAbstract:
An important objective of tactical ad hoc networks is to deliver threat information
from sensors to shooters efficiently and quickly. The information sent
to a particular shooter should contain warnings about threats that are within
some distance and/or within some time of the shooter's current location. In this
thesis we develop a novel multicast model that distributes this form of threat
information in a message efficient manner. In addition, information about allied
force can also be distributed in a similar way. We present results from extensive
simulations that demonstrate the efficiency of our protocol and discuss the
scalability of this model to larger networks.<br>Graduation date: 2001
45
Ngo, Van Ngoc. "Congestion control for multicast /." 2005.
Find full textAbstract:
Thesis (M.Sc.)--York University, 2005. Graduate Programme in Computer Science and Engineering.<br>Typescript. Includes bibliographical references (leaves 139-145). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss &rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR11871
46
KUO, YU-PO, and 郭昱柏. "Communication Networks Supporting Arbitrary Multicast." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/38059110788896261908.
Full text
47
Xu, Jin. "Multicast in wireless mesh networks /." 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR29632.
Full textAbstract:
Thesis (M.Sc.)--York University, 2006. Graduate Programme in Computer Science and Engineering.<br>Typescript. Includes bibliographical references (leaves 128-132). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR29632
48
Chien, Chi-Hsin, and 簡琦欣. "Multicast Problems in Optical Networks." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/49984431410183955912.
Full textAbstract:
碩士<br>大葉大學<br>資訊工程學系碩士班<br>93<br>ABSTRACT
Optical Networks based on Wavelength Division Multiplexing （WDM）are the most promising
candidates for the next generation backbone networks. It offers a large bandwidth and
stability. Moreover, since multicast applications become increasingly popular, supporting
multicast at the WDM layer becomes an important topic. In this thesis, the construction of
light-trees for multicast communication in WDM networks with spare light splitting is
studied. A. Zsigri et al【1】proposed the S3P algorithm to solve this problem. Although some
wavelengths are saved in this algorithm, it often generates a large source-destination
delay. Therefore, we will propose a new algorithm SPTR to improve the S3P algorithm.
Key words：Wavelength Division Multiplexing, multicast, sparse light splitting, wavelength
channel.
49
Yen, Cheng-Pang, and 顏成邦. "Multicast Communications in Symmetric Networks." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/41023842154309699727.
Full textAbstract:
碩士<br>國立成功大學<br>資訊工程研究所<br>89<br>In this thesis we propose a new Hamiltonian cycle model to exploit the feature of the symmetric networks. Based on this model two efficient multicast routing algorithms, uniform multicast routing algorithm and fixed multicast routing algorithm, are developed. These multicast routing algorithms allow the multicast communication to utilize the channels uniformly in order to balance the path length of the message worms, making the multicasting more efficient in the symmetric networks. Then the Hamiltonian cycle model is mapped to torus and star networks. Thus the messages can be multicasted in these two networks using uniform and fixed multicast routing algorithms. The simulation results are also given to show the performance of these two multicast routing algorithms on the 2D/3D torus networks and the 6-star network. These two multicast routing algorithms do perform significantly faster multicasting than the Hamiltonian path based schemes on the symmetric networks. Besides providing the efficient multicast communication, the Hamiltonian cycle model only needs two sets of the virtual channels to avoid the deadlock. The Hamiltonian cycle model is really an efficient and economic strategy for multicasting in the symmetric networks.
Overview of Some Background Knowledge
Hamiltonian Cycle Model
Multicast Routing Algorithms
Hamiltonian Cycle Model in Torus and Star Networks
Performance Study
Conculsions and Future Work
50
Wang, Kai-Min, and 王凱民. "Multicast Support for Mobile Networks." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/06131748771457263925.
Full textAbstract:
碩士<br>國立中正大學<br>資訊工程研究所<br>87<br>In this paper, we propose a novel protocol, RBMoM (Range-Based Mobile
Multicast), which contains the key features of remote subscription and bi-directional tunneling, for mobile multicast support in IP networks. Remote subscription focuses on shortening the data delivery paths by trading off rising the cost of multicast tree maintenance; on the other hand, bi-directional tunneling has a static multicast tree and has no tree maintenance overhead by trading off lengthening the data delivery path. From the two protocols, there has to be a trade-off between the shortest path and the cost of the multicast tree maintenance. RBMoM intends to balance both by proposing Multicast Home Agents and the service range concepts. By adaptively controlling the service range, we can get the near-shortest paths between the source and mobile subscribers without paying too much cost in the tree maintenance. The shorter paths reduce the transmission latency.
Less frequent tree update saves the tree maintenance overhead. The simulation results show that RBMoM can adapt to the fluctuation of both host movement and the number of mobile group members, and has much better performance than above two approaches proposed for the mobile multicast problem.