QoS support in satellite and wireless networks: study under the network simulator (NS-2)

Aquest projecte es basa en l'estudi de l'oferiment de qualitat de servei en xarxes wireless i satel·litals. Per això l'estudi de les tècniques de cross-layer i del IEEE 802.11e ha sigut el punt clau per al desenvolupament teòric d’aquest estudi. Usant el simulador de xarxes network simulator, a la part de simulacions es plantegen tres situacions: l'estudi de la xarxa satel·lital, l'estudi del mètode d'accés HCCA i la interconnexió de la xarxa satel·lital amb la wireless. Encara que aquest últim punt, incomplet en aquest projecte, ha de ser la continuació per a futures investigacions.

Multicast extension of unicast charging for QoS Services

In order to successfully deploy multicast services in QoS-aware networks, pricing architectures must take into account the particular characteristics of multicast sessions. With this objective, we propose a charging scheme for QoS multicast services, assuming that the unicast cost of each interconnecting link is determined and that such cost is expressed in terms of quality of service (QoS) parameters. Our scheme allows determining the cost distribution of a multicast session along a cost distribution tree (CDT), and basing such distribution in those pre-existing unicast cost functions. The paper discusses in detail the main characteristics of the problem in a realistic interdomain scenario and how the proposed scheme would contribute to its solution

A quality-based cost distribution charging scheme for QoS multicast networks

This paper presents a new charging scheme for cost distribution along a point-to-multipoint connection when destination nodes are responsible for the cost. The scheme focus on QoS considerations and a complete range of choices is presented. These choices go from a safe scheme for the network operator to a fair scheme to the customer. The in-between cases are also covered. Specific and general problems, like the incidence of users disconnecting dynamically is also discussed. The aim of this scheme is to encourage the users to disperse the resource demand instead of having a large number of direct connections to the source of the data, which would result in a higher than necessary bandwidth use from the source. This would benefit the overall performance of the network. The implementation of this task must balance between the necessity to offer a competitive service and the risk of not recovering such service cost for the network operator. Throughout this paper reference to multicast charging is made without making any reference to any specific category of service. The proposed scheme is also evaluated with the criteria set proposed in the European ATM charging project CANCAN

On the use of QoS requirements as base of multicast charging

We propose a charging scheme for cost distribution along a multicast tree when cost is the responsibility of the receivers. This scheme focuses on QoS considerations and it does not depend on any specific type of service. The scheme has been designed to be used as a bridge between unicast and multicast services, solving the problem of charging multicast services by means of unicast charging and existing QoS routing mechanisms. We also include a numerical comparison and discussions of the case of non-numerical or relative QoS and on the application to some service examples in order to give a better understanding of the proposal

Enhancing fault management performance of two-step QoS routing algorithms in GMPLS networks

In this paper a novel methodology aimed at minimizing the probability of network failure and the failure impact (in terms of QoS degradation) while optimizing the resource consumption is introduced. A detailed study of MPLS recovery techniques and their GMPLS extensions are also presented. In this scenario, some features for reducing the failure impact and offering minimum failure probabilities at the same time are also analyzed. Novel two-step routing algorithms using this methodology are proposed. Results show that these methods offer high protection levels with optimal resource consumption

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

QoS online routing and MPLS multilevel protection: a survey

A survey of MPLS protection methods and their utilization in combination with online routing methods is presented in this article. Usually, fault management methods pre-establish backup paths to recover traffic after a failure. In addition, MPLS allows the creation of different backup types, and hence MPLS is a suitable method to support traffic-engineered networks. In this article, an introduction of several label switch path backup types and their pros and cons are pointed out. The creation of an LSP involves a routing phase, which should include QoS aspects. In a similar way, to achieve a reliable network the LSP backups must also be routed by a QoS routing method. When LSP creation requests arrive one by one (a dynamic network scenario), online routing methods are applied. The relationship between MPLS fault management and QoS online routing methods is unavoidable, in particular during the creation of LSP backups. Both aspects are discussed in this article. Several ideas on how these actual technologies could be applied together are presented and compared

Adding QoS protection in order to enhance MPLS QoS routing

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed

Buffer Capacity Allocation: A method to QoS support on MPLS networks

This paper describes an optimized model to support QoS by mean of Congestion minimization on LSPs (Label Switching Path). In order to perform this model, we start from a CFA (Capacity and Flow Allocation) model. As this model does not consider the buffer size to calculate the capacity cost, our model- named BCA (Buffer Capacity Allocation)- take into account this issue and it improve the CFA performance. To test our proposal, we perform several simulations; results show that BCA model minimizes LSP congestion and uniformly distributes flows on the network

Organització nuclear dels gens que codifiquen per a les proteïnes làcties en cèlules epitelials mamàries en diferents estadis de desenvolupament

Estudi realitzat a partir d’una estada al Institut National de la Recherche Agronomique (INRA), a França, entre 2006 i 2008. En el ultims anys, estudis realitzats en diferents tipus cel•lulars han pogut determinar l’importància de l’organització nuclear en el control i regulació gènica. S’han realizat diferents experiments per tal de determinar si la posició dels gens de les proteïnes làcties en el nucli interfàsic de cel•lules epitelials mamaries és important per regular la seva expressió. Els gens de les proteïnes de la llet s’expressen a la glàndula mamaria durant la lactació en resposta a les hormones lactogèniques (majoritàriament prolactina i glucocorticoids). Mitjançant la tècnica de FISH (fluorescent in situ hibridization) en 3D s’ha caracteritzat la localització nuclear del gens WAP (whey acidic protein) i les caseïnes en cèl•lules epitelials mamaries de ratolí (HC11) cultivades en l’absència i presencia d’hormones lactogèniques. En absència d’hormones, els dos gens estan distribuïts dins del nucli de forma no aleatòria, el gen WAP es troba localitzat en l’interior del nucli, mentre que les caseïnes es troben localitzades prop de la perifèria nuclear. L’estimulació hormonal indueix un canvi significatiu en la distància dels dos gens a la perifèria nuclear. Així mateix, la posició del locus de la caseïna en relació al seu territori cromosòmic (CT) 5 està correlacionada amb la inducció hormonal i per tant amb la seva activació transcripcional, mentre que la posició del gen WAP amb relació al seu CT11 sembla més determinada pel context cromosòmic del gen. Per últim, no s’han trobat diferencies en la localització dels gens en relació a l'heterocromatina del centròmer, descrit com a compartiment repressiu, entre les cèl•lules estimulades amb hormones i les que no. En els dos casos s’ha trobat un gran percentatge de gens que no estan associats als centròmers.

Acceso a la Biblioteca de la UOC por medio de la telefonía móvil

La Universitat Oberta de Catalunya, va començar al febrer del 2000, a oferir part dels continguts del Campus Virtual per mitjà del WAP de primera generació.

M-Library in an m-University : changing Models in the Open University of Catalonia

The general perspective of M-technologies and M-Services at the Spanish universities is not still in a very high level when we are ending the first decade of the 21st century. Some Universities and some of their libraries are starting to try out with M-technologies, but are still far from a model of massive exploitation, less than in some other countries. A deep study is needed to know the main reasons, study that we will not do in this paper. This general perspective does not mean that there are no significant initiatives which start to trust in M-technologies from Universities and their libraries. Models based in M-technologies make more sense than ever in open universities and in open libraries. That's the reason why the UOC's Library began in late 90s its first experiences in the M-Technologies and M-Libraries developments. In 1999 the appropriate technology offered the opportunity to carry out the first pilot test with SMS, and then applying the WAP technology. At those moments we managed to link-up mobile phones to the OPAC through a WAP system that allowed searching the catalogue by categories and finding the final location of a document, offering also the address of the library in which the user could loan it. Since then, UOC (and its library) directs its efforts towards adapting the offer of services to all sorts of M-devices used by end users. Left the WAP technology, nowadays the library is experimenting with some new devices like e-books, and some new services to get more feedback through the OPAC and metalibrary search products. We propose the case of Open University of Catalonia, in two levels: M-services applied in the library and M-technologies applied in some other university services and resources.

Evaluating the probability and the impact of a failure in GMPLS based networks

In this paper, we define a new scheme to develop and evaluate protection strategies for building reliable GMPLS networks. This is based on what we have called the network protection degree (NPD). The NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability, and an a posteriori evaluation, the failure impact degree (FID), which determines the impact on the network in case of failure, in terms of packet loss and recovery time. Having mathematical formulated these components, experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms in order to offer a certain degree of protection

Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

Resource dimensioning aspect of heterogeneous traffic with different service requirements: Integration versus segregation

In this paper, we consider the ATM networks in which the virtual path concept is implemented. The question of how to multiplex two or more diverse traffic classes while providing different quality of service requirements is a very complicated open problem. Two distinct options are available: integration and segregation. In an integration approach all the traffic from different connections are multiplexed onto one VP. This implies that the most restrictive QOS requirements must be applied to all services. Therefore, link utilization will be decreased because unnecessarily stringent QOS is provided to all connections. With the segregation approach the problem can be much simplified if different types of traffic are separated by assigning a VP with dedicated resources (buffers and links). Therefore, resources may not be efficiently utilized because no sharing of bandwidth can take place across the VP. The probability that the bandwidth required by the accepted connections exceeds the capacity of the link is evaluated with the probability of congestion (PC). Since the PC can be expressed as the CLP, we shall simply carry out bandwidth allocation using the PC. We first focus on the influence of some parameters (CLP, bit rate and burstiness) on the capacity required by a VP supporting a single traffic class using the new convolution approach. Numerical results are presented both to compare the required capacity and to observe which conditions under each approach are preferred