Relevant bibliographies by topics / Multicast Networks

Academic literature on the topic 'Multicast Networks'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Multicast Networks"

1

Chen, Yue, Hongyong Jia, Kaixiang Huang, Julong Lan, and Xincheng Yan. "A Secure Network Coding Based on Broadcast Encryption in SDN." Mathematical Problems in Engineering 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/7145138.

Full text
Abstract:
By allowing intermediate nodes to encode the received packets before sending them out, network coding improves the capacity and robustness of multicast applications. But it is vulnerable to the pollution attacks. Some signature schemes were proposed to thwart such attacks, but most of them need to be homomorphic that the keys cannot be generated and managed easily. In this paper, we propose a novel fast and secure switch network coding multicast (SSNC) on the software defined networks (SDN). In our scheme, the complicated secure multicast management was separated from the fast data transmission based on the SDN. Multiple multicasts will be aggregated to one multicast group according to the requirements of services and the network status. Then, the controller will route aggregated multicast group with network coding; only the trusted switch will be allowed to join the network coding by using broadcast encryption. The proposed scheme can use the traditional cryptography without homomorphy, which greatly reduces the complexity of the computation and improves the efficiency of transmission.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhou, Ze Shun, Yi Xu, Jun Jie Yan, Zhong Wei Nie, and La Yuan Li. "A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks." Applied Mechanics and Materials 347-350 (August 2013): 553–58. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.553.

Full text
Abstract:
Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Huanlin, Qinren Shen, and Yong Chen. "An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks." International Journal of Optics 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/693807.

Full text
Abstract:
Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the formerKshortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.
APA, Harvard, Vancouver, ISO, and other styles
4

Si, Jing Jing. "A Hierarchical Multicast Scheme for Heterogeneous Receivers." Advanced Materials Research 108-111 (May 2010): 57–62. http://dx.doi.org/10.4028/www.scientific.net/amr.108-111.57.

Full text
Abstract:
We investigate inter-session network coding for networks with heterogeneous receivers in this paper. Based on layered source coding, we define the hierarchical inter-layer random network codes, and propose a hierarchical multicast scheme. Moreover, we compare our hierarchical multicast scheme with the layered multicast schemes in theory and with simulations. Simulation results show that our hierarchical multicast scheme can achieve the optimal aggregate throughput for some networks where the layered multicast schemes are suboptimal.
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Ling Xiu, and Ye Wen Cao. "Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks." Advanced Materials Research 204-210 (February 2011): 1399–402. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1399.

Full text
Abstract:
IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.
APA, Harvard, Vancouver, ISO, and other styles
6

Hussen, Hassen Redwan, Sung-Chan Choi, Jong-Hong Park, and Jaeho Kim. "Predictive geographic multicast routing protocol in flying ad hoc networks." International Journal of Distributed Sensor Networks 15, no. 7 (July 2019): 155014771984387. http://dx.doi.org/10.1177/1550147719843879.

Full text
Abstract:
In the past decades, the unmanned aerial systems have been utilized only for military operations. However, recently, the potential uses and applicability of unmanned aerial vehicles (commonly known as drones) in civilian application domains are becoming a fast-growing phenomenon. A flying ad hoc network is a wireless ad hoc network specifically designed for the communication of unmanned aerial vehicles. Multicast routing is one of the vital aspects in wireless ad hoc networks. Using multicast transmission approaches, flying ad hoc network applications may need to send the same message to a specific group of flying nodes. The multicast communication approaches can benefit flying ad hoc network applications in conserving the scarce resources of flying nodes. Research works have been proposed to tackle the challenges in multicast routing with multi-hop communication in ad hoc network environments. Nevertheless, the conventional multicast routing mechanisms incur excessive control message overhead when a large number of nodes experience frequent topological changes. A scalable geographic multicast routing mechanism, which specially require localized operation and reduced control packet overhead, is necessary. Multicast routing in flying ad hoc networks is extremely challenging because of the dynamic topology changes and network disconnection resulted from frequent mobility of nodes. In this article, we present and implement a scalable and predictive geographic multicast routing mechanism in flying ad hoc networks. In uniform and random deployment scenarios, the MATLAB-based evaluation result has revealed that when the communication range increases, the probability of finding one-hop predicted forwarders to reach multicast destinations also increases. The implementation of scalable and predictive geographic multicast routing mechanism in flying ad hoc network is done using Optimizing Network Engineering Tools Modeler 16.0. We have added the scalable and predictive geographic multicast routing mechanism in flying ad hoc network as a new routing scheme in the Mobile Ad hoc Network routing protocol groups of the Optimizing Network Engineering Tools Modeler. Then, the performance of scalable and predictive geographic multicast routing mechanism in flying ad hoc network is compared with two of the existing Mobile Ad hoc Network routing protocols (Geographic Routing Protocol and Dynamic Source Routing). Eventually, we present two instance scenarios regarding the integration of scalable and predictive geographic multicast routing mechanism in flying ad hoc network scheme in the Internet of Things platform.
APA, Harvard, Vancouver, ISO, and other styles
7

Yue, Xue Jun, Tian Sheng Hong, Kun Cai, and Jia Nian Li. "Study on Schemes for Seamless Multicast Handover in the Proxy Mobile IPv6 Based on Wireless Networks." Advanced Materials Research 129-131 (August 2010): 1405–9. http://dx.doi.org/10.4028/www.scientific.net/amr.129-131.1405.

Full text
Abstract:
The research was carried on centered about the key technology in the Proxy Mobile Ipv6 networks. The frame based on multi-level domains multicast agent was proposed. And the multi-level domains multicast agent who can be collocated easily was also introduced. The different service area of multi-level domains multicast agent is overlapped which can avoid “single point of failure.” The router advertisements of Ipv6 discovered the dynamic change of availed multi-level domains multicast agent and network topology. An ASMM (Auto Study Mobile Multicast) program was proposed on the based frame of multi-level domains multicast agent. The way of sending multicast data in outer region can be chosen neatly taking advantage of the number of mobile host in outer region according to the network situation in this program instead of sending multicast data in only one mode which achieved seamless handover. In recent years, the rapid development of internet and mobile networks makes people demand the combination of internet and mobile networks more and more eagerly which can provide extensive business for mobile users. And multicast is a very promising technology in mobile network. It can enable a group of mobile users to receive the message from the same business source at the same time which improved network efficiency greatly [1]. The mobile multicast technology is facing many problems. Firstly, all multicast technology was designed for fixed host; the multicast tree established on these agreements can be changed easily. And it will cost much if it is changed; Secondly, The mobile multicast technology not only considers the dynamic change of every group members but also the location dynamic change of every group members [2, 3]. So, the mobile multicast technology is a research focus at present. IETF and many researchers proposed much mobile multicast agreement. But these agreements have different inadequateness.
APA, Harvard, Vancouver, ISO, and other styles
8

Daru, Pan, and Zhang Han. "Wireless Multicast Opportunistic Routing with Dual Network Coding." Key Engineering Materials 474-476 (April 2011): 1173–78. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.1173.

Full text
Abstract:
Wireless Multicast is one of the important problems with applications to opportunistic networks, such as delay-tolerant networks (DTNs), personal, pocket-switched networks (PSNs) etc. Network Coding has received many attentions because it improves potential network throughput and robustness by the way of combining multiple packets in the routers and reducing the transmissions. This paper combines network coding with opportunistic routing to improve the throughput of wireless multicast, where an Inter-coding and Intra-coding scheme is introduced to the traditional multicast routing algorithm (OR-DNC, Opportunistic Routing with Dual Network Coding). Compared with traditional multicast routing without coding and MORE-M, OR-DNC performs better in terms of throughput, transmission reduction and coding gain.
APA, Harvard, Vancouver, ISO, and other styles
9

Yin, Wen Hua, Xiang Yu Bai, and Xue Bin Ma. "Multicast Routing Protocols in Delay Tolerant Networks." Applied Mechanics and Materials 614 (September 2014): 490–96. http://dx.doi.org/10.4028/www.scientific.net/amm.614.490.

Full text
Abstract:
Delay Tolerant Networks (DTNs) are characterized by intermittent connectivity, frequent partitions and extremely high latency. As a result, multicast routing protocols are difficult to implement in DTNs. Multicast can not only save network bandwidth, but also can reduce communication cost and improve the efficiency of data transfer. In recent years, various multicast routing protocols are proposed for DTNs. In order to provide a comprehensive understanding of these multicast routing protocols designed for DTNs, a survey of the multicast routing protocols was discussed in this paper. We analyzed two types of multicast routing protocols: the knowledge-based multicast routing protocol and the probability-based multicast protocol. We conclude the future research directions by discussing the advantages and disadvantages of various multicast routing protocols for DTNs, and provide some reference value for the further studies of multicast routing protocols of DTNs. Furthermore, in order to resolve the existing problems of DTNs (such as energy optimization); we will propose a social-aware energy constrained multicast routing algorithm in the future.
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Guozhi, Songtao Guo, Guiyan Liu, and Yuanyuan Yang. "Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks." Complexity 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/7563170.

Full text
Abstract:
Multicast can improve network performance by eliminating unnecessary duplicated flows in the data center networks (DCNs). Thus it can significantly save network bandwidth. However, the network multicast blocking may cause the retransmission of a large number of data packets and seriously influence the traffic efficiency in data center networks, especially in the fat-tree DCNs with multirooted tree structure. In this paper, we build a multicast blocking model and apply it to solve the problem of network blocking in the fat-tree DCNs. Furthermore, we propose a novel multicast scheduling strategy. In the scheduling strategy, we select the uplink connecting to available core switch whose remaining bandwidth is close to and greater than the three times of bandwidth multicast requests so as to reduce the operation time of the proposed algorithm. Then the blocking probability of downlink in the next time-slot is calculated in multicast subnetwork by using Markov chains theory. With the obtained probability, we select the optimal downlink based on the available core switch. In addition, theoretical analysis shows that the multicast scheduling algorithm has close to zero network blocking probability as well as lower time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multicast Networks"

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 text
Abstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 34-37). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 43).
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.
by Anna H. Lee.
M.Eng.and S.B.
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 71-77). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
4

Jawhar, Shadi. "Multicast over optical networks." Rennes 1, 2011. http://www.theses.fr/2011REN1S051.

Full text
Abstract:
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
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
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 59-62). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Fulu 1970. "Cooperative multicast in wireless networks." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/32507.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2005.
Includes bibliographical references (p. 102-106).
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.
by Fulu Li.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
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
APA, Harvard, Vancouver, ISO, and other styles
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
APA, Harvard, Vancouver, ISO, and other styles
9

alyanbaawi, ashraf. "DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
10

Akkor, Gün. "Multicast communication support over satellite networks." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2452.

Full text
Abstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2005.
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Multicast Networks"

1

Developing IP multicast networks. Indianapolis, IN: Cisco Press, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Miller, C. Kenneth. Multicast networking and applications. Reading, Mass: Addison-Wesley, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

service), SpringerLink (Online, ed. A Primer of Multicast Routing. Boston, MA: Springer US, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wittmann, Ralph. Multicast communication: Protocols and applications. San Francisco, CA: Morgan Kaufmann, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dempsey, Bert J. A reliable multicast for XTP. [Houston, Tex.?]: Research Institute for Computing and Information Systems, University of Houston-Clear Lake, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ahamad, Mustaque. Multicast communication in distributed systems. Los Alamitos, Calif: IEEE Computer Society Press, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Deploying IP multicast in the enterprise. Upper Saddle River, NJ: Prentice Hall PTR, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Srinivas, Mulugu, ed. Deploying next generation multicast-enabled applications: Label switched multicast for MPLS VPNs, VPLS, and wholesale Ethernet. Burlington, MA: Morgan Kaufmann, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Abderrahim, Benslimane, ed. Multimedia multicast on the Internet. London: ISTE, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

L, Montgomery Todd, Whetten Brian, and United States. National Aeronautics and Space Administration., eds. Reliable multicast protocol specifications packet formats. [Washington, D.C.]: National Aeronautics and Space Administration, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Multicast Networks"

1

Rosti, Emilia. "IP Multicast." In Handbook of Computer Networks, 407–16. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118256114.ch27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kim, Dongsoo S. "Multicast Switching Networks." In Network Theory and Applications, 277–306. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4613-0281-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jia, Xiaohua, Xiao-Dong Hu, and Ding-Zhu Du. "QоS Guaranteed Multicast." In Multiwavelength Optical Networks, 193–234. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3563-5_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jeon, Seil. "Mobilty in Multicast." In Encyclopedia of Wireless Networks, 899–903. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-78262-1_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jeon, Seil. "Mobilty in Multicast." In Encyclopedia of Wireless Networks, 1–5. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-32903-1_16-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Graves, Rory, and Ian Wakeman. "ATOM - Active Totally Ordered Multicast." In Active Networks, 171–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40057-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rosenberg, Eric. "Multicast Virtual Private Networks." In SpringerBriefs in Computer Science, 97–112. Boston, MA: Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-1873-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kim, Dongsoo S., and Ding-Zhu Du. "Multirate Multicast Switching Networks." In Lecture Notes in Computer Science, 219–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-68535-9_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sedano, Marifeli, Arturo Azcorra, and María Calderón. "Performance of Active Multicast Congestion Control." In Active Networks, 145–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40057-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yamamoto, Lidia, and Guy Leduc. "An Active Layered Multicast Adaptation Protocol." In Active Networks, 180–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40057-5_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multicast Networks"

1

"Multicast." In Proceedings. 2006 31st IEEE Conference on Local Computer Networks. IEEE, 2006. http://dx.doi.org/10.1109/lcn.2006.322140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tolkas, Michail, Michail Bletsas, and Pantelis Angelidis. "Handling Multicast Video over Non Multicast Networks." In 2011 15th Panhellenic Conference on Informatics (PCI). IEEE, 2011. http://dx.doi.org/10.1109/pci.2011.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vieira, Fausto, and Joao Barros. "Network Coding Multicast in Satellite Networks." In 2009 Next Generation Internet Networks (NGI). IEEE, 2009. http://dx.doi.org/10.1109/ngi.2009.5175769.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hauge, Mariann, and Øyvind Kure. "Multicast in 3G networks:." In the 5th ACM international workshop. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/570790.570807.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Begic, Zlatan, and Melika Bolic. "Security in Multicast Networks." In 2008 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT). IEEE, 2008. http://dx.doi.org/10.1109/isspit.2008.4775642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yujie Wan and Tony T. Lee. "Nonblocking multicast Clos networks." In 2010 19th Annual Wireless and Optical Communications Conference (WOCC 2010). IEEE, 2010. http://dx.doi.org/10.1109/wocc.2010.5510622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Feizi, Soheil, Daniel E. Lucani, Chres W. Sorensen, Ali Makhdoumi, and Muriel Medard. "Tunable sparse network coding for multicast networks." In 2014 International Symposium on Network Coding (NetCod). IEEE, 2014. http://dx.doi.org/10.1109/netcod.2014.6892129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, A. H., and M. Medard. "Simplified random network codes for multicast networks." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523640.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ho, T., B. Leong, Yu-Han Chang, Yonggang Wen, and R. Koetter. "Network monitoring in multicast networks using network coding." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523691.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ohta, M., and J. Crowcroft. "Static Internet multicast." In IEE Colloquium on Shaping Tomorrow's Networks: Trends in Network Architectures for Delivering Present and Future Services. IEE, 1998. http://dx.doi.org/10.1049/ic:19980495.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Multicast Networks"

1

Wolf, Tilman, and Sumi Y. Choi. Aggregated Hierarchical Multicast for Active Networks. Fort Belvoir, VA: Defense Technical Information Center, January 2005. http://dx.doi.org/10.21236/ada436160.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bless, R., and K. Wehrle. IP Multicast in Differentiated Services (DS) Networks. RFC Editor, April 2004. http://dx.doi.org/10.17487/rfc3754.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pusateri, T. IP Multicast over Token-Ring Local Area Networks. RFC Editor, June 1993. http://dx.doi.org/10.17487/rfc1469.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ren, Wei, Xiangyang Xiao, and Qing Zhao. Minimum-Energy Multicast Tree in Cognitive Radio Networks. Fort Belvoir, VA: Defense Technical Information Center, September 2009. http://dx.doi.org/10.21236/ada554825.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Jianchao, and Yuanyuan Yang. Scalable Multicast Networks for High-Performance Computing and Communications. Fort Belvoir, VA: Defense Technical Information Center, January 2001. http://dx.doi.org/10.21236/ada394378.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Symington, Susan, Robert C. Durst, and Keith Scott. Custodial Multicast in Delay Tolerant Networks: Challenges and Approaches. Fort Belvoir, VA: Defense Technical Information Center, January 2006. http://dx.doi.org/10.21236/ada463904.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hui, J., and R. Kelsey. Multicast Protocol for Low-Power and Lossy Networks (MPL). RFC Editor, February 2016. http://dx.doi.org/10.17487/rfc7731.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Armitage, G. Support for Multicast over UNI 3.0/3.1 based ATM Networks. RFC Editor, November 1996. http://dx.doi.org/10.17487/rfc2022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

van der Stok, P., and R. Cragie. Forwarder Policy for Multicast with Admin-Local Scope in the Multicast Protocol for Low-Power and Lossy Networks (MPL). RFC Editor, February 2016. http://dx.doi.org/10.17487/rfc7732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Morin, T., ed. Requirements for Multicast in Layer 3 Provider-Provisioned Virtual Private Networks (PPVPNs). RFC Editor, April 2007. http://dx.doi.org/10.17487/rfc4834.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Multicast Networks' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography