Serge Fdida | Sorbonne University (original) (raw)

Papers by Serge Fdida

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific ... more HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Distributed research testbeds play a fundamental role in the evaluation of disruptive innovations... more Distributed research testbeds play a fundamental role in the evaluation of disruptive innovations for the Fut ure Internet. In recent years, the main research funding agencies have promoted several initiatives aimed at designing and building open, large scale, realistic experimental fac i ities that could be used to evaluate innovative networking architectures, paradigms and services. In this paper, afte r discussing the main challenges in building such infrastruc tures, we present how, by leveraging the concept of federation, we managed to introduce a first degree of heterogeneity into PlanetLab Europe, a European testbed federated with PlanetLab, by providing UMTS connectivity to PlanetLab Europe nodes. Our contribution is just a first step of an evolutionary path whose further developments will lead to next generation large-scale heterogeneous testbeds for suppor ting experimentally-driven research on the Network of the Future.

While the Internet is hardly “broken”, it has proved unable to integrate new ideas, new architect... more While the Internet is hardly “broken”, it has proved unable to integrate new ideas, new architectures, and provide paths for future integration of data, voice, rich media and higher reliability. The reason is that the basic concept of the Internet as an end-to-end packet delivery service has made its middle layer, networking services through TCP/IP, untouchable. If we wish to see any disruptive enhancements to security, routing flexibility and reliability, and robust quality of service guarantees in coming years, we will need to move towards an Internet in which networking environments offering differing strengths can coexist on a permanent basis. This view is gaining currency in the US, advocated by the FIND/GENI initiative [7, 6] and in Europe, where it forms the heart of the activities reviewed by ARCADIA. The ARCADIA activity, sponsored by COST [1] has been chartered to look at critical areas in which research on fundamentals in the Internet’s architecture and protocols, support...

IEEE Communications Magazine

ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)

Page 1. A Scalable Algorithm for Link-state QoS-based Routing with Three MetricsLuis Henrique MK ... more Page 1. A Scalable Algorithm for Link-state QoS-based Routing with Three MetricsLuis Henrique MK Costa1i2 Serge Fdidal Otto Carlos MB Duarte2 Luis.CostaQlip6. fr Serge.FdidaQlip6.fr ottoQgta.ufrj.br LIP6 - Universite Pierre ...

Network Functions Virtualization (NFV) aims to support service providers to deploy various servic... more Network Functions Virtualization (NFV) aims to support service providers to deploy various services in a more agile and cost-effective way. However, the softwarization and cloudification of network functions can result in severe congestion and low network performance. In this paper, we propose a solution to address this issue. We analyze and solve the online load balancing problem using multipath routing in NFV to optimize network performance in response to the dynamic changes of user demands. In particular, we first formulate the optimization problem of load balancing as a mixed integer linear program for achieving the optimal solution. We then develop the ORBIT algorithm that solves the online load balancing problem. The performance guarantee of ORBIT is analytically proved in comparison with the optimal offline solution. The experiment results on real-world datasets show that ORBIT performs very well for distributing traffic of each service demand across multipaths without knowledge of future demands, especially under high-load conditions.

This paper proposes Navigo, a location based packet forwarding mechanism for vehicular Named Data... more This paper proposes Navigo, a location based packet forwarding mechanism for vehicular Named Data Networking (NDN). Navigo takes a radically new approach to address the challenges of frequent connectivity disruptions and sudden network changes in a vehicle network. Instead of forwarding packets to a specific moving car, Navigo aims to fetch specific pieces of data from multiple potential carriers of the data. The design provides (1) a mechanism to bind NDN data names to the producers' geographic area(s); (2) an algorithm to guide Interests towards data producers using a specialized shortest path over the road topology; and (3) an adaptive discovery and selection mechanism that can identify the best data source across multiple geographic areas, as well as quickly react to changes in the V2X network.

ACM SIGMETRICS Performance Evaluation Review, 1988

This paper presents a model for a catenet environment. In particular, the model, which could be s... more This paper presents a model for a catenet environment. In particular, the model, which could be seen as a hierarchical model consisting of three levels of models, focuses on the end-to-end delay between two host computers connected to different LANs separated via gateways by a WAN. The model incorporates a basic flow control mechanism, standardized local area network behaviour, as well as gateway functions in terms of packet fragmentation and reassembly.

2014 IEEE Network Operations and Management Symposium (NOMS), 2014

ABSTRACT The global trend of Future Internet related experimentally driven research has gained a ... more ABSTRACT The global trend of Future Internet related experimentally driven research has gained a strong momentum. In this context sustainability and the best use of developed infrastructures are highly critical. While many facilities have reached a level of maturity that allows them to be opened up to a wider use, mainly the academic sectors have been targeted. The Fanning out Testbeds-as-a-Service for the EIT ICT1 (FanTaaStic) project explores best practices, has performed a gap analysis, investigates applicable business models and works out a concept for the operation of a self-sustainable commercial testbed service offering. For defining the operational model, an analysis of available tools and frameworks from past and current Future Internet testbed projects is being carried out, based on a standard framework that defines the required processes and applications for the carrier grade operation of telecommunication infrastructures and provisioning of services. The business model is defined as a gradually growing service offering, based on categories of a framework for IT Service Management in federated e-infrastructures. The applicability of both, the developed business and operational model for such a sustainable federation will initially be implemented and evaluated in 2014.

Despite its existing incentives for leecher cooperation, BitTorrent file sharing fundamentally re... more 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. Finally, interpreting the two-segment model as one involving a rare segment and a "lumped" segment representing the rest, we study a model that jointly considers control of rare segments and different uplinks causing "choking," where high-uplink peers will not engage in certain transactions with low-uplink peers.

In this paper, we consider medium access control of local area networks (LANs) under limited-info... more In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming 'by rule' conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic, conditional, altruism term into the net utility. The effects of altruism are analyzed at Nash equilibrium for the carrier sense multiple access (CSMA)-like random-access framework in the quasi-stationary (fictitious play) regime. We consider either power or throughput-based costs of networking, and the cases of identical or heterogeneous (independent) players. Unlike related work in this area, our objective is not to optimize the performance of the system but to formulate a realistic economic model capturing altruistic motivations. This model can then form the basis for higher-level incentive schemes that will encourage altruistic, instead of selfish, behavior. In a numerical study we consider the cases of identical or diverse players and show interesting relationships between the main parameters of our model and comparisons with other alternatives discussed in the literature.

News articles are an engaging type of online content that captures the attention of a significant... more News articles are an engaging type of online content that captures the attention of a significant amount of Internet users. They are particularly enjoyed by mobile users and massively spread through online social platforms. As a result, there is an increased interest in discovering the articles that will become popular among users. This objective falls under the broad scope of content popularity prediction and has direct implications in the development of new services for online advertisement and content distribution. In this paper, we address the problem of predicting the popularity of news articles based on user comments. We formulate the prediction task as 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. Using data obtained from two important news sites in France and Netherlands, we analyze the ranking effectiveness of two prediction models. Our results indicate that popularity prediction methods are adequate solutions for this ranking task

In this paper we analyse a multiplexer handling a number of identical and independent Worst Case ... more In this paper we analyse a multiplexer handling a number of identical and independent Worst Case Traffic (WCT) sources. Each WeT source produces a periodic stream of cells consisting of a constant number of back-to-back cells followed by a silent period of constant duration. The WeT can model the traffic produced by a "malicious" user who sends an ON/OFF traffic where a burst of back-to-back cells whose length is the largest compatible with the tolerance introduced in the control function alternates with an idle period whose length is the smallest compatible with the policed peak cell rate. WeT can also model, for example, the traffic produced by some ATM Adaptation Layer multiplexing schemes in the Terminal Equipment. Exact results are obtained, both for the discrete and the fluid-flow model. The numerical examples show the dramatic impact that WeT can have on the multiplexer buffer requeriments. The model presented can be useful to assess the convenience of using a traffic shaping device at the entry point of the ATM network.

This is a variation of the two-sided market model of [10]: Demand D is concave inD in (16) of [10... more This is a variation of the two-sided market model of [10]: Demand D is concave inD in (16) of [10]. So, in (5) of [10] and after Theorem 2, take the parametric case 0 < a ≤ 1. Thus, demand D is both decreasing and concave in price p, and so the utilities (U = pD) are also concave in price. Also, herein a simpler illustrative demandresponse model is used in Appendix A and B.

Resource allocation for energy efficiency optimization in multi-carrier interference networks wit... more Resource allocation for energy efficiency optimization in multi-carrier interference networks with multiple receive antennas is tackled. First, a one-hop network is considered, and then, the results are extended to the case of a two-hop network in which amplify-and-forward relaying is employed to enable communication. A distributed algorithm which optimizes a system-wide energy-efficient performance function, and which is guaranteed to converge to a stable equilibrium point, is provided. Unlike most previous works, in the definition of the energy efficiency, not only the users' transmit power but also the circuit power that is required to operate the devices is taken into account. All of the proposed procedures are guaranteed to converge and only require statistical channel state information, thus lending themselves to a distributed implementation. The asymptotic regime of a saturated network in which both the active users and the number of receive antennas deployed in each receiver grow large is also analyzed. Numerical results are provided to confirm the merits of the proposed algorithms.

2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2013

In this work, we propose a heuristic for dynamic spectrum sharing in cognitive radio networks. Th... more In this work, we propose a heuristic for dynamic spectrum sharing in cognitive radio networks. The concept of rate compensation is introduced so that cognitive radio users are able to achieve their rate requirement by performing adequately spectrum handoffs. Indeed, performing spectrum handoff can increase the achieved rate obtained by moving from unavailable channels to available ones. However, handoffs should also be reduced to decrease handoff delays and access contention in the network which can in turn impact the achieved rate.

2011 Eighth International Conference on Wireless On-Demand Network Systems and Services, 2011

Abstract Communication has always been a central activity in all societies. Therefore, there has ... more Abstract Communication has always been a central activity in all societies. Therefore, there has been a continuous motivation to leverage and ease its development. More recently, devices aiming at mediating the user&amp;amp;#x27;s attention have taken momentum acting both as a very personal and intimate user communication interface as well as the key to commerce with the user. Major examples are the box/gateway used when the user is at home and mobile devices when the user is on the move. We expect that the car will play a central role in the ...

Computer Communications, 1993