News articles are a captivating type of online content that capture a significant amount of Internet users' interest. They are particularly consumed by mobile users and extremely diffused through online social platforms. As a result, there is an increased interest in promptly identifying the articles that will receive a significant amount of user attention. This task falls under the broad scope of content popularity prediction and has direct implications in various contexts such as caching strategies or online advertisement policies. In this paper we address the problem of predicting the popularity of news articles based on user comments. We formulate the prediction task into a ranking problem where the goal is not to infer the precise attention that a content will receive but to accurately rank articles based on their predicted popularity. To this end, we analyze the ranking performance of three prediction models using a dataset of articles covering a four-year period and published by 20minutes.fr, an important French online news platform. Our results indicate that prediction methods improve the ranking performance and we observed that for our dataset a simple linear prediction method outperforms more dedicated prediction methods.

Despite its existing incentives for leecher cooperation, BitTorrent file sharing fundamentally relies on the presence of seeder peers. Seeder peers essentially operate outside the BitTorrent incentives, with two caveats: slow downlinks lead to increased numbers of "temporary" seeders (who left their console, but will terminate their seeder role when they return), and the copyright liability boon that file segmentation offers for permanent seeders. Using a simple epidemic model for a two segment BitTorrent swarm, we focus on the BitTorrent rule to disseminate the (locally) rarest segments first. With our model, we show that the rarest-segment first rule minimizes transition time to seeder (complete file acquisition) and equalizes the segment populations in steady-state. We discuss how alternative dissemination rules may beneficially increase file acquisition times causing leechers to remain in the system longer (particularly as temporary seeders). The result is that leechers are further enticed to cooperate. This eliminates the threat of extinction of rare segments which is prevented by the needed presence of permanent seeders. Our model allows us to study the corresponding trade-offs between performance improvement, load on permanent seeders, and content availability, which we leave for future work.

In the Web 2.0 era, users share and discover interesting content via a network of relationships created in various social networking or content sharing sites. They can become for example contacts, followers or friends and express their appreciation of specific content uploaded by their peers by faving, retweeting or liking them depending on whether they are in Flickr, Twitter or Facebook respectively. Then they can discover additional content of interest through the lists of favorites of their contacts and so on. This faving (or favoring) functionality becomes thus a central part of content sharing communities for two purposes: (a) it helps the propagation of content amongst users and (b) it stimulates users' participation and activity. In this paper, we make a first step to understand users' faving behavior in content sharing communities in terms of reciprocity using publicly available datasets from Flickr and Twitter. Do users favor content only when they really appreciate it or they often feel the need to reciprocate when their content is appreciated by one of their contacts or even by a stranger? Do people take advantage of this process to gain popularity? What is the impact of the design, the social software, of a specific community and the type of content shared? These are some of the questions that our first results help to answer.

International audience

We address the incentive issues that arise in a peer-to-peer WLAN consortium (P. Antoniadis et al., 2003). We explore the use of flexible rules on reciprocity to guide domain policies and develop a suitable economic model that demonstrates the basic characteristics of our system.

Advanced input queuing is an attractive, promising architecture for high-speed ATM switches, because it combines the low cost of input queuing with the high performance of output queuing. The need for scalable schedulers for advanced input queuing switch architectures has led to the development of efficient distributed scheduling algorithms. We introduce a new distributed scheduling algorithm, FIRM, which provides improved performance characteristics over alternative distributed algorithms. FIRM achieves saturation throughput 1 with lower delay than the most efficient alternative (up to 50% at high load). Furthermore, it provides improved fairness (it approximates FCFS) and tighter service guarantee than others. FIRM provides a basis for a class of distributed scheduling algorithms, many of which provide even more improved performance characteristics.