Scatter Search Based Metaheuristic for Robust Optimization of the Deploying Of “Dwdm” Technology on Optical Networks With Survivability
Scheduling UET trees with communication delays on two processors
Scheduling UET Trees with Communication Delays on two Processors
In this paper, we present a new linear time algorithm for scheduling UECT (Unit Execution and Communication Time) trees on two identical processors. The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non UECT tasks.
Simultaneous routing and flow rate optimization in energy-aware computer networks
The issue of energy-aware traffic engineering has become prominent in telecommunications industry in the last years. This paper presents a two-criteria network optimization problem, in which routing and bandwidth allocation are determined jointly, so as to minimize the amount of energy consumed by a telecommunication infrastructure and to satisfy given demands represented by a traffic matrix. A scalarization of the criteria is proposed and the choice of model parameters is discussed in detail. The...
Statistical-learning control of multiple-delay systems with application to ATM networks
Congestion control in the ABR class of ATM network presents interesting challenges due to the presence of multiple uncertain delays. Recently, probabilistic methods and statistical learning theory have been shown to provide approximate solutions to challenging control problems. In this paper, using some recent results by the authors, an efficient statistical algorithm is used to design a robust, fixed-structure, controller for a high-speed communication network with multiple uncertain propagation...
Steady state and scaling limit for a traffic congestion model
In a general model (AIMD) of transmission control protocol (TCP) used in internet traffic congestion management, the time dependent data flow vector x(t) > 0 undergoes a biased random walk on two distinct scales. The amount of data of each component xi(t) goes up to xi(t)+a with probability 1-ζi(x) on a unit scale or down to γxi(t), 0 < γ < 1 with probability ζi(x) on a logarithmic scale, where ζi depends on the joint state of the system x. We investigate the long time behavior, mean field...
Symmetric flows and broadcasting in hypercubes
In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an -dimensional hypercube in the circuit switched, -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...