A consecutive-k-out-of-n system is a graph with n vertices where the system fails if and only if some path of k consecutive vertices all fail.
In this paper, we consider the problem of protection of multi- cast connections against single link or node failures using redundant trees.
We consider models of content delivery networks in which the servers are constrained by two main resources: memory and bandwidth.
We consider a system with two exponential servers (with unequal rates), an infinite buffer, and a Poisson arrival process.
We consider a queueing system with two servers and an infinite buffer. Service times are exponentially distributed and customers arrive in a Poisson process.
Distributed computing networks, tasked with both packet transmission and processing, require the joint optimization of communication and computation resources.
We consider a mobile connected to a base station, and study how to optimally schedule shutting off its transceiver. First, we study the model from optimal control perspective.
High availability of containerized applications requires to perform robust storage of applications' state.
Augmented information (AgI) services allow users to consume information that results from the execution of a chain of service functions that process source information to create real-time augmented
Given a set of points P Ì Rd and value e>0, an e-core-set SÌP has the property that the smallest ball containing S is within e of the smallest ball containing P.
