Conferences related to Multicast algorithms

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)

IEEE CCNC 2020 will present the latest developments and technical solutions in the areas of home networking, consumer networking, enabling technologies (such as middleware) and novel applications and services. The conference will include a peer-reviewed program of technical sessions, special sessions, business application sessions, tutorials, and demonstration sessions.


2020 IEEE International Conference on Image Processing (ICIP)

The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.


2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)

The 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2020) will be held in Metro Toronto Convention Centre (MTCC), Toronto, Ontario, Canada. SMC 2020 is the flagship conference of the IEEE Systems, Man, and Cybernetics Society. It provides an international forum for researchers and practitioners to report most recent innovations and developments, summarize state-of-the-art, and exchange ideas and advances in all aspects of systems science and engineering, human machine systems, and cybernetics. Advances in these fields have increasing importance in the creation of intelligent environments involving technologies interacting with humans to provide an enriching experience and thereby improve quality of life. Papers related to the conference theme are solicited, including theories, methodologies, and emerging applications. Contributions to theory and practice, including but not limited to the following technical areas, are invited.


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


More Conferences

Periodicals related to Multicast algorithms

Back to Top

Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


Circuits and Systems for Video Technology, IEEE Transactions on

Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, high-speed real-time circuits, VLSI architecture and implementation for video technology, multiprocessor systems--hardware and software-- ...


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


Computers, IEEE Transactions on

Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...


More Periodicals

Most published Xplore authors for Multicast algorithms

Back to Top

Xplore Articles related to Multicast algorithms

Back to Top

Heterogeneous Multicast Over Atm

The 8th IEEE Workshop on Computer Communications, 1993

None


A Best-Effort Multicast Algorithm

2006 International Conference on Communication Technology, 2006

Today's IP networks have seen a growing number of applications whose traffic are most efficiently transported using multicast forwarding service. In this paper, we present a scalable, sender-initiated, performance-driven, best- effort tree construction algorithm, which adapts to the changing network conditions. The algorithm does not use any unicast routing protocol. We demonstrate the operations and evaluate the performance of the ...


An efficient genetic algorithm for anycast routing in delay/disruption tolerant networks

IEEE Communications Letters, 2010

Delay/Disruption tolerant networks (DTNs) have the capacity to interconnect devices and areas that are underserved by traditional networks. Anycast routing can be used for many applications in DTNs, and is useful when nodes wish to send messages to at least one, and preferably only one, of the members in a destination group. In this letter, an anycast routing algorithm for ...


Efficient algorithms for delay-bounded minimum cost path problem in communication networks

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238), 1998

As the amount of data transmitted over a network increases and high bandwidth applications requiring point to multipoint communications like videoconferencing, distributed database management or cooperative work become widespread, it becomes very important to optimize network resources. One such optimization is multicast tree generation. The problem of generating a minimum cost multicast tree given the network topology and costs associated ...


Approximating blocking probabilities for multiservice network link with unicast and multicast connections

IEEE EUROCON 2009, 2009

In this paper we consider a multiservice network link accepting both multicast and unicast connections. We model the link as a multi-stream loss system and study an approximate method for computing blocking probabilities for traffic streams. A case study is represented to show the accuracy of the approximation.


More Xplore Articles

Educational Resources on Multicast algorithms

Back to Top

IEEE-USA E-Books

  • Heterogeneous Multicast Over Atm

    None

  • A Best-Effort Multicast Algorithm

    Today's IP networks have seen a growing number of applications whose traffic are most efficiently transported using multicast forwarding service. In this paper, we present a scalable, sender-initiated, performance-driven, best- effort tree construction algorithm, which adapts to the changing network conditions. The algorithm does not use any unicast routing protocol. We demonstrate the operations and evaluate the performance of the algorithm using computer simulations.

  • An efficient genetic algorithm for anycast routing in delay/disruption tolerant networks

    Delay/Disruption tolerant networks (DTNs) have the capacity to interconnect devices and areas that are underserved by traditional networks. Anycast routing can be used for many applications in DTNs, and is useful when nodes wish to send messages to at least one, and preferably only one, of the members in a destination group. In this letter, an anycast routing algorithm for DTNs based on genetic algorithms (GAs) is presented. The GA is applied to find the appropriate path combination to comply with the delivery needs of a group of anycast sessions simultaneously. The proposed GA-based solution uses the concept of subpopulation to produce the next generation population, a limited number of solutions to be evaluated, and yields minimum delay to achieve a specified rate of delivery. Via simulations we show that this scheme can produce good results.

  • Efficient algorithms for delay-bounded minimum cost path problem in communication networks

    As the amount of data transmitted over a network increases and high bandwidth applications requiring point to multipoint communications like videoconferencing, distributed database management or cooperative work become widespread, it becomes very important to optimize network resources. One such optimization is multicast tree generation. The problem of generating a minimum cost multicast tree given the network topology and costs associated with the connecting links can be modelled as a Steiner tree problem which is NP- complete. Much work has been done in the direction of obtaining near-optimal multicast trees when the objective is only to minimize the cost. However, many real time applications such as videoconferencing require that data be sent within prespecified delay limits in order to avoid problems such as anachronism and lack of synchronization. We deal with the delay-bounded cost- optimal multicast tree (DBCPAT) generation problem. Specifically, we discuss a closely related problem which is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node. Such a path can be used as a starting point to solve the DBCMT. We present an exact solution to the DBCP which is based on the branch-and-bound paradigm. We also propose a heuristic technique to solve the DBCP using the principle of evolutionary computing. The results obtained using the two techniques are compared for several large networks.

  • Approximating blocking probabilities for multiservice network link with unicast and multicast connections

    In this paper we consider a multiservice network link accepting both multicast and unicast connections. We model the link as a multi-stream loss system and study an approximate method for computing blocking probabilities for traffic streams. A case study is represented to show the accuracy of the approximation.

  • On the blocking performance of EGS networks under multicast traffic

    Extended generalized shuffle (EGS) networks are a wide class of interconnection networks introduced by Richards (1993). In this work, we study the blocking performance of EGS networks under point-to-multipoint traffic. Two new routing algorithms for multicast connections in EGS networks are defined, and a theorem proving that these algorithms construct minimum-cost connection trees is enclosed. Simulation results show that the blocking performance of EGS networks under multicast traffic is much better than that of three-stage Clos networks of equal complexity.

  • An Improved Mobile IP Scheme Based on MobiCast

    MobiCast is a mobile IP multicast algorithm which is used in the scene of small-scale wireless beehive network, it ensures the lowest packetpsilas lost rate when mobile node handovers in the same domain after introducing the concept of domain and domain foreign agent (DFA). Based on MobiCast, An improved scheme is proposed in this paper which introduces ldquoTunnel- schemerdquo between DFA(s) in neighboring domains, and new DFA registers to the multicast group in advance. Moreover, the ware of conform packets is introduced to resolve out of order and reconstruction of multicast packets. Simulation results based on Network Simulator Version 2 show that the improved scheme can reduce the packetpsilas lost rate, the whole handover delay in maximum and enhance the throughput, thereby, it can improve the performance and quality of service of the network as a whole when mobile node handovers between neighboring domains.

  • A distributed multicast multi-rate maxmin flow control protocol

    This paper presents the first distributed multi-rate maxmin rate allocation protocol for multicast traffic. The protocol supports minimum rate guarantee for each receiver as a QoS parameter. The protocol is practical and it maintains a good performance-scalability trade-off. While the network is required to participate, the complexity added by the protocol is minimal.

  • PLM-CSFQ: a new integrated multicast congestion control algorithm

    In this paper, a framework for transmission of multicast layer via a packet- pair mechanism is proposed. The performance of PLM using CSFQ queueing mechanism has been evaluated through simulation and showed that PLM/CSFQ exhibits reasonable losses in several experiments. However one of the limitations of the new model is the ability to scale to a large number of PLM sessions, which results in further packet losses experienced by each receiver as more sessions are introduced into the network. The cause is the insufficient reduction of the number of layers per receiver in times of heavy congestion. This is due to the nature of the PLM protocol and the packet mechanism. Overall result from experiments shows that PLM/CSFQ was able to adapt to a network of heterogeneous receivers and it also scales well with the number of receivers that join the same session.

  • Study on QoS Multicast Routing Based on ACO-PSO Algorithm

    QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem. a hybrid algorithm with ant colony optimization algorithm(ACO) and particle a warm optimization algorithm(PSO) is presented. The ACO-GA algorithm absorbs the merits of ACO and GA respectively. In hybrid algorithm, the position update of PSO is used to regulate the solution generated by ACO, which can make the current solution cross with current best solution of the paricle and current best solution of all partiles respectively. In additional, the strategy of the position update in PSO is motified by some re-defined arithmetic operators. The results of test show that the hybrid algorithm can meet QoS contraints of multicast routing problem excellently, and has better performance in finding global best solution.



Standards related to Multicast algorithms

Back to Top

No standards are currently tagged "Multicast algorithms"


Jobs related to Multicast algorithms

Back to Top