15 research outputs found
Quality Of Service Enhancement In Ip Based Networks Using Diffserv
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2003Bu çalışmada, Diffserv mimarisi ile internet üzerinde servis kalitesi sağlama tartışılmıştır. Son on yılda IP tabanlı internette servis kalitesi sağlanamıyordu. İnternette bugün sağlanabilen tek servis ‘Best Effort (BE)’ adı verilen servistir. Yani, ağ, herhangi bir paketi hedefine ulaştırırken mümkün olan en verimli yolu kullanır ancak herhangi bir garanti ya da kaynak ayırımı yapmaz. Başka bir deyişle, trafik mümkün olduğu kadar hızlı ve herhangi bir zaman sınırı ya da miktar açısından garanti verilmeden işlenir. İnternetin ticari bir yapıya bürünmesiyle ‘Servis Kalitesi’ sağlanma ihtiyacı daha da artmıştır. Bu ihtiyaç farklı mimarilerin doğmasına yol açmıştır: IntServ ve DiffServ olmak üzere.Tez çalışmasında DiffServ mimarisi problem ve avantajlarıyla ele alınmıştır. Son bölümde ise NS2 ağ simulasyon yazılımı kullanılarak DiffServ implementasyonları yapılmış sonuçları karşılaştırmalı olarak verilmiştir.In this study improving Quality of Service (QoS) on the Internet with DiffServ architecture is discussed. Within the past decade, it is certainly not support for Quality of Service (QoS) over the IP-based ubiquitous Internet. The Internet as it stands today only support one service class called -Best-Effort (BE) Service. The network would make an earnest attempt to deliver packets to their destinations but with no guarantees and/or special resources allocated for any of the packets. With another words, traffic is processed as quickly as possible but there is no guarantee as to timeliness or actual delivery or even how much can be delivered (i.e. throughput). With the rapid transformation of the Internet into a commercial infrastructure, demands for Quality of Service (QoS) have rapidly developed. This need was resulted to different architectures: IntServ and DiffServ. In the study some DiffServ implementations are discussed with their problems and gains. At the last section with using NS2 simulation programming language some DiffServ implementations are given with the compared results.Yüksek LisansM.Sc
A QoS-aware architecture for mobile internet
Tese de doutoramento InformáticaHoje em dia, as pessoas pretendem ter simultaneamente mobilidade, qualidade de serviço e
estar sempre connectados à Internet. No intuito, de satisfazer estes clientes muito exigentes,
os mercados das telecomunicações estão a impor novos e dificeis desafios às redes móveis,
através da demanda, de heterogeneidade em termos de tecnologias de acesso rádio, novos
serviços, niveis de qualidade de serviço adequados aos requisitos das aplicações de tempo
real, elevada taxa de utilização do recursos disponiveis e melhor capacidade de desempenho.
A Internet foi concebida para fornecer serviços sem qualquer tipo de garantias de qualidade
às aplicações, apenas se comprometendo em oferecer o melhor serviço possível. No
entanto, nos útlimos anos diversos esforços foram levados a cabo no sentido de dotar a
Internet com o suporte à qualidade de serviço. Dos esforços desenvolvidos resultaram
dois paradigmas para o suporte da qualidade de serviço: o modelo de Serviços Integrados
(Integrated Services - IntServ) e o modelo de Serviços Diferenciados (Differentiated Services
- DiffServ). Todavia, estes modelos de qualidade de serviço (QoS) foram concebido antes
da existência da Internet móvel, portanto o desenvolvimento destes modelos não teve em
consideração a questão da mobilidade.
Por outro lado, o protocolo padrão actual para a Internet móvel, o MIPv6, revela algumas
limitações nos cenários onde os utilizadores estão constantemente a moverem-se para
outros pontos de acesso. Neste tipo de cenários, o MIPv6 introduz tempos de latência que
não são sustentáveis para aplicações com requisitos de QoS mais restritos. Os factos revelados,
demonstram que existe uma emergente necessidade de adaptar o actual protocolo de
mobilidade, e também de adaptar os modelos de QoS, ou então criar modelos alternativos
de QoS, para satisfazer às exigências do utilizador de hoje de redes móveis.
Para alcançar este objectivo o presente trabalho propõe melhorias no sistema de gestão
da mobilidade do protocolo MIPv6 e na gestão de recursos do modelo DiffServ. O MIPv6 foi
melhorado para os cenários de micro-mobilidade com a abordagem para micro-mobilidade do F-HMIPv6. Enquanto que, o modelo DiffServ foi melhorado para os ambientes móveis
com funcionalidades dinâmicas e adaptativas através da utilização de sinalização de QoS e
da gestão distribuida dos recursos.
A gestão da mobilidade e dos recursos foi também acoplada na solução proposta com o
propósito de optimizar a utilização dos recursos num meio onde os recursos são tipicamente
escassos.
O modelo proposto é simples, é de fácil implementação, tem em consideração os requisitos
da Internet móvel, e provou ser eficiente e capaz de fornecer serviços com QoS de
elevada fiabilidade às aplicações.Over the last few years, several network communication challenges have arisen as a
result of the growing number of users demanding Quality of Service (QoS) and mobility
simultaneously.
In order to satisfy these very demanding customers, the markets are imposing new
challenges to wireless networks by demanding heterogeneity in terms of wireless access
technologies, new services, suited QoS levels to real-time applications, high usability and
improved performance.
However, the Internet has been designed for providing application services without quality
guarantees. That explains why, in the last years several efforts have been made to
endow Internet with QoS support. From the developed efforts have resulted two QoS
paradigms: Integrated Services (IntServ) which offers the guaranteed service model and
the Differentiated Services (DiffServ) which offers the predictive service model.
Although these QoS models have been designed before the existence of mobile Internet,
so they do not consider the mobility issue. For instance, the guaranteed service model
requires that whenever a Mobile Node (MN) wants to move to a new location, the allocated
resources in the old path must be released and a new resource reservation in a new path must
be made, resulting in extra signaling overhead, heavy processing and state load. Therefore,
if handovers are frequent, large mobility and QoS signaling messages will be created in
the access networks. Consequently, significant scalability problems may arise with this type of
service model.
The predicted service model, on the other hand, requires an additional features such
as dynamic and adaptive resource management in order to be efficient in a very dynamic
network such as a mobile network.
A QoS solution for mobile environments must provide the capacity to adapt its resource
utilization to a changeable nature of wireless networks because they have a more dynamic behavior due to incoming or outgoing handovers. For this reason, a QoS signalization for
dynamic resource provisioning is necessary in order to supply adequate QoS levels to mobile
users.
On the other hand, the current standard protocol for mobile Internet, Mobile IPv6
(MIPv6), reveals limitations in scenarios where users are constantly moving to another
point of attachment. In these situations, MIPv6 introduces latency times that are not
sustainable for applications with strict QoS requirements.
All things considered, reveal the emerging need to adapt the current standard mobility
protocol and QoS models to satisfy today’s mobile user’s requirements.
To accomplish this goal, the present work proposes enhancements in terms of the MIPv6
protocol mobility management scheme as well as in DiffServ QoS model resource management.
The former was enhanced for micro-mobility scenarios with a specific combination of
FMIPv6 (Fast Mobile IPv6) and HMIPv6 (Hierarchical Mobile IPv6) protocols. Whereas,
the latter was enhanced for mobile environments with dynamic and adaptive features by
using QoS signalization as well as distributed resource management.
The mobility and resource management has also been coupled in the proposed solution
with the objective of optimizing the resource utilization in a environment where resources
are typically scarce.
In order to assess model performance as well as its parametrization, a simulation model
has been designed and implemented in the Network Simulator version two (NS-2).
The model´s performance evaluation has been conducted based on the respective data
acquired from statistical analysis in order to validate and consolidate the conclusions. Simulation
results indicate that the solution avoids network congestion and starvation of less
priority DiffServ classes.
Moreover, the results also indicate that bandwidth utilization for priority classes increases
and the QoS offered to MN’s applications, in each DiffServ class, remains unchangeable
with MN mobility.
The proposed model is simple and easy to implement. It considers mobile Internet
requirements and has proven to be effective and capable of providing services with highly
reliable QoS to mobile applications.Fundação para a Ciência e a Tecnologia (FCT) - Bolsa SFRH/BD/35245/200
Recommended from our members
A Connection Admission Control Framework for UMTS based Satellite Systems.An Adaptive Admission Control algorithm with pre-emption control mechanism for unicast and multicast communications in satellite UMTS.
In recent years, there has been an exponential growth in the use of
multimedia applications. A satellite system offers great potential for
multimedia applications with its ability to broadcast and multicast a large
amount of data over a very large area as compared to a terrestrial system.
However, the limited transmission capacity along with the dynamically
varying channel conditions impedes the delivery of good quality multimedia
service in a satellite system which has resulted 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 CAC framework which
maximizes the utilization of the scarce radio resources available in the
satellite and at the same time increases the performance of the system for a
UMTS based satellite system supporting unicast and multicast traffic.
The design of the system architecture for a UMTS based satellite system is
presented. Based on this architecture, a CAC framework is designed
consisting of three different functionalities: the admission control procedure,
the retune procedure and the pre-emption procedure. The joint use of these
functionalities is proposed to allow the performance of the system to be
maintained under congestion. Different algorithms are proposed for different
functionalities; an adaptive admission control algorithm, a greedy retune
algorithm and three pre-emption algorithms (Greedy, SubSetSum, and
Fuzzy).
A MATLAB simulation model is developed to study the performance of the
proposed CAC framework. A GUI is created to provide the user with the
flexibility to configure the system settings before starting a simulation. The
configuration settings allow the system to be analysed under different
conditions.
The performance of the system is measured under different simulation
settings such as enabling and disabling of the two functionalities of the CAC
framework; retune procedure and the pre-emption procedure. The simulation
results indicate the CAC framework as a whole with all the functionalities
performs better than the other simulation settings
NASA SBIR abstracts of 1990 phase 1 projects
The research objectives of the 280 projects placed under contract in the National Aeronautics and Space Administration (NASA) 1990 Small Business Innovation Research (SBIR) Phase 1 program are described. The basic document consists of edited, non-proprietary abstracts of the winning proposals submitted by small businesses in response to NASA's 1990 SBIR Phase 1 Program Solicitation. The abstracts are presented under the 15 technical topics within which Phase 1 proposals were solicited. Each project was assigned a sequential identifying number from 001 to 280, in order of its appearance in the body of the report. The document also includes Appendixes to provide additional information about the SBIR program and permit cross-reference in the 1990 Phase 1 projects by company name, location by state, principal investigator, NASA field center responsible for management of each project, and NASA contract number
Methods of Congestion Control for Adaptive Continuous Media
Since the first exchange of data between machines in different locations in early 1960s,
computer networks have grown exponentially with millions of people now using the
Internet. With this, there has also been a rapid increase in different kinds of services offered
over the World Wide Web from simple e-mails to streaming video. It is generally accepted
that the commonly used protocol suite TCP/IP alone is not adequate for a number of
modern applications with high bandwidth and minimal delay requirements. Many
technologies are emerging such as IPv6, Diffserv, Intserv etc, which aim to replace the onesize-fits-all approach of the current lPv4. There is a consensus that the networks will have
to be capable of multi-service and will have to isolate different classes of traffic through
bandwidth partitioning such that, for example, low priority best-effort traffic does not cause
delay for high priority video traffic. However, this research identifies that even within a
class there may be delays or losses due to congestion and the problem will require different
solutions in different classes.
The focus of this research is on the requirements of the adaptive continuous media
class. These are traffic flows that require a good Quality of Service but are also able to
adapt to the network conditions by accepting some degradation in quality. It is potentially
the most flexible traffic class and therefore, one of the most useful types for an increasing
number of applications.
This thesis discusses the QoS requirements of adaptive continuous media and
identifies an ideal feedback based control system that would be suitable for this class. A
number of current methods of congestion control have been investigated and two methods
that have been shown to be successful with data traffic have been evaluated to ascertain if
they could be adapted for adaptive continuous media. A novel method of control based on
percentile monitoring of the queue occupancy is then proposed and developed. Simulation
results demonstrate that the percentile monitoring based method is more appropriate to this
type of flow. The problem of congestion control at aggregating nodes of the network
hierarchy, where thousands of adaptive flows may be aggregated to a single flow, is then
considered. A unique method of pricing mean and variance is developed such that each
individual flow is charged fairly for its contribution to the congestion
Intelligent adaptive bandwidth provisioning for quality of service in umts core networks
Master'sMASTER OF ENGINEERIN
Actas da 10ª Conferência sobre Redes de Computadores
Universidade do MinhoCCTCCentro AlgoritmiCisco SystemsIEEE Portugal Sectio
Reactive traffic control mechanisms for communication networks with self-similar bandwidth demands
Communication network architectures are in the process of being redesigned so that many different services are integrated within the same network. Due to this integration, traffic management algorithms need to balance the requirements of the traffic which the algorithms are directly controlling with Quality of Service (QoS) requirements of other classes of traffic which will be encountered in the network. Of particular interest is one class of traffic, termed elastic traffic, that responds to dynamic feedback from the network regarding the amount of available resources within the network. Examples of this type of traffic include the Available Bit Rate (ABR) service in Asynchronous Transfer Mode (ATM) networks and connections using Transmission Control Protocol (TCP) in the Internet. Both examples aim to utilise available bandwidth within a network.
Reactive traffic management, like that which occurs in the ABR service and TCP, depends explicitly on the dynamic bandwidth requirements of other traffic which is currently using the network. In particular, there is significant evidence that a wide range of network traffic, including Ethernet, World Wide Web, Varible Bit Rate video and signalling traffic, is self-similar. The term self-similar refers to the particular characteristic of network traffic to remain bursty over a wide range of time scales. A closely associated characteristic of self-similar traffic is its long-range dependence (LRD), which refers to the significant correlations that occur with the traffic. By utilising these correlations, greater predictability of network traffic can be achieved, and hence the performance of reactive traffic management algorithms can be enhanced.
A predictive rate control algorithm, called PERC (Predictive Explicit Rate Control), is proposed in this thesis which is targeted to the ABR service in ATM networks. By incorporating the LRD stochastic structure of background traffic, measurements of the bandwidth requirements of background traffic, and the delay associated with a particular ABR connection, a predictive algorithm is defined which provides explicit rate information that is conveyed to ABR sources. An enhancement to PERC is also described. This algorithm, called PERC+, uses previous control information to correct prediction errors that occur for connections with larger round-trip delay. These algorithms have been extensively analysed with regards to their network performance, and simulation results show that queue lengths and cell loss rates are significantly reduced when these algorithms are deployed. An adaptive version of PERC has also been developed using real-time parameter estimates of self-similar traffic. This has excellent performance compared with standard ABR rate control algorithms such as ERICA.
Since PERC and its enhancement PERC+ have explicitly utilised the index of self-similarity, known as the Hurst parameter, the sensitivity of these algorithms to this parameter can be determined analytically. Research work described in this thesis shows that the algorithms have an asymmetric sensitivity to the Hurst parameter, with significant sensitivity in the region where the parameter is underestimated as being close to 0.5. Simulation results reveal the same bias in the performance of the algorithm with regards to the Hurst parameter. In contrast, PERC is insensitive to estimates of the mean, using the sample mean estimator, and estimates of the traffic variance, which is due to the algorithm primarily utilising the correlation structure of the traffic to predict future bandwidth requirements.
Sensitivity analysis falls into the area of investigative research, but it naturally leads to the area of robust control, where algorithms are designed so that uncertainty in traffic parameter estimation or modelling can be accommodated. An alternative robust design approach, to the standard maximum entropy approach, is proposed in this thesis that uses the maximum likelihood function to develop the predictive rate controller. The likelihood function defines the proximity of a specific traffic model to the traffic data, and hence gives a measure of the performance of a chosen model. Maximising the likelihood function leads to optimising robust performance, and it is shown, through simulations, that the system performance is close to the optimal performance as compared with maximising the spectral entropy.
There is still debate regarding the influence of LRD on network performance. This thesis also considers the question of the influence of LRD on traffic predictability, and demonstrates that predictive rate control algorithms that only use short-term correlations have close performance to algorithms that utilise long-term correlations. It is noted that predictors based on LRD still out-perform ones which use short-term correlations, but that there is Potential simplification in the design of predictors, since traffic predictability can be achieved using short-term correlations.
This thesis forms a substantial contribution to the understanding of control in the case where self-similar processes form part of the overall system. Rather than doggedly pursuing self-similar control, a broader view has been taken where the performance of algorithms have been considered from a number of perspectives. A number of different research avenues lead on from this work, and these are outlined