Log in

Relevant bibliographies by topics / Multicasting (Computer networks) / Journal articles

To see the other types of publications on this topic, follow the link: Multicasting (Computer networks).

Journal articles on the topic 'Multicasting (Computer networks)'

Author: Grafiati

Published: 4 June 2021

Last updated: 31 July 2024

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Multicasting (Computer 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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

XU, YINLONG, LI LIN, GUOLIANG CHEN, YINGYU WAN, and WEIJUN GUO. "MULTICASTING AND BROADCASTING IN UNDIRECTED WDM NETWORKS AND QoS EXTENTIONS OF MULTICASTING." International Journal of Foundations of Computer Science 15, no. 01 (February 2004): 187–203. http://dx.doi.org/10.1142/s0129054104002376.

Full text

Abstract:

This paper addresses multicasting and broadcasting in undirected WDM networks and QoS extensions of multicasting. It is given an undirected network G=(V, E), with Λ is the set of the available wavelengths in G, and associated with each edge, there is a subset of wavelengths on it. For a multicast request r=(s, D) with a source s and a set D of destinations, it is to find a tree rooted at s including all nodes in D such that the cost of the tree is minimized in terms of the cost of wavelength conversion at nodes and the cost of using wavelength on edges. This paper proves that multicasting in this model of networks is NP-Hard and cannot be approximated within a constant factor, unless P=NP. Furthermore, an auxiliary graph is constructed for the original WDM network, the multicasting is reduced to a group Steiner tree problem on the auxiliary graph and an approximate algorithm based on the group Steiner tree algorithm proposed by M. Charikar et al. with performance ratio of O( log 2(nk) log log (nk) log p) is provided, where k=|Λ| and p=|D∪{s}|. At last, some QoS extensions of multicasting are discussed.

APA, Harvard, Vancouver, ISO, and other styles

2

Borella, A. "Linear multicasting in dynamic networks." Computer Communications 22, no. 13 (August 1999): 1217–26. http://dx.doi.org/10.1016/s0140-3664(99)00105-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Khan, Faheem, Shabir Ahmad, Hüseyin Gürüler, Gurcan Cetin, Taegkeun Whangbo, and Cheong-Ghil Kim. "An Efficient and Reliable Algorithm for Wireless Sensor Network." Sensors 21, no. 24 (December 14, 2021): 8355. http://dx.doi.org/10.3390/s21248355.

Full text

Abstract:

In wireless sensor networks (WSN), flooding increases the reliability in terms of successful transmission of a packet with higher overhead. The flooding consumes the resources of the network quickly, especially in sensor networks, mobile ad-hoc networks, and vehicular ad-hoc networks in terms of the lifetime of the node, lifetime of the network, and battery lifetime, etc. This paper aims to develop an efficient and reliable protocol by using multicasting and unicasting to overcome the issue of higher overhead due to flooding. Unicasting is used when the desired destination is at a minimum distance to avoid an extra overhead and increases the efficiency of the network in terms of overhead and energy because unicasting is favorable where the distance is minimum. Similarly, multicasting is used when the desired destination is at maximum distance and increases the network’s reliability in terms of throughput. The results are implemented in the Department of Computer Science, Bacha Khan University Charsadda (BKUC), Pakistan, as well as in the Network Simulator-2 (NS-2). The results are compared with benchmark schemes such as PUMA and ERASCA, and based on the results, the performance of the proposed approach is improved in terms of overhead, throughput, and packet delivery fraction by avoiding flooding.

APA, Harvard, Vancouver, ISO, and other styles

4

Sun, Shimin, Xinchao Zhang, Wentian Huang, Aixin Xu, Xiaofan Wang, and Li Han. "QoS-Based Multicast Routing in Network Function Virtualization-Enabled Software-Defined Mobile Edge Computing Networks." Mobile Information Systems 2021 (April 15, 2021): 1–12. http://dx.doi.org/10.1155/2021/5590963.

Full text

Abstract:

Mobile Edge Computing (MEC) technology brings the unprecedented computing capacity to the edge of mobile network. It provides the cloud and end user swift high-quality services with seamless integration of mobile network and Internet. With powerful capability, virtualized network functions can be allocated to MEC. In this paper, we study QoS guaranteed multicasting routing with Network Function Virtualization (NFV) in MEC. Specifically, data should pass through a service function chain before reaching destinations along a multicast tree with minimal computational cost and meeting QoS requirements. Furthermore, to overcome the problems of traditional IP multicast and software-defined multicasting approaches, we propose an implementable multicast mechanism that delivers data along multicast tree but uses unicast sessions. We finally evaluate the performance of the proposed mechanism based on experimental simulations. The results show that our mechanism outperforms others reported in the literature.

APA, Harvard, Vancouver, ISO, and other styles

5

Hirota, Yuichi, and Masaki Owari. "Asymmetric Quantum Multicast Network Coding: Asymmetric Optimal Cloning over Quantum Networks." Applied Sciences 12, no. 12 (June 17, 2022): 6163. http://dx.doi.org/10.3390/app12126163.

Full text

Abstract:

Multicasting of quantum states is an essential feature of quantum internet. Since the noncloning theorem prohibits perfect cloning of an unknown quantum state, an appropriate protocol may depend on the purpose of the multicast. In this paper, we treat the multicasting of a single copy of an unknown state over a quantum network with free classical communication. We especially focus on protocols exactly multicasting an asymmetric optimal universal clone. Hence, these protocols are optimal and universal in terms of mean fidelity between input and output states, but the fidelities can depend on target nodes. Among these protocols, a protocol spending smaller communication resources is preferable. Here, we construct such a protocol attaining the min-cut of the network described as follows. Two (three) asymmetric optimal clones of an input state are created at a source node. Then, the state is divided into classical information and a compressed quantum state. The state is sent to two (three) target nodes using the quantum network coding. Finally, the asymmetric clones are reconstructed using LOCC with a small amount of entanglement shared among the target nodes and the classical information sent from the source node.

APA, Harvard, Vancouver, ISO, and other styles

6

Rathore, Prateek, Kalpana Dhaka, and Sanjay K. Bose. "Network coding assisted multicasting in multi-hop wireless networks." Computer Communications 138 (April 2019): 45–53. http://dx.doi.org/10.1016/j.comcom.2019.02.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kumar, Kamlesh, and Bobby Sharma. "Multicasting Model for Efficient Data Transmission in VANET." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 7s (July 13, 2023): 408–14. http://dx.doi.org/10.17762/ijritcc.v11i7s.7016.

Full text

Abstract:

VANETs (Vehicle Ad hoc Networks) are networks made up of a number of vehicular nodes that are free to enter and leave the network. The Location Aided Routing (LAR) protocol is the one that is most frequently utilized among them. Here, the route request packets are flooded across many pathways to the source node using the broadcasting strategy. The vehicles that have a direct path to the destination send the route reply packets back to the source. The least number of hops and the sequence number are used to determine the route from source to destination. This research study has used the multicasting approach to construct a path from the source node to the destination node. Within this multicasting strategy, the root nodes from the network are selected for data routing. The path between the source and the destination is chosen using a root node. The suggested approach is put into practice using the NS2, and some parametric values are computed to produce analytical findings.

APA, Harvard, Vancouver, ISO, and other styles

8

Peng, Yunfeng, Weisheng Hu, Weiqiang Sun, Xiaodong Wang, and Yaohui Jin. "Impairment constraint multicasting in translucent WDM networks: architecture, network design and multicasting routing." Photonic Network Communications 13, no. 1 (September 9, 2006): 93–102. http://dx.doi.org/10.1007/pl00022065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Peng, Yunfeng, Weisheng Hu, Weiqiang Sun, Xiaodong Wang, and Yaohui Jin. "Impairment constraint multicasting in translucent WDM networks: architecture, network design and multicasting routing." Photonic Network Communications 13, no. 1 (September 9, 2006): 93–102. http://dx.doi.org/10.1007/s11107-006-0018-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Shukla, Manish Kumar, and A. Yavuz Oruc. "Multicasting in Quantum Switching Networks." IEEE Transactions on Computers 59, no. 6 (June 2010): 735–47. http://dx.doi.org/10.1109/tc.2010.52.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bhattacharya, S., G. Elsesser, W. T. Tsai, and D. Z. Du. "Multicasting in Generalized Multistage Interconnection Networks." Journal of Parallel and Distributed Computing 22, no. 1 (July 1994): 80–95. http://dx.doi.org/10.1006/jpdc.1994.1071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

HEMMINGER, THOMAS L., and CARLOS A. POMALAZA-RAEZ. "USING NEURAL NETWORKS TO SOLVE THE MULTICAST ROUTING PROBLEM IN PACKET RADIO NETWORKS." International Journal of Neural Systems 07, no. 05 (November 1996): 617–26. http://dx.doi.org/10.1142/s0129065796000609.

Full text

Abstract:

The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the packet delay at each node, then the problem becomes one of finding solutions which require the least number of transmissions. Determination of an optimal solution is NP-complete meaning that suboptimal solutions are frequently tolerated. The problem becomes more rigorous if packet delays are included in the network topology. This paper describes a practical technique for the computation of optimum or near optimum solutions to the multicasting problem with and without packet delay. The method is based on the Hopfield neural network and experiment has shown this method to yield near optimal solutions while requiring a minimum of CPU time.

APA, Harvard, Vancouver, ISO, and other styles

13

Chen, X., L. E. Moser, and P. M. Melliar-Smith. "Totally ordered gigabit multicasting." Distributed Systems Engineering 4, no. 4 (December 1997): 229–43. http://dx.doi.org/10.1088/0967-1846/4/4/005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Yang, Baijian, and Prasant Mohapatra. "Multicasting in MPLS domains." Computer Communications 27, no. 2 (February 2004): 162–70. http://dx.doi.org/10.1016/s0140-3664(03)00212-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Hamad, Ashraf, Tao Wu, Ahmed E. Kamal, and Arun K. Somani. "On multicasting in wavelength-routing mesh networks." Computer Networks 50, no. 16 (November 2006): 3105–64. http://dx.doi.org/10.1016/j.comnet.2005.12.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Köksal, Fatih, and Cem Ersoy. "Multicasting for all-optical multifiber networks." Journal of Optical Networking 6, no. 2 (2007): 219. http://dx.doi.org/10.1364/jon.6.000219.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Polacek, Pavol, Ting-Yeu Yang, and Chih-Wei Huang. "Opportunistic multicasting for single frequency networks." Wireless Communications and Mobile Computing 16, no. 15 (June 22, 2016): 2253–62. http://dx.doi.org/10.1002/wcm.2680.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

ZHANG, LIN, DONGXU SHEN, XIUMING SHAN, and VICTOR O. K. LI. "AN ANT-BASED MULTICASTING PROTOCOL IN MOBILE AD-HOC NETWORK." International Journal of Computational Intelligence and Applications 05, no. 02 (June 2005): 185–99. http://dx.doi.org/10.1142/s1469026805001568.

Full text

Abstract:

Multicasting protocols deliver data packets from a source node to multiple receivers, and serve a very important function in mobile ad-hoc networks (MANETs). In this paper, a novel receiver-initiated soft-state probabilistic multicasting protocol (RISP) for MANETs is proposed. RISP is inspired by the ant colony's route-seeking mechanism, in which an individual ant chooses the optimal path to its destination through cooperation with others in a totally distributed manner. Imitating the behaviour of ants in nature, RISP introduces probabilistic forwarding and soft-state for making relay decisions that are automatically adaptive to node mobility in MANETs. Compared with other protocols, we show by computer simulations that RISP has lower delivery redundancy, while achieving higher delivery ratio at all mobility scenarios. Furthermore, RISP has lower control overhead.

APA, Harvard, Vancouver, ISO, and other styles

19

TAYU, SATOSHI, TURKI GHAZI AL-MUTAIRI, and SHUICHI UENO. "COST-CONSTRAINED MINIMUM-DELAY MULTICASTING." Journal of Interconnection Networks 09, no. 01n02 (March 2008): 141–55. http://dx.doi.org/10.1142/s0219265908002205.

Full text

Abstract:

We consider a problem of cost-constrained minimum-delay multicasting in a network, which is to find a Steiner tree spanning the source and destination nodes such that the maximum total delay along a path from the source node to a destination node is minimized, while the sum of link costs in the tree is bounded by a constant. The problem is NP-hard even if the network is series-parallel. We present a fully polynomial time approximation scheme for the problem if the network is series-parallel.

APA, Harvard, Vancouver, ISO, and other styles

20

S, Seetha, Esther Daniel, S. Durga, Jennifer Eunice R, and Andrew J. "PDSCM: Packet Delivery Assured Secure Channel Selection for Multicast Routing in Wireless Mesh Networks." Technologies 11, no. 5 (September 18, 2023): 130. http://dx.doi.org/10.3390/technologies11050130.

Full text

Abstract:

The academic and research communities are showing significant interest in the modern and highly promising technology of wireless mesh networks (WMNs) due to their low-cost deployment, self-configuration, self-organization, robustness, scalability, and reliable service coverage. Multicasting is a broadcast technique in which the communication is started by an individual user and is shared by one or multiple groups of destinations concurrently as one-to-many allotments. The multicasting protocols are focused on building accurate paths with proper channel optimization techniques. The forwarder nodes of the multicast protocol may behave with certain malicious characteristics, such as dropping packets, and delayed transmissions that cause heavy packet loss in the network. This leads to a reduced packet delivery ratio and throughput of the network. Hence, the forwarder node validation is critical for building a secure network. This research paper presents a secure forwarder selection between a sender and the batch of receivers by utilizing the node’s communication behavior. The parameters of the malicious nodes are analyzed using orthogonal projection and statistical methods to distinguish malicious node behaviors from normal node behaviors based on node actions. The protocol then validates the malicious behaviors and subsequently eliminates them from the forwarder selection process using secure path finding strategies, which lead to dynamic and scalable multicast mesh networks for communication.

APA, Harvard, Vancouver, ISO, and other styles

21

Wang, San Yuan. "Scheduled shared-tree multicasting for Bluetooth networks." International Journal of Wireless and Mobile Computing 1, no. 1 (2005): 78. http://dx.doi.org/10.1504/ijwmc.2005.008058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Bhattacharjee, Sangeeta, Tamaghna Acharya, and Uma Bhattacharya. "NOMA inspired multicasting in cognitive radio networks." IET Communications 12, no. 15 (September 18, 2018): 1845–53. http://dx.doi.org/10.1049/iet-com.2018.5335.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Xiang, Zhengzheng, Meixia Tao, and Xiaodong Wang. "Massive MIMO Multicasting in Noncooperative Cellular Networks." IEEE Journal on Selected Areas in Communications 32, no. 6 (June 2014): 1180–93. http://dx.doi.org/10.1109/jsac.2014.2328144.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Mir, Nader F., Kevin D. Donohue, and Yusuf M. Matcheswala. "Efficient architectures and algorithms for multicasting data in computer communication networks." Computer Communications 24, no. 15-16 (October 2001): 1618–25. http://dx.doi.org/10.1016/s0140-3664(01)00319-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Wu, Shibo, and K. Selçuk Candan. "Demand-scalable geographic multicasting in wireless sensor networks." Computer Communications 30, no. 14-15 (October 2007): 2931–53. http://dx.doi.org/10.1016/j.comcom.2007.05.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Szarkowicz, Krzysztof, Gábor Fodor, András Faragó, and Tamás Henk. "Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks." SIMULATION 68, no. 1 (January 1997): 34–43. http://dx.doi.org/10.1177/003754979706800108.

Full text

Abstract:

This paper begins with an overview of multicast algorithms, which are the most promising candidates to be in wide use in first generation Asynchronous Transfer Mode (ATM) based Broadband Integrated Services Digital Networks (B-ISDN). Since the Multiple Destination Routing (MDR) problem and the associated Steiner Tree problem are known to be NP-complete and therefore a number of heuristic algorithms have been proposed in the literature, we first need to establish which of these are the best candidates for the B-ISDN. We conclude that the weighted greedy -type algorithms are promising ones, and therefore we examine the behavior of these algorithms in terms of blocking probability and network utilization. In doing so, we use a B-ISDN call level simulation program, which proves to be an indispensable tool in the quest for efficient multicast algorithms. We find that shortest path routing with appropriate (adaptive) weight functions combined with the complete partitioning link allocation policy may give satisfactory blocking values and good network utilization in networks of different sizes.

APA, Harvard, Vancouver, ISO, and other styles

27

GALDI, CLEMENTE, CHRISTOS KAKLAMANIS, MANUELA MONTANGERO, and GIUSEPPE PERSIANO. "STATION PLACEMENT IN NETWORKS." Parallel Processing Letters 15, no. 01n02 (March 2005): 117–29. http://dx.doi.org/10.1142/s0129626405002106.

Full text

Abstract:

In this paper we study the Station Placement problem on directed graphs, a problem that has applications to efficient multicasting in circuit-switched networks. We first argue that the problem on general directed graphs can be efficiently reduced to computing bounded depth Steiner tree on complete weighted directed graphs. Then, we concentrate on the case in which the graph is a directed tree and we give polynomial time algorithms to solve the problem and a natural variant of the problem.

APA, Harvard, Vancouver, ISO, and other styles

28

Guo, Yijun, Jing Gao, and Jianjun Hao. "Exploiting the User-Level Interference Based on Network Coding in D2D Underlaid Cellular Networks." Mobile Information Systems 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/142967.

Full text

Abstract:

Interference is an important and challenging problem faced by the D2D underlaid cellular networks. In this paper, we focus on the user-level interference under multicasting scenarios. Rather than the traditional pairwise way of D2D communications, we propose to implement the information exchanging through a groupwise way. Through introducing the idea of network coding, the proposed scheme is able to utilize the interference as valid signals to enhance the receiving performance, instead of only managing or controlling it. Both theoretical analysis and simulation results prove that the proposed scheme achieves better SINR performance and lower resources occupation than the traditional pairwise D2D transmission schemes.

APA, Harvard, Vancouver, ISO, and other styles

29

Pankaj, R. K. "Wavelength requirements for multicasting in all-optical networks." IEEE/ACM Transactions on Networking 7, no. 3 (June 1999): 414–24. http://dx.doi.org/10.1109/90.779211.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Xiang, Xiaojing, Xin Wang, and Yuanyuan Yang. "Stateless Multicasting in Mobile Ad Hoc Networks." IEEE Transactions on Computers 59, no. 8 (August 2010): 1076–90. http://dx.doi.org/10.1109/tc.2010.102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Lua, Eng Keong, Xiaoming Zhou, Jon Crowcroft, and Piet Van Mieghem. "Scalable multicasting with network-aware geometric overlay." Computer Communications 31, no. 3 (February 2008): 464–88. http://dx.doi.org/10.1016/j.comcom.2007.08.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Yuan, Peiyan, Ming Li, Shuhong Li, Chunhong Liu, and Xiaoyan Zhao. "Maximizing the Capacity of Edge Networks with Multicasting." Applied Sciences 13, no. 14 (July 21, 2023): 8424. http://dx.doi.org/10.3390/app13148424.

Full text

Abstract:

Edge networks employ local computing and caching resources to process data, thus alleviating the bandwidth pressure on backbone networks and improve users’ quality of experience. System capacity is one of the key metrics to evaluate the performance of edge networks. However, maximizing system capacity in edge scenarios faces challenges due to the dynamical user sessions and the changing content popularity. This study reports on the influence of multicast communication on the capacity of edge caching networks. When large amounts of content are requested simultaneously or over a short period, one-to-one unicast transmission will consume copious network resources due to repetitious transmission. To solve this problem, this study used the one-to-many multicast scheme to realize cooperative transmission between edge servers. First, multiple copies of the content are distributed to multiple small base stations (SBSs) based on the content’s popularity and the SBSs’ cache sizes. Second, a multicast tree is constructed by using, as the root node, the SBS that stores the content. Third, the content is transmitted along the path of the multicast tree to each end-user. Finally, a simulation platform is constructed to analyze the performance of the two transmission schemes. The results of simulating on edge caching networks show that multicast communication responds well to users’ requests even when the requested content requires sudden transmission, is highly popular or is requested often within short time. This system’s capacity has been significantly improved compared to the classical methods.

APA, Harvard, Vancouver, ISO, and other styles

33

Sheta, Khalid H., and Mukesh Singhal. "Scheduling support for multicasting sessions in broadband communication networks." Computer Networks 31, no. 1-2 (January 1999): 141–50. http://dx.doi.org/10.1016/s0169-7552(98)00236-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bani-Bakr, Alaa, Mhd Nour Hindia, Kaharudin Dimyati, Zati Bayani Zawawi, and Tengku Faiz Tengku Mohmed Noor Izam. "Caching and Multicasting for Fog Radio Access Networks." IEEE Access 10 (2022): 1823–38. http://dx.doi.org/10.1109/access.2021.3137148.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Fan, Fujie, Bing Hu, Kwan L. Yeung, and Minjian Zhao. "MiniForest: Distributed and Dynamic Multicasting in Datacenter Networks." IEEE Transactions on Network and Service Management 16, no. 3 (September 2019): 1268–81. http://dx.doi.org/10.1109/tnsm.2019.2927721.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

He, Jingyi, Danny H. K. Tsang, and S. H. Gary Chan. "Multicasting in WDM networks with heterogeneous group weights." Journal of Optical Networking 3, no. 7 (2004): 534. http://dx.doi.org/10.1364/jon.3.000534.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ast, László, Tibor Cinkler, Gábor Fodor, Sándor Rácz, and Søren Blaabjerg. "Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks." SIMULATION 68, no. 1 (January 1997): 56–63. http://dx.doi.org/10.1177/003754979706800106.

Full text

Abstract:

For the end-to-end (Originator-Destination pair) call blocking probability computation in multirate loss networks the so-called reduced load approximation under link independence assumption is often used, because it allows the derivation of analytical and numerical results. Its accuracy and extendibility to multirouting or multicasting networks (like me B-ISDN), however, is seldom studied. This paper attempts to generalize this assumption and to assess the usefulness of this generalization by comparing simulation and approximation results on link, route, and end-to-end blocking probability evaluation for these kinds of networks. The accuracy of the approximation is examined by a simulation tool called Flexible Simulation Platform for ATM Networks. An important application example of this generalized link-, route- and Originator-Destination pair blocking measure is the formulation of an optimization model for multirate loss networks, which optimizes carried traffic and network revenue.

APA, Harvard, Vancouver, ISO, and other styles

38

Li, Zhi, and Prasant Mohapatra. "QoS-aware multicasting in DiffServ domains." ACM SIGCOMM Computer Communication Review 34, no. 5 (October 15, 2004): 47–57. http://dx.doi.org/10.1145/1039111.1039112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Zhang, Long, Wenjing Cao, Xinxin Zhang, and Haitao Xu. "MAC2: Enabling multicasting and congestion control with multichannel transmission for intelligent vehicle terminal in Internet of Vehicles." International Journal of Distributed Sensor Networks 14, no. 8 (August 2018): 155014771879358. http://dx.doi.org/10.1177/1550147718793586.

Full text

Abstract:

Internet of Vehicles has become a promising way to realize the evolution from vehicular ad hoc networks and next-generation intelligent transportation system into future autonomous driving scenarios, clean-energy intelligent vehicles, and Smart Cities. However, multicasting service messages on available service channels and periodic exchanges of beacon messages on control channel cause the problem of efficiently scheduling those messages via multichannel transmission for intelligent vehicle terminal, to support real-world applications in Internet of Vehicles scenario. In this article, we investigate the intelligent vehicle terminal architecture and, particularly, design the wireless communication board by incorporating multicasting and congestion control modules. Especially, we present a multicast data delivery scheme with random-delay lowest-cost constraint to transfer service messages on service channels. Furthermore, a priority-aware congestion control scheme is also proposed by considering differentiated priorities of beacon messages on control channel, to cope with the congestion problem at bottleneck vehicle node. Based on the proposed schemes, we build up the RanLow (Random-delay Lowest-cost) module and the priority-aware congestion control (PARCEL) module by enabling multicasting and congestion control together in wireless communication board of the intelligent vehicle terminal architecture. Finally, the experimental results and comparison show that our devised RanLow module and PARCEL module are feasible and more efficient than existing schemes.

APA, Harvard, Vancouver, ISO, and other styles

40

Walkowiak, Krzysztof, and Michał Przewoźniczek. "Modeling and optimization of survivable P2P multicasting." Computer Communications 34, no. 12 (August 2011): 1410–24. http://dx.doi.org/10.1016/j.comcom.2010.12.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Striegel, A., and G. Manimaran. "DSMCast: a scalable approach for DiffServ multicasting." Computer Networks 44, no. 6 (April 2004): 713–35. http://dx.doi.org/10.1016/j.comnet.2003.10.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Vrontis, Stavros, and Efstathios Sykas. "Extending differentiated services architecture for multicasting provisioning." Computer Networks 48, no. 4 (July 2005): 567–84. http://dx.doi.org/10.1016/j.comnet.2004.11.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Motyčková, Lenka, and David A. Carr. "A cluster-tree protocol for reliable multicasting." Computer Networks 49, no. 6 (December 2005): 707–26. http://dx.doi.org/10.1016/j.comnet.2005.02.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Kim, Changhan, Younghoon Kim, Jae-Heon Yang, and Ikjun Yeom. "Analysis of bandwidth efficiency in overlay multicasting." Computer Networks 52, no. 2 (February 2008): 384–98. http://dx.doi.org/10.1016/j.comnet.2007.09.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

T, SAMPRADEEPRAJ, and RAJA S P. "On Improving Reliability in Multicast Routing Protocol for Wireless Sensor Network." Information Technology And Control 49, no. 2 (June 16, 2020): 260–74. http://dx.doi.org/10.5755/j01.itc.49.2.24111.

Full text

Abstract:

Multicast routing becomes the most challenging problem in Wireless Sensor Networks (WSN). Multicasting is an effective way to facilitate group communication in which the multicast data need to be sent from a source node to multiple receivers. In this paper, a simple and efficient algorithm Minimum Connected Dominating Set (MCDS) is used to form a virtual backbone as forwarding group of the network. The MCDS aims at minimizing the number of nodes, where few nodes should be dominated, which are responsible for forwarding the multicast packets by applying Random Linear Network Coding (RLNC). RLNC has great potential to improve the performance of multicast routing protocol. The objective of this paper is to improve the performance of On-Demand Multicasting Routing Protocol (ODMRP) with respect to reliability using RLNC over MCDS for WSN, so that bandwidth utilization can be increased in the network. The proposed approach is named as RLNMCDS-ODMRP, which deliver multicast data in high reliable. Experimental results and performance analysis show that the proposed protocol outperforms the classical multicast routing protocols that use MCDS or RLNC.

APA, Harvard, Vancouver, ISO, and other styles

46

Weifa Liang and Xiaoxing Guo. "Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks." IEEE Transactions on Mobile Computing 5, no. 9 (September 2006): 1215–27. http://dx.doi.org/10.1109/tmc.2006.133.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Polaczyk, Bartosz, Piotr Chołda, and Andrzej Jajszczyk. "Peer-to-Peer Multicasting Inspired by Huffman Coding." Journal of Computer Networks and Communications 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/312376.

Full text

Abstract:

Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (RTT) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distributed paradigm is shown. Performance evaluation results prove that the proposed approach considerably improves the overlay efficiency from the viewpoint of end-users and content providers. Moreover, the proposed technique ensures a high level of resilience against gateway-link failures and adaptively reorganizes the overlay topology in case of dynamic, transient network fluctuations.

APA, Harvard, Vancouver, ISO, and other styles

48

Adler, Micah, and Tom Leighton. "Compression Using Efficient Multicasting." Journal of Computer and System Sciences 63, no. 1 (August 2001): 127–45. http://dx.doi.org/10.1006/jcss.2001.1753.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

CHANG, C., K. SHIH, C. HSU, and H. CHEN. "A location-aware multicasting protocol for Bluetooth Location Networks." Information Sciences 177, no. 15 (August 1, 2007): 3161–77. http://dx.doi.org/10.1016/j.ins.2006.12.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Myoungki Jeong, H. C. Cankaya, and Chunming Qiao. "On a new multicasting approach in optical burst switched networks." IEEE Communications Magazine 40, no. 11 (November 2002): 96–103. http://dx.doi.org/10.1109/mcom.2002.1047000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!