Wireless ATM layouts for chain networks

In this paper we consider the problem of constructing ATM layouts for wireless networks in which mobile users can move along a chain of base stations. We first show that deciding the existence of a layout with maximum hop count h, load l and channel distance d is NP-complete for every fixed value of d greater or equal to 1. We then provide optimal layout constructions for the case d less than or equal to 2. Finally, optimal layout constructions are obtained also for any d within the class of the so-called canonic layouts, that so far have always been shown to be the optimal ones

The Octopus switch

This chapter1 discusses the interconnection architecture of the Mobile Digital Companion. The approach to build a low-power handheld multimedia computer presented here is to have autonomous, reconfigurable modules such as network, video and audio devices, interconnected by a switch rather than by a bus, and to offload as much as work as possible from the CPU to programmable modules placed in the data streams. Thus, communication between components is not broadcast over a bus but delivered exactly where it is needed, work is carried out where the data passes through, bypassing the memory. The amount of buffering is minimised, and if it is required at all, it is placed right on the data path, where it is needed. A reconfigurable internal communication network switch called Octopus exploits locality of reference and eliminates wasteful data copies. The switch is implemented as a simplified ATM switch and provides Quality of Service guarantees and enough bandwidth for multimedia applications. We have built a testbed of the architecture, of which we will present performance and energy consumption characteristics

Location analysis - possibilities of use in public administration

V článku jsou stručně popsána teoretická východiska lokační teorie a možnosti využití v oblasti veřejné správy jako je navrhování sítí a lokace různých zařízení v geografickém prostoru regionů.The paper under consideration describes key theoretical issues of continuous/discrete location theory and possibilities of applications in the area of public administration activities such as networks design and location of different facilities in geographical area of regions

Analysis of topology aggregation techniques for QoS routing

We study and compare topology aggregation techniques used in QoS routing. Topology Aggregation (TA) is defined as a set of techniques that abstract or summarize the state information about the network topology to be exchanged, processed, and maintained by network nodes for routing purposes. Due to scalability, aggregation techniques have been an integral part of some routing protocols. However, TA has not been studied extensively except in a rather limited context. With the continuing growth of the Internet, scalability issues of QoS routing have been gaining importance. Therefore, we survey the current TA techniques, provide methodology to classify, evaluate, and compare their complexities and efficiencies. ©2007 ACM.postprin

Virtual network embedding in the cycle

AbstractWe consider a problem motivated by the design of Asynchronous transfer mode (ATM) networks. Given a physical network and an all-to-all traffic, the problem consists in designing a virtual network with a given diameter, which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here we solve the problem when the physical network is a ring. We give an almost optimal solution for diameter 2 and bounds for large diameters

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;

Virtual path bandwidth distribution and capacity allocation with bandwidth sharing

Broadband high-speed networks, such as B-ISDN, are expected to play a dominant role in the future of networking due to their capability to service a variety of traffic types with very different bandwidth requirements such as video, voice and data. to increase network efficiency in B-ISDN and other such connection oriented networks, the concept of a virtual path (VP) has been proposed and studied in the literature. A VP is a permanent or semi-permanent reservation of capacity between two nodes. Using VPs can potentially reduce call setup delays, simplify hardware, provide quality of service performance guarantees, and reduce disruption in the event of link or node failure.;In order to use VPs efficiently, two problems must be solved. With the objective of optimizing network performance, (1) the VPs must be placed within the network, and (2) network link capacity must be divided among the VPs. Most previous work aimed at solving these problems has focused on one problem in isolation of the other. at the same time, previous research efforts that have considered the joint solution of these problems have considered only restricted cases. In addition, these efforts have not explicitly considered the benefits of sharing bandwidth among VPs in the network.;We present a heuristic solution method for the joint problem of virtual path distribution and capacity allocation without many of the limitations found in previous studies. Our solution method considers the joint bandwidth allocation and VP placement problem and explicitly considers the benefits of shared bandwidth. We demonstrate that our algorithm out-performs previous algorithms in cases where network resources are limited. Because our algorithm provides shared bandwidth, solutions found by our algorithm will have a lower setup probability than a network that does not use VPs as well as a lower loss probability than provided by VPDBA solutions produced by previous algorithms. In addition, our algorithm provides fairness not found in solutions produced by other algorithms by guaranteeing that some service will be provided to each source-destination pair within the network

Distributed multimedia systems

A distributed multimedia system (DMS) is an integrated communication, computing, and information system that enables the processing, management, delivery, and presentation of synchronized multimedia information with quality-of-service guarantees. Multimedia information may include discrete media data, such as text, data, and images, and continuous media data, such as video and audio. Such a system enhances human communications by exploiting both visual and aural senses and provides the ultimate flexibility in work and entertainment, allowing one to collaborate with remote participants, view movies on demand, access on-line digital libraries from the desktop, and so forth. In this paper, we present a technical survey of a DMS. We give an overview of distributed multimedia systems, examine the fundamental concept of digital media, identify the applications, and survey the important enabling technologies.published_or_final_versio