Spelling suggestions: "subject:"qualityandservice"" "subject:"quality:service""
291 |
Localised Routing Algorithms with Quality of Service Constraints. Development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics.Li, Ding January 2010 (has links)
School of Computing, Informatics and Media / Localised QoS routing is a relatively new, alternative and viable approach to solve the problems of traditional QoS routing algorithms which use global state information resulting in the imposition of a large communication overhead and route flapping. They make use of a localised view of the network QoS state in source nodes to select paths and route flows to destination nodes. Proportional Sticky Routing (PSR) and Credit Based Routing (CBR) have been proposed as localised QoS routing schemes and these can offer comparable performances. However, since network state information for a specific path is only updated when the path is used, PSR and CBR operate with decision criteria that are often stale for paths that are used infrequently.
The aim of this thesis is to focus on localised QoS routing and contribute to enhancing the scalability of QoS routing algorithms. In this thesis we have developed three new localised QoS routing schemes which are called Score Based QoS Routing (SBR), Bandwidth Based QoS Routing (BBR) and Delay Based Routing (DBR). In some of these schemes, the path setup procedure is distributed and uses the current network state to make decisions thus avoiding problems of staleness. The methods also avoid any complicated calculations. Both SBR and BBR use bandwidth as the QoS metric and mean delay is used as the QoS metric in DBR. Extensive simulations are applied to compare the performance of our proposed algorithms with CBR and the global Dijkstra¿s algorithm for different update intervals of link state, different network topologies and using different flow arrival distributions under a wide range of traffic loads. It is demonstrated by simulation that the three proposed algorithms offer a superior performance under comparable conditions to the other localised and global algorithms.
|
292 |
Radio Resource Management for Satellite UMTS. Dynamic scheduling algorithm for a UMTS-compatible satellite network.Xu, Kai J. January 2009 (has links)
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)
|
293 |
Performance analysis and improvement of InfiniBand networks. Modelling and effective Quality-of-Service mechanisms for interconnection networks in cluster computing systems.Yan, Shihang January 2012 (has links)
The InfiniBand Architecture (IBA) network has been proposed as a new
industrial standard with high-bandwidth and low-latency suitable for constructing
high-performance interconnected cluster computing systems. This architecture
replaces the traditional bus-based interconnection with a switch-based network for
the server Input-Output (I/O) and inter-processor communications. The efficient
Quality-of-Service (QoS) mechanism is fundamental to ensure the import at QoS
metrics, such as maximum throughput and minimum latency, leaving aside other
aspects like guarantee to reduce the delay, blocking probability, and mean queue
length, etc.
Performance modelling and analysis has been and continues to be of great
theoretical and practical importance in the design and development of
communication networks. This thesis aims to investigate efficient and cost-effective
QoS mechanisms for performance analysis and improvement of InfiniBand
networks in cluster-based computing systems.
Firstly, a rate-based source-response link-by-link admission and congestion
control function with improved Explicit Congestion Notification (ECN) packet
marking scheme is developed. This function adopts the rate control to reduce
congestion of multiple-class traffic. Secondly, a credit-based flow control scheme is
presented to reduce the mean queue length, throughput and response time of the system. In order to evaluate the performance of this scheme, a new queueing
network model is developed. Theoretical analysis and simulation experiments show
that these two schemes are quite effective and suitable for InfiniBand networks.
Finally, to obtain a thorough and deep understanding of the performance attributes
of InfiniBand Architecture network, two efficient threshold function flow control
mechanisms are proposed to enhance the QoS of InfiniBand networks; one is Entry
Threshold that sets the threshold for each entry in the arbitration table, and other is
Arrival Job Threshold that sets the threshold based on the number of jobs in each
Virtual Lane. Furthermore, the principle of Maximum Entropy is adopted to analyse
these two new mechanisms with the Generalized Exponential (GE)-Type
distribution for modelling the inter-arrival times and service times of the input traffic.
Extensive simulation experiments are conducted to validate the accuracy of the
analytical models.
|
294 |
VaROT: Methodology for Variation-Tolerant DSP Hardware Design using Post-Silicon Truncation of Operand WidthKunaparaju, Keerthi 15 March 2011 (has links)
No description available.
|
295 |
A PRIORITY-BASED RESOURCE MANAGEMENT APPROACH FOR DYNAMIC AND HARD MISSION CRITICAL REAL-TIME SYSTEMSShah, Purvi 21 April 2005 (has links)
No description available.
|
296 |
RMBench: A Benchmarking Suite for Distributed Real-Time MiddlewareDelaney, Matthew 10 October 2005 (has links)
No description available.
|
297 |
Coordinated management of resource allocations and application quality of service level adaptation for real-time systemsJain, Shikha January 2002 (has links)
No description available.
|
298 |
Internet Traffic Engineering: QoS Translation and SurvivabilityGoyal, Mukul 19 March 2003 (has links)
No description available.
|
299 |
Protocols for Mission-Critical Wireless Sensor NetworksFelemban, Emad 24 September 2009 (has links)
No description available.
|
300 |
To share or not to share : Investigating the potential key qualities of a digital C2B carsharing serviceSenyemi, Collins January 2022 (has links)
Compared to private car ownership, carsharing has emerged as one of the innovative ways of promoting sustainable and more environmentally friendly transportation. As a service thathas existed for decades, carsharing has evolved significantly, with the introduction of several business and service models to create value for users. Despite the popularity of carsharing, private car ownership continues to grow, even though these cars end up being parked most of the time, contributing to congestion in urban areas. Using an exploratory research approach with the aid of speculative design, this thesis investigated the key qualities of a potential digital carsharing service for private vehicle owners, who could share their vehicles with fleet operators during times when the vehicles are idle. Qualitative, semi-structured interviews of ten private vehicle owners wereconducted to investigate the qualities of the potential digital carsharing service. The potential key qualities were grouped under technical and functional qualities according to Grönroos’ Nordic service quality model. The results indicate the importance of designing services that leverage technical qualities such as reward, accessibility, appearance and safety, and security, and functional qualities such as assurance, flexibility, responsiveness, and personalized.
|
Page generated in 0.0607 seconds