Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes.
Inclusion-exclusion and network reliability.
Learning automata for data communication routing problem
Linear approach for synchronous state stability in fully connected PLL networks.
Majoration des retards dans les réseaux ATM
Market clearing price and equilibria of the progressive second price mechanism
The Progressive Second Price mechanism (PSP), recently introduced by Lazar and Semret to share an infinitely-divisible resource among users through pricing, has been shown to verify very interesting properties. Indeed, the incentive compatibility property of that scheme, and the convergence to an efficient resource allocation where established, using the framework of Game Theory. Therefore, that auction-based allocation and pricing scheme seems particularly well-suited to solve congestion problems...
Multi-criteria bandwidth allocation
Multistage interconnection networks in multiprocessor systems. A simulation study.
The principal modelling and simulation features of multistage interconnection networks operating in packet switching are discussed in this paper. The networks studied interconnect processors and memory modules in multiprocessor systems. Several methods are included to increase the bandwidth achievable with this kind of networks. Besides using network buffering, the possibility of having queues of requests at the memory modules is considered. Network conflicts can be reduced using a second network...
On a kinetic model of the internet traffic.
On adaptive control of mobile slotted ALOHA networks.
On the application of statistical kernel estimators for the demand-based design of a wireless data transmission system
On the connection between the theory of signal flow graphs and the theory of directed graphs
On the minimum cost multiple-source unsplittable flow problem
The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows. A cutting plane algorithm is derived using a superadditive approach. The inequalities considered here are valid for single knapsack constraints. They are based on nondecreasing superadditive functions and...
Optimum feedback strategy for access control mechanism modelled as stochastic differential equation in computer network.
Performance analysis of ATM multiplexer with Bernoulli traffic sources.
Performance analysis of multi-hop wireless packet networks.
Placement de tâches dans un système distribué et dualité lagrangienne
Prognosis and optimization of homogeneous Markov message handling networks
Message handling systems with finitely many servers are mathematically described as homogeneous Markov networks. For hierarchic networks is found a recursive algorithm evaluating after finitely many steps all steady state parameters. Applications to optimization of the system design and management are discussed, as well as a program product 5P (Program for Prognosis of Performance Parameters and Problems) based on the presented theoretical conclusions. The theoretic achievements as well as the practical...
Resource allocation in a mobile telephone network : a constructive repair algorithm
To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved...
Resource allocation in a mobile telephone network: A constructive repair algorithm
To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved...