- Opportunistic and Delay-Tolerant Networks
- Mobile Ad Hoc Networks
- Caching and Content Delivery
- Complex Network Analysis Techniques
- Cooperative Communication and Network Coding
- Cloud Computing and Resource Management
- IoT and Edge/Fog Computing
- Age of Information Optimization
- Opinion Dynamics and Social Influence
- Software-Defined Networks and 5G
- Advanced Wireless Network Optimization
- Game Theory and Applications
- Wireless Networks and Protocols
- Advanced MIMO Systems Optimization
- Distributed systems and fault tolerance
- COVID-19 epidemiological studies
- Peer-to-Peer Network Technologies
- Advanced Queuing Theory Analysis
- Modular Robots and Swarm Intelligence
- Image and Video Quality Assessment
- Distributed and Parallel Computing Systems
- Advanced Optical Network Technologies
- IoT Networks and Protocols
- Network Traffic and Congestion Control
- Energy Harvesting in Wireless Networks
Laboratoire Informatique d'Avignon
2019-2024
Université d'Avignon et des Pays de Vaucluse
2019-2024
Toronto Metropolitan University
2022
University of Massachusetts Dartmouth
2022
Tohoku University
2022
University of Waterloo
2022
InterDigital (United States)
2022
China Telecom (China)
2022
Huazhong University of Science and Technology
2022
University at Buffalo, State University of New York
2022
Wireless communication systems are rapidly becoming a viable solution for employment at the lowest level of factory automation systems, usually referred to as either "device" or "field" level, where requested performance may be rather critical in terms both transmission time and reliability. In this paper, we deal with use wireless networks device level. Specifically, after an analysis requirements, introduce general profile fieldbus. Both physical data link layers taken directly from...
Several novel metrics have been proposed in recent literature order to study the relative importance of nodes complex networks. Among those, k-coreness has found a number applications areas as diverse sociology, proteinomics, graph visualization, and distributed system analysis design. This paper proposes new algorithms for computation network, process also known k-core decomposition. technique 1) allows decomposition, over set connected machines, very large graphs, when size does not allow...
We study in this paper optimal stochastic control issues delay tolerant networks. first derive the structure of 2-hop forwarding policies. In order to be implemented, such policies require knowledge some system parameters as number mobiles or rate contacts between mobiles, but these could unknown at design time may change over time. To address problem, we adaptive combining estimation and that achieve performance spite lack information. then interactions occur presence several competing...
In this paper we present Vertigo (Virtual Topologies Generalization in OpenFlow networks), a Software–defined networking platform designed for network virtualization. Based on the original slicing system Flow Visor, aims at covering all flavors of virtualization: particular, it is able to expose simple abstract node one extreme, and deliver logically fully connected very opposite end. work, first introduce architecture its design choices, then report prototypical implementation deployed over...
In this paper we present Foggy, an architectural framework and software platform based on Open Source technologies. Foggy orchestrates application workload, negotiates resources supports IoT operations for multi-tier, distributed, heterogeneous decentralized Cloud Computing systems. is tailored emerging domains such as 5G Networks IoT, which demand services to be distributed located close data sources users following the Fog paradigm. provides a infrastructure owners tenants (i.e.,...
Fog computing promises to extend cloud match emerging demands for low latency, location-awareness and dynamic computation. It thus brings data processing close the edge of network by leveraging on devices with different computational characteristics. However, heterogeneity, geographical distribution, data-intensive profiles IoT deployments render placement fog applications a fundamental problem guarantee target performance figures. This is core challenge providers offer infrastructure as...
Much research has been devoted to maximize the life time of mobile ad-hoc networks. Life often defined as elapsed until first node is out battery power. In context static networks, this could lead disconnectivity. contrast, Delay Tolerant Networks (DTNs) leverage mobility relay nodes compensate for lack permanent connectivity, and thus enable communication even after some deplete their stored energy. One can consider lifetimes additional parameters that be controlled optimize performance a...
Join-the-shortest queue (JSQ) and its variants have often been used in solving load balancing problems. JSQ minimizes the average system occupation, e.g., customer's time. In this paper, we extend setting to include constraints that may be imposed due communication network. particular, cast problem framework of constrained MDPs: permit us address both action-dependent constraints, such as, e.g, bandwidth state-dependent minimum utilization constraints. Unlike state-of-the-art approaches...
This paper presents BIONETS, which is a novel bio-inspired approach to the design of localized services in pervasive communication/computing environments. Conventional networking approaches are not suitable for such scenarios, where they face three main issues, namely: 1) heterogeneity, 2) scalability, and 3) complexity. The proposed solution draws inspiration from living world terms evolutionary paradigms able drive adaptation process autonomic social provisioning necessary cooperation...
Recently, research on disconnected networks has been fostered by several studies delay-tolerant networks, which are designed in order to sustain operations. We focus the emerging notion of connectivity exists such where message exchange between nodes is enforced leveraging storage capabilities at intermediate relays, with aim achieving over time. The problem, under constraint intermittent connectivity, hence devise efficient mechanisms for delivery, and evaluate performance thereof. In this...
Delay-tolerant ad hoc networks leverage the mobility of relay nodes to compensate for lack permanent connectivity and thus enable communication between that are out range each other. To decrease delivery delay, information be delivered is replicated in network. Our objective this paper study a class replication mechanisms include coding order improve probability successful within given time limit. We propose an analytical approach allows quantify tradeoffs resources performance measures...
Fog computing extends cloud technology to the edge of infrastructure support dynamic computation for IoT applications. Reduced latency and location awareness in objects' data access is attained by displacing workloads from central devices. Doing so, it reduces raw transfers target objects cloud, thus overcoming communication bottlenecks. This a key step towards pervasive uptake next generation IoT-based services. In this work we study efficient orchestration applications fog computing, where...
We introduce Cloud4IoT, a platform offering automatic deployment, orchestration and dynamic configuration of IoT support software components data-intensive applications for data processing analytics, thus enabling plug-and-play integration new sensor objects workload scalability. Cloud4IoT enables the concept Infrastructure as Code in context: it empowers operations with flexibility elasticity Cloud services. Furthermore shifts traditionally centralized architectures towards more distributed...
Delay tolerant ad-hoc networks leverage the mobility of relay nodes to compensate for lack permanent connectivity and thus enable communication between that are out range each other. To decrease delivery delay, information be delivered is replicated in network. Our objective this paper study a class replication mechanisms include coding order improve probability successful within given time limit. We propose an analytical approach allows quantify tradeoffs resources performance measures...
We study replication mechanisms that include Reed-Solomon type codes as well network coding in order to improve the probability of successful delivery within a given time limit. propose an analytical approach compute these and effect on performance while optimizing parameters govern routing.
We consider a model for the diffusion of epidemics in population that is partitioned into local communities. In particular, assuming mean-field approximation, we analyze continuous-time susceptible-infected-susceptible (SIS) has appeared recently literature. The probability by which an individual infects individuals its own community different from infecting other aim model, compared to standard, nonclustered one, provide compact description presence communities infection where epidemic...
We study in this paper fluid approximations for a class of monotone relay policies delay tolerant ad-hoc networks. This includes the epidemic routing and two-hops protocols. enhance with probabilistic forwarding feature where message is forwarded to r
Among the novel metrics used to study relative importance of nodes in complex networks, k-core decomposition has found a number applications areas as diverse sociology, proteinomics, graph visualization, and distributed system analysis design. This paper proposes new algorithms for computation network, with purpose (i) enabling run-time k-cores "live" systems (ii) allowing decomposition, over set connected machines, very large graphs, that cannot be hosted single machine. Lower bounds on...
Performance of a delay-tolerant network has strong dependence on the nodes participating in data transportation. Such networks often face several resource constraints especially related to energy. Energy is consumed not only transmission, but also listening and signaling activities. On one hand these activities enhance system's performance while other hand, they consume significant amount energy even when do involve actual node transmission. Accordingly, order use efficiently, may have limit...
Understanding the dynamics of on-line content popularity is an active research field with application in sectors as diverse media advertising, replication and caching marketing. In most cases, scientists have focused on user-generated contents, which are freely accessible thro