... This paper discusses the capability of using AAL-2 connections to carry compressed voice between components of a CDMA network. To this end we analyze a discrete-time queuing model of the the AAL-2 mechanism combined with traffic shaping.

Boolean matching tackles the problem whether a subcircuit of a boolean network can be substituted by a cell from a cell library. In previous approaches [7, 10, 8] each pair of a subcircuit and a cell is tested for NPN equivalence. This becomes very expensive if the cell library is large. In our approach the time complexity for matching a subcircuit against a library L is almost independent of the size of L. CPU time also remains small for matching a subcircuit against the huge set of functions obtained by bridging and fixing cell inputs; but the use of these functions in technology mapping is very profitable. Our method is based on a canonical representative for each NPN equivalence class. We show how this representative can be computed efficiently and howitcanbe used for matching a boolean function against a set of library functions.

Boolean matching tackles the problem whether a subcircuit of a boolean network can be substituted by a cell from a cell library. In previous approaches [6, 9, 7] each pair of a subcircuit and a cell is tested for NPN-equivalence. This becomes very expensive if the cell library is large. In our approach the time complexity for matching a subcircuit against a library L is almost independent of the size of L. The CPU time also remains the same for matching a subcircuit against the huge set of functions obtained by bridging and fixing cell inputs; but the use of these functions in technology mapping is very profitable. Our method is based on a canonical representative for each NPN-equivalence class. We show how this representative can be computed efficiently and how it can be used for matching a boolean function against a set of library functions.

In this paper we present results from measurements of WWW-traffic, the analysis of the data measured, and derive two simple models that could be used to describe WWW-traffic for performance assessment purposes. We analyze client WWW-sessions that are characterized by the size of the response and inter-response intervals. The samples of both categories are found to exhibit heavy-tailed properties. Thus, we represent WWW-traffic by two models: an independent Pareto model and a logarithmic histogram model. The models are evaluated by simulating the transmission of traffic generated by the models over an ATM link using the VBR service category. We show that the histogram model is able to represent the properties of WWW-traffic with higher accuracy while the Pareto model is able to resume the characteristics of WWWtraffic with fewer parameters. 1 1

... In this paper we discuss the capacities of architecture alternatives for the interconnection of Base Transceiver Systems (BTS) and their Base Station Controller (BSC) in CDMA mobile communication networks. To this end, queuing models of architecture alternatives are derived. We analyze the models using discrete-time analysis techniques and verify the results by simulation. Numerical results are provided for the maximum number of CDMA voice sources that can be supported by a given capacity of the interconnecting links. This enables us to compare the architecture alternatives in terms of teletraffic capacity

In personal communication systems based on Code Division Multiple Access (CDMA), voice is transported as compressed low bit rate information between network elements. Due to cost efficiency, future implementations of CDMA networks likely will utilize the Asynchronous Transfer Mode (ATM) technology to connect components of the land network infrastructure. This paper discusses the capability of using ATM real-time connections in correspondence with the ATM Adaptation Layer 2 to carry compressed voice between CDMA network components. Two different scenarios are considered: the Base Transceiver Station to Base Station Controller connection and the connection between two Base Station Controllers. Capacity and performance evaluations are derived by means of simulation.

We take a look at the second part of the robot-selflocalization-problem. The hypotheses generated in a solution of the first part of the problem will be efficient reduced with the movement of the robot. A practical approach is described, using realistic paths and imprecise sensors. It operates on voronoi edges and voronoi vertices and can handle polygons with indiscribed obstacles. A new decision strategy will be discussed different from strategy MDL. Estimations will be given for time and space complexities and for the competitve ratio.

... into the specification documents of the ATM-Forum. The concept of the GFR service is to provide a minimum service guarantee to classical best-effort services, taking into account the frame-based nature of todays data-traffic. In this paper we present a discrete-time analysis of the GFR service and discuss the effects of variations of the bandwidth available for the GFR service. The presented method can be applied to dimension the thresholds of the algorithms used to enforce the guaranteed service.