1,470 research outputs found
Analysis of packet scheduling for UMTS EUL - design decisions and performance evaluation
The UMTS Enhanced Uplink (EUL) provides higher capacity, increased data rates and smaller latency on the communication link from users towards the network. In this paper we present a performance comparison of three distinct EUL scheduling schemes (one-by-one, partial parallel and full parallel) taking into account both the packet level characteristics and the flow level dynamics due to the (random) user behaviour.\ud
Using a very efficient hybrid analytical and simulation approach we analyse the three schemes with respect to performance measures such as mean file transfer time and fairness. In UMTS, a significant part of the system capacity will be used to support non-elastic voice traffic. Hence, part of our investigation is dedicated to the effects that the volume of voice traffic has on the performance of the elastic traffic supported by the EUL. Finally, we evaluate the impact that implementation specifics of a full parallel scheduler has on these measures.\ud
\ud
Our main conclusion is that our partial parallel scheduler, which is a hybrid between the one-by-one and full parallel, outperforms the other two schedulers in terms of mean flow transfer time, and is less sensitive to volume and nature of voice traffic. However, under certain circumstances, the partial parallel scheduler exhibits a somewhat lower fairness than the alternatives
An Energy-Efficient Reconfigurable Circuit Switched Network-on-Chip
Network-on-Chip (NoC) is an energy-efficient on-chip communication architecture for multi-tile System-on-Chip (SoC) architectures. The SoC architecture, including its run-time software, can replace inflexible ASICs for future ambient systems. These ambient systems have to be flexible as well as energy-efficient. To find an energy-efficient solution for the communication network we analyze three wireless applications. Based on their communication requirements we observe that revisiting of the circuit switching techniques is beneficial. In this paper we propose a new energy-efficient reconfigurable circuit-switched Network-on-Chip. By physically separating the concurrent data streams we reduce the overall energy consumption. The circuit-switched router has been synthesized and analyzed for its power consumption in 0.13 ¿m technology. A 5-port circuit-switched router has an area of 0.05 mm2 and runs at 1075 MHz. The proposed architecture consumes 3.5 times less energy compared to its packet-switched equivalen
Final report on the evaluation of RRM/CRRM algorithms
Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin
Quality of service optimization of multimedia traffic in mobile networks
Mobile communication systems have continued to evolve beyond the currently deployed Third
Generation (3G) systems with the main goal of providing higher capacity. Systems beyond 3G
are expected to cater for a wide variety of services such as speech, data, image transmission,
video, as well as multimedia services consisting of a combination of these. With the air interface
being the bottleneck in mobile networks, recent enhancing technologies such as the High Speed
Downlink Packet Access (HSDPA), incorporate major changes to the radio access segment of
3G Universal Mobile Telecommunications System (UMTS). HSDPA introduces new features
such as fast link adaptation mechanisms, fast packet scheduling, and physical layer retransmissions
in the base stations, necessitating buffering of data at the air interface which presents a
bottleneck to end-to-end communication. Hence, in order to provide end-to-end Quality of
Service (QoS) guarantees to multimedia services in wireless networks such as HSDPA, efficient
buffer management schemes are required at the air interface.
The main objective of this thesis is to propose and evaluate solutions that will address the
QoS optimization of multimedia traffic at the radio link interface of HSDPA systems. In the
thesis, a novel queuing system known as the Time-Space Priority (TSP) scheme is proposed for
multimedia traffic QoS control. TSP provides customized preferential treatment to the constituent
flows in the multimedia traffic to suit their diverse QoS requirements. With TSP queuing, the
real-time component of the multimedia traffic, being delay sensitive and loss tolerant, is given
transmission priority; while the non-real-time component, being loss sensitive and delay tolerant,
enjoys space priority. Hence, based on the TSP queuing paradigm, new buffer managementalgorithms are designed for joint QoS control of the diverse components in a multimedia session
of the same HSDPA user. In the thesis, a TSP based buffer management algorithm known as the
Enhanced Time Space Priority (E-TSP) is proposed for HSDPA. E-TSP incorporates flow
control mechanisms to mitigate congestion in the air interface buffer of a user with multimedia
session comprising real-time and non-real-time flows. Thus, E-TSP is designed to provide
efficient network and radio resource utilization to improve end-to-end multimedia traffic
performance. In order to allow real-time optimization of the QoS control between the real-time
and non-real-time flows of the HSDPA multimedia session, another TSP based buffer management
algorithm known as the Dynamic Time Space Priority (D-TSP) is proposed. D-TSP
incorporates dynamic priority switching between the real-time and non-real-time flows. D-TSP
is designed to allow optimum QoS trade-off between the flows whilst still guaranteeing the
stringent real-time component’s QoS requirements. The thesis presents results of extensive
performance studies undertaken via analytical modelling and dynamic network-level HSDPA
simulations demonstrating the effectiveness of the proposed TSP queuing system and the TSP
based buffer management schemes
An Efficient Uplink Multi-Connectivity Scheme for 5G mmWave Control Plane Applications
The millimeter wave (mmWave) frequencies offer the potential of orders of
magnitude increases in capacity for next-generation cellular systems. However,
links in mmWave networks are susceptible to blockage and may suffer from rapid
variations in quality. Connectivity to multiple cells - at mmWave and/or
traditional frequencies - is considered essential for robust communication. One
of the challenges in supporting multi-connectivity in mmWaves is the
requirement for the network to track the direction of each link in addition to
its power and timing. To address this challenge, we implement a novel uplink
measurement system that, with the joint help of a local coordinator operating
in the legacy band, guarantees continuous monitoring of the channel propagation
conditions and allows for the design of efficient control plane applications,
including handover, beam tracking and initial access. We show that an
uplink-based multi-connectivity approach enables less consuming, better
performing, faster and more stable cell selection and scheduling decisions with
respect to a traditional downlink-based standalone scheme. Moreover, we argue
that the presented framework guarantees (i) efficient tracking of the user in
the presence of the channel dynamics expected at mmWaves, and (ii) fast
reaction to situations in which the primary propagation path is blocked or not
available.Comment: Submitted for publication in IEEE Transactions on Wireless
Communications (TWC
Traffic integration in personal, local and geograhical wireless networks
Currently, users identify wireless networks with the first and second generation of cellular-telephony networks. Although voice and short messaging have driven the success of these networks so far, data and more sophisticated applications are emerging as the future driving forces for the extensive deployment of new wireless technologies. In this chapter we will consider future wireless technologies that will provide support to different types of traffic including legacy voice applications, Internet data traffic, and sophisticated multimedia applications. In the near future, wireless technologies will span from broadband wide-area technologies (such as satellite-based network and cellular networks) to local and personal area networks. Hereafter, for each class of networks, we will present the emerging wireless technologies for supporting service integration. Our overview will start by analyzing the Bluetooth technology that is the de-facto standard for Wireless Personal Area Networks (WPANs), i.e. networks that connect devices placed inside a circle with radius of 10 meters. Two main standards exist for Wireless Local Area Networks (WLANs): IEEE 802. and HiperLAN. In this chapter we focus on the IEEE 802.11 technology, as it is the technology currently available on the market. In this chapter, after a brief description of the IEEE 802.11 architecture, we will focus on the mechanisms that have been specifically designed to support delay sensitive traffics
Recommended from our members
Multimedia delivery in the future internet
The term “Networked Media” implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizens’ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications “on the move”, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
Recommended from our members
Radio Resource Management for Satellite UMTS. Dynamic scheduling algorithm for a UMTS-compatible satellite network.
The third generation of mobile communication systems introduce
interactive Multicast and Unicast multimedia services at a fast data rate of
up to 2 Mbps and is expected to complete the globalization of the mobile
telecommunication systems. The implementation of these services on
satellite systems, particularly for broadcast and multicast applications to
complement terrestrial services is ideal since satellite systems are capable
of providing global coverage in areas not served by terrestrial
telecommunication services. However, the main bottleneck of such
systems is the scarcity of radio resources for supporting multimedia
applications which has resulted in the rapid growth in research efforts for
deriving efficient radio resource management techniques. This issue is
addressed in this thesis, where the main emphasis is to design a dynamic
scheduling framework and algorithm that can improve the overall
performance of the radio resource management strategy of a UMTS
compatible satellite network, taking into account the unique characteristics
of wireless channel conditions.
This thesis will initially be focused on the design of the network and
functional architecture of a UMTS -compatible satellite network. Based on
this architecture, an effective scheduling framework is designed, which
can provide different types of resource assigning strategies. A functional
model of scheduler is defined to describe the behaviours and interactions
between different functional entities.
An OPNET simulation model with a complete network protocol stack is
developed to validate the performance of the scheduling algorithms
implemented in the satellite network. Different types of traffic are
considered for the OPNET simulation, such as the Poisson Process, ONOFF
Source and Self Similar Process, so that the performance of
scheduling algorithm can be analyzed for different types of services.
A novel scheduling algorithm is proposed to optimise the channel
utilisation by considering the characteristics of the wireless channel, which
are bursty and location dependent. In order to overcome the channel
errors, different code rates are applied for the user under different channel
conditions. The proposed scheduling algorithm is designed to give higher
priority to users with higher code rate, so that the throughput of network is
optimized and at the same time, maintaining the end users¿ service level
agreements. The fairness of the proposed scheduling algorithm is
validated using OPNET simulation. The simulation results show that the
algorithm can fairly allocate resource to different connections not only
among different service classes but also within the same service class
depending on their QoS attributes.Inmarsat Global Ltd. BGAN and the European Space Agency (ESA
Performance analysis of SIMO space-time scheduling with convex utility function: Zero-forcing linear processing
In a multiple-antenna system, an optimized design across the link and scheduling layers is crucial toward fully exploiting the temporal and spatial dimensions of the communication channel. In this paper, based on discrete optimization techniques, we derive a novel analytical framework for designing optimal space-time scheduling algorithms with respect to general convex utility functions. We focus on the reverse link (i.e., client to base station) and assume that the mobile terminal has a single transmit antenna while the base station has nR receive antennas. In order that our proposed framework is practicable and can be implemented with a reasonable cost in a real environment, we further assume that the physical layer involves only linear-processing complexity in separating signals from different users. As an illustration of the efficacy of our proposed analytical design framework, we apply the framework to two commonly used system utility functions, namely maximal throughput and proportional fair. We then devise an optimal scheduling algorithm based on our design framework. However, in view of the formidable time complexity of the optimal algorithm, we propose two fast practical scheduling techniques, namely the greedy algorithm and the genetic algorithm (GA). The greedy algorithm, which is similar to the one widely used in 3G1X and Qualcomm high-data-rate (HDR) systems (optimal when nR = 1), exhibits significantly inferior performance when nR > 1 as compared with the optimal approach. On the other hand, the GA is quite promising in terms of performance complexity tradeoff, especially for a system with a large number of users with even a moderately large nR. As a case in point, for a system with 20 users and nR = 4, the GA is more than 36 times faster than the optimal while the performance degradation is less than 10%, making it an attractive choice in the practical implementation for real-time link scheduling.published_or_final_versio
- …