Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A Tree Switching Protocol for Multicast State Reduction
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Efficiency Analysis of Multicast Routing Algorithms in Large Networks
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Improved neural heuristics for multicast routing
IEEE Journal on Selected Areas in Communications
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Destination-driven routing for low-cost multicast
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Having in mind various implementations of methods for generating network topology [1], [2], [3], there is also a need for a wider mechanism determining receiving nodes in a network by geographical positioning, or one that would be related to link and node parameters. This will allow us to answer the question whether the way receiving nodes are distributed has any influence on the quality of multicast trees constructed by algorithms. The paper proposes methods that arrange group members in packet-switched networks. In the research we discuss the influence of the group arrangement method on the total cost of tree and the average cost of path in a tree for unconstrained routing algorithms for multicast connections. The methods for the receiving nodes distribution in the network have not been hitherto addressed and analyzed in literature.