Journal of Telecommunications and Information Technology, 2003, nr 3

kwartalni

Journal of Telecommunications and Information Technology, 2009, nr 3

kwartalni

On-board B-ISDN fast packet switching architectures. Phase 1: Study

The broadband integrate services digital network (B-ISDN) is an emerging telecommunications technology that will meet most of the telecommunications networking needs in the mid-1990's to early next century. The satellite-based system is well positioned for providing B-ISDN service with its inherent capabilities of point-to-multipoint and broadcast transmission, virtually unlimited connectivity between any two points within a beam coverage, short deployment time of communications facility, flexible and dynamic reallocation of space segment capacity, and distance insensitive cost. On-board processing satellites, particularly in a multiple spot beam environment, will provide enhanced connectivity, better performance, optimized access and transmission link design, and lower user service cost. The following are described: the user and network aspects of broadband services; the current development status in broadband services; various satellite network architectures including system design issues; and various fast packet switch architectures and their detail designs

Stochastig modeling with continuous feedback markov fluid queues

Cataloged from PDF version of article.Markov fluid queues (MFQ) are systems in which a continuous-time Markov chain determines the net rate into (or out of ) a buffer. We deal with continuous feedback MFQs (CFMFQ) for which the infinitesimal generator of the background process and the drifts in each state are allowed to depend on the buffer level through continuous functions. Explicit solutions of CFMFQs for a few special cases has been reported, but usually numerical methods are preferred. A numerically stable solution method based on ordered Schur decomposition is already known for multi-regime MFQs (MRMFQ). We propose a framework for approximating CFMFQs by MRMFQs via discretizing the buffer space. The parameters of the CFMFQ are approximated by piecewise constant functions. Then, the solution is obtained by block-tridiagonal LU decomposition for the related MRMFQ. Moreover, we describe a numerical method that enables us to solve large scale systems efficiently. We model basically two different stochastic systems with CFMFQs. The first is the workload-bounded MAP/PH/1 queue, to which the arrivals occur according to a workload-dependent MAP (Markovian Arrival Process), and the arriving job size distribution is phase-type. The jobs that would cause the buffer to overflow are rejected partially or completely. Also, the service speed is allowed to depend on the buffer level. As the second application, we model the horizon-based delayed reservation mechanism in Optical Burst Switching networks with or without fiber delay lines. We allow multiple traffic classes and the effect of offset-based and FDL-based differentiation among traffic classes in terms of burst blocking is investigated. Lastly, we propose a distributed algorithm for air-time fairness in multi-rate WLANs that overcomes the performance anomaly in IEEE 802.11 WLANs. We also give a stochastic model of the proposed model, and provide a novel and elaborate proof for its effectiveness. We also present an extensive simulation study.Yazıcı, Mehmet AkifPh.D

Modeling and optimizing network infrastructure for autonomous vehicles

Autonomous vehicle (AV) technology has matured sufficiently to be in testing on public roads. However, traffic models of AVs are still in development. Most previous work has studied AV technologies in micro-simulation. The purpose of this dissertation is to model and optimize AV technologies for large city networks to predict how AVs might affect city traffic patterns and travel behaviors. To accomplish these goals, we construct a dynamic network loading model for AVs, consisting of link and node models of AV technologies, which is used to calculate time-dependent travel times in dynamic traffic assignment. We then study several applications of the dynamic network loading to predict how AVs might affect travel demand and traffic congestion. AVs admit reduced perception-reaction times through technologies such as (cooperative) adaptive cruise control, which can reduce following headways and increase capacity. Previous work has studied these in micro-simulation, but we construct a mesoscopic simulation model for analyses on large networks. To study scenarios with both autonomous and conventional vehicles, we modify the kinematic wave theory to include multiple classes of flow. The flow-density relationship also changes in space and time with the class proportions. We present multiclass cell transmission model and prove that it is a Godunov approximation to the multiclass kinematic wave theory. We also develop a car-following model to predict the fundamental diagram at arbitrary proportions of AVs. Complete market penetration scenarios admit dynamic lane reversal -- changing lane direction at high frequencies to more optimally allocate road capacity. We develop a kinematic wave theory in which the number of lanes changes in space and time, and approximately solve it with a cell transmission model. We study two methods of determining lane direction. First, we present a mixed integer linear program for system optimal dynamic traffic assignment. Since this program is computationally difficult to solve, we also study dynamic lane reversal on a single link with deterministic and stochastic demands. The resulting policy is shown to significantly reduce travel times on a city network. AVs also admit reservation-based intersection control, which can make greater use of intersection capacity than traffic signals. AVs communicate with the intersection manager to reserve space-time paths through the intersection. We create a mesoscopic node model by starting with the conflict point variant of reservations and aggregating conflict points into capacity-constrained conflict regions. This model yields an integer program that can be adapted to arbitrary objective functions. To motivate optimization, we present several examples on theoretical and realistic networks demonstrating that naïve reservation policies can perform worse than traffic signals. These occur due to asymmetric intersections affecting optimal capacity allocation and/or user equilibrium route choice behavior. To improve reservations, we adapt the decentralized backpressure wireless packet routing and P0 traffic signal policies for reservations. Results show significant reductions in travel times on a city network. Having developed link and node models, we explore how AVs might affect travel demand and congestion. First, we study how capacity increases and reservations might affect freeway, arterial, and city networks. Capacity increases consistently reduced congestion on all networks, but reservations were not always beneficial. Then, we use dynamic traffic assignment within a four-step planning model, adding the mode choice of empty repositioning trips to avoid parking costs. Results show that allowing empty repositioning to encourage adoption of AVs could reduce congestion. Also, once all vehicles are AVs, congestion will still be significantly reduced. Finally, we present a framework to use the dynamic network loading model to study shared AVs. Results show that shared AVs could reduce congestion if used in certain ways, such as with dynamic ride-sharing. However, shared AVs also cause significant congestion. To summarize, this dissertation presents a complete mesoscopic simulation model of AVs that could be used for a variety of studies of AVs by planners and practitioners. This mesoscopic model includes new node and link technologies that significantly improve travel times over existing infrastructure. In addition, we motivate and present more optimal policies for these AV technologies. Finally, we study several travel behavior scenarios to provide insights about how AV technologies might affect future traffic congestion. The models in this dissertation will provide a basis for future network analyses of AV technologies.Civil, Architectural, and Environmental Engineerin

Design, testing and performance analisys of efficient lock-free solutions for multi-core Linux scheduler

Multiprocessor systems are nowadays de facto standard for both personal computers and server workstations. Benefits of multi-core technology has recently been used for embedded devices and cellular phones as well. Linux has not been originally designed to be a Real-Time Operating System (RTOS) but, recently, a new scheduling class, named SCHED_DEADLINE, was added to it. SCHED_DEADLINE is an implementation of the well known Earliest Deadline First algorithm. In this thesis we first present PRACTISE, a tool for developing, debugging, testing and analyse real-time scheduling data structures in user space. Unlike other similar tools, PRACTISE executes code in parallel, allowing to test and analyse the performance of the code in a realistic multiprocessor scenario. We also show an implementation of a skiplist, realized with the help of the tool above. This implementation is intended to be used for processes migration among the CPUs in SCHED_DEADLINE. To effectively manage the concurrent accesses to the data structure we used a revised version of the flat combining framework

Access to telecommunications markets: the interrelation between general competition rules and sector-specific rules In the EU and Japan

The starting point of the thesis is the key competition law issues that arise in relation to access to telecommunications markets in the EU and Japan. This issue is presently regulated in the EU and Japan by a dual regime combining general competition law regulation and sector-specific regulation aimed at opening up the markets. Chapter 1 analyses the relevant general competition rules (i.e. dominance and its abuse, including the doctrine of essential facilities) and the relevant sector-specific rules (i.e. interconnection) that apply to access to EU telecommunications markets. Chapter 2 does the same exercise for Japan through the analysis of the relevant general competition rules (i.e. refusal to deal) and sector-specific rules (i.e. general market access regulation and interconnection) that apply to access to Japanese telecommunications markets. The analysis described above leads to the core object of the thesis which is the study, undertaken at Chapter 3, of the interrelation between general competition rules and sector-specific rules as they apply to access to telecommunications markets in the EU and Japan. This thesis will argue that the dual regime presently regulating access to the EU and Japanese telecommunications industries needs to be maintained. However, the increasing complexity and dynamic character of the telecommunications industry means that a change in the current interrelation between the two types of regulation is necessary. It will be argued that the future balance between the two types of regulation should be one where sector-specific rules will increasingly serve limited functions and where general competition rules will progressively take precedence over the regulation of third party access to telecommunications markets