Ant-based load balancing in telecommunications networks
Adaptive Behavior
Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
The ant colony optimization meta-heuristic
New ideas in optimization
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
PALS: peer-to-peer adaptive layered streaming
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Multicast routing based on ant algorithm for delay-bounded and load-balancing traffic
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
PROMISE: peer-to-peer media streaming using CollectCast
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
A Scalable Multimedia Streaming Model Based-on Multi-source Streaming Concept
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
Adaptive packet video streaming over P2P networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
A multi-sender multicast algorithm for media streaming on peer-to-peer networks
Computer Communications
A fast and reliable multi-sender algorithm for peer-to-peer networks
Journal of Network and Computer Applications
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
A swarm algorithm for a self-structured P2P information system
IEEE Transactions on Evolutionary Computation
Ant-inspired query routing performance in dynamic peer-to- peer networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
IEEE Transactions on Information Theory
A peer-to-peer architecture for media streaming
IEEE Journal on Selected Areas in Communications
Multipath Routing Techniques in Wireless Sensor Networks: A Survey
Wireless Personal Communications: An International Journal
An ant colony model based replica consistency maintenance strategy in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper, we introduce a novel algorithm for rate allocation in media streaming P2P networks where multimedia contents are distributed among network members and streamed toward any requesting peer. The proposed algorithm is based on ant-colony optimization. It is capable of handling network dynamism, which is an inherent property of unstructured P2P networks. Another advantage of our algorithm is its ability to get over uncertainties in network state information, particularly the rate of supplying peers that could happen due to lack of accurate measurements. In addition, the suggested method does not rely on any information about the topology of the network. We have investigated both single and multiple streaming sessions scenarios in which more than one peer is receiving media streams from media providers. We show that the suggested algorithm will reach the maximum achievable rate of the network quite fast. A key feature of the proposed algorithm is its low pass filter property, which makes it discriminate between transient and permanent network changes. If the changes are transient, the algorithm easily and rapidly compensates the temporary losses. In cases where the network changes last longer, the algorithm overcomes losses by employing other nodes that have the media stream available. The rate of adaptation is adjustable and must be carefully determined according to network conditions. Moreover, adaption rate is not constant and varies during the streaming session. This results in uninterrupted services for current users in cases where multiple sessions are present in the network. Finally, since we have assumed that fountain codes are used to encode media streams in the P2P networks, the suggested algorithm does not require the user to receive different parts of the streams according to a predefined order and from a specific list of media suppliers. It suffices that the user gets as many stream chunks as necessary, regardless of their order or the fact that not all the media suppliers have all the parts available. In other words, using fountain codes enables us to overcome a big difficulty of P2P media streaming and that is to receive different parts of media streams according to a specific order.