47,962 research outputs found
Optimization in Telecommunication Networks
Network design and network synthesis have been the classical optimization problems intelecommunication for a long time. In the recent past, there have been many technologicaldevelopments such as digitization of information, optical networks, internet, and wirelessnetworks. These developments have led to a series of new optimization problems. Thismanuscript gives an overview of the developments in solving both classical and moderntelecom optimization problems.We start with a short historical overview of the technological developments. Then,the classical (still actual) network design and synthesis problems are described with anemphasis on the latest developments on modelling and solving them. Classical results suchas Mengerās disjoint paths theorem, and Ford-Fulkersonās max-flow-min-cut theorem, butalso Gomory-Hu trees and the Okamura-Seymour cut-condition, will be related to themodels described. Finally, we describe recent optimization problems such as routing andwavelength assignment, and grooming in optical networks.operations research and management science;
Automated Synthesis of SEU Tolerant Architectures from OO Descriptions
SEU faults are a well-known problem in aerospace environment but recently their relevance grew up also at ground level in commodity applications coupled, in this frame, with strong economic constraints in terms of costs reduction. On the other hand, latest hardware description languages and synthesis tools allow reducing the boundary between software and hardware domains making the high-level descriptions of hardware components very similar to software programs. Moving from these considerations, the present paper analyses the possibility of reusing Software Implemented Hardware Fault Tolerance (SIHFT) techniques, typically exploited in micro-processor based systems, to design SEU tolerant architectures. The main characteristics of SIHFT techniques have been examined as well as how they have to be modified to be compatible with the synthesis flow. A complete environment is provided to automate the design instrumentation using the proposed techniques, and to perform fault injection experiments both at behavioural and gate level. Preliminary results presented in this paper show the effectiveness of the approach in terms of reliability improvement and reduced design effort
Optimal Control of Wireless Computing Networks
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 value. Applications include real-time
analysis of remote sensing data, real-time computer vision, personalized video
streaming, and augmented reality, among others. We consider the problem of
optimal distribution of AgI services over a wireless computing network, in
which nodes are equipped with both communication and computing resources. We
characterize the wireless computing network capacity region and design a joint
flow scheduling and resource allocation algorithm that stabilizes the
underlying queuing system while achieving a network cost arbitrarily close to
the minimum, with a tradeoff in network delay. Our solution captures the unique
chaining and flow scaling aspects of AgI services, while exploiting the use of
the broadcast approach coding scheme over the wireless channel.Comment: 30 pages, journa
- ā¦