1,803 research outputs found
Performance Modeling of the PeopleSoft Multi-Tier Remote Computing Architecture
Complex client-server configurations being designed today require a new and closely coordinated approach to analytic modeling and measurement. A closed queuing network model for a two-tiered PeopleSoft 6 client-server system with an Oracle database server is demonstrated using a new performance modeling tool that applies mean value analysis. The focus of this work is on the measurement and modeling of the PeopleSoft architecture to provide useful capacity planning insights for an actual large-scale university-wide deployment. A testbed and database exerciser are then developed to measure model parameters and perform the initial validation tests. The testbed also provides preliminary test data on a proposed three-tiered deployment architecture that includes the Citrix WinFrame environment as an intermediate level between the client and the Oracle server.http://deepblue.lib.umich.edu/bitstream/2027.42/107929/1/citi-tr-97-5.pd
Scheduling Policies in Time and Frequency Domains for LTE Downlink Channel: A Performance Comparison
A key feature of the Long-Term Evolution (LTE) system is that the packet scheduler can make use of the channel quality information (CQI), which is periodically reported by user equipment either in an aggregate form for the whole downlink channel or distinguished for each available subchannel. This mechanism allows for wide discretion in resource allocation, thus promoting the flourishing of several scheduling algorithms, with different purposes. It is therefore of great interest to compare the performance of such algorithms under different scenarios. Here, we carry out a thorough performance analysis of different scheduling algorithms for saturated User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) traffic sources, as well as consider both the time- and frequency-domain versions of the schedulers and for both flat and frequency-selective channels. The analysis makes it possible to appreciate the difference among the scheduling algorithms and to assess the performance gain, in terms of cell capacity, users' fairness, and packet service time, obtained by exploiting the richer, but heavier, information carried by subchannel CQI. An important part of this analysis is a throughput guarantee scheduler, which we propose in this paper. The analysis reveals that the proposed scheduler provides a good tradeoff between cell capacity and fairness both for TCP and UDP traffic sources
Achieving Ultra-Low Latency in 5G Millimeter Wave Cellular Networks
The IMT 2020 requirements of 20 Gbps peak data rate and 1 millisecond latency
present significant engineering challenges for the design of 5G cellular
systems. Use of the millimeter wave (mmWave) bands above 10 GHz --- where vast
quantities of spectrum are available --- is a promising 5G candidate that may
be able to rise to the occasion.
However, while the mmWave bands can support massive peak data rates,
delivering these data rates on end-to-end service while maintaining reliability
and ultra-low latency performance will require rethinking all layers of the
protocol stack. This papers surveys some of the challenges and possible
solutions for delivering end-to-end, reliable, ultra-low latency services in
mmWave cellular systems in terms of the Medium Access Control (MAC) layer,
congestion control and core network architecture
Flow Level QoE of Video Streaming in Wireless Networks
The Quality of Experience (QoE) of streaming service is often degraded by
frequent playback interruptions. To mitigate the interruptions, the media
player prefetches streaming contents before starting playback, at a cost of
delay. We study the QoE of streaming from the perspective of flow dynamics.
First, a framework is developed for QoE when streaming users join the network
randomly and leave after downloading completion. We compute the distribution of
prefetching delay using partial differential equations (PDEs), and the
probability generating function of playout buffer starvations using ordinary
differential equations (ODEs) for CBR streaming. Second, we extend our
framework to characterize the throughput variation caused by opportunistic
scheduling at the base station, and the playback variation of VBR streaming.
Our study reveals that the flow dynamics is the fundamental reason of playback
starvation. The QoE of streaming service is dominated by the first moments such
as the average throughput of opportunistic scheduling and the mean playback
rate. While the variances of throughput and playback rate have very limited
impact on starvation behavior.Comment: 14 page
Multipath streaming: fundamental limits and efficient algorithms
We investigate streaming over multiple links. A file is split into small
units called chunks that may be requested on the various links according to
some policy, and received after some random delay. After a start-up time called
pre-buffering time, received chunks are played at a fixed speed. There is
starvation if the chunk to be played has not yet arrived. We provide lower
bounds (fundamental limits) on the starvation probability of any policy. We
further propose simple, order-optimal policies that require no feedback. For
general delay distributions, we provide tractable upper bounds for the
starvation probability of the proposed policies, allowing to select the
pre-buffering time appropriately. We specialize our results to: (i) links that
employ CSMA or opportunistic scheduling at the packet level, (ii) links shared
with a primary user (iii) links that use fair rate sharing at the flow level.
We consider a generic model so that our results give insight into the design
and performance of media streaming over (a) wired networks with several paths
between the source and destination, (b) wireless networks featuring spectrum
aggregation and (c) multi-homed wireless networks.Comment: 24 page
- …