PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Ant Colony Optimization
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations
Computers and Operations Research
GoalBit: the first free and open source peer-to-peer streaming network
Proceedings of the 5th International Latin American Networking Conference
Algorithmic problems for metrics on permutation groups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
A cooperative network game efficiently solved via an ant colony optimization approach
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Peer-to-peer networks are self-organised communities over the internet infrastructure, in which peers are both clients and servers. The global resources of a peer-to-peer network increase proportionally with the population, promoting scalability. Peers are organised covering neighbouring-strategies and chunk-scheduling policies that determine the success of the cooperation scheme. In this paper, we address the design of chunk-scheduling policies in a cooperative scenario, assuming a complete mesh-topology under regime. All users wish to display a video channel with no cuts and low buffering times. We propose an in-depth analysis of this cooperative system, and develop the best chunk scheduling policy so far, found via a sophisticated ant-colony-based exploration. We introduce the new policy into a real platform. There, users wait five seconds to start watching following our new policy versus minutes in previous policies, with acceptable number of cuts.