Multicast Services for Multimedia Collaborative Applications

This work aims at providing multicast services for multimedia collaborative applications over large inter-networks such as the Internet. Multimedia collaborative applications are typically of small group size, slow group membership dynamics, and awareness of participants\u27 identities and locations. Moreover, they usually consist of several components such as audio, video, shared whiteboard, and single user application sharing engines that collectively help make the collaboration session successful. Each of these components has its demands from the communication layer that may differ from one component to another. This dissertation identifies the overall characteristics of multimedia collaborative applications and their individual components. It also determines the service requirements of the various components from the communication layer. Based on the analysis done in the thesis, new techniques of multicast services that are more suitable for multimedia collaborative applications are introduced. In particular, the focus will be on multicast address management and connection control, routing, congestion and flow control, and error control. First, we investigate multicast address management and connection control and provide a new technique for address management based on address space partitioning. Second, we study the problem of multicast routing and introduce a new approach that fits the real time nature of multimedia applications. Third, we explore the problem of congestion and flow control and introduce a new mechanism that takes into consideration the heterogeneity within the network and within the processing capabilities of the end systems. Last, we exploit the problem of error control and present a solution that supports various levels of error control to the different components within the collaboration session. We present analytic as well as simulation studies to evaluate our work, which show that our techniques outperform previous ones

Network overload avoidance by traffic engineering and content caching

The Internet traffic volume continues to grow at a great rate, now driven by video and TV distribution. For network operators it is important to avoid congestion in the network, and to meet service level agreements with their customers. This thesis presents work on two methods operators can use to reduce links loads in their networks: traffic engineering and content caching. This thesis studies access patterns for TV and video and the potential for caching. The investigation is done both using simulation and by analysis of logs from a large TV-on-Demand system over four months. The results show that there is a small set of programs that account for a large fraction of the requests and that a comparatively small local cache can be used to significantly reduce the peak link loads during prime time. The investigation also demonstrates how the popularity of programs changes over time and shows that the access pattern in a TV-on-Demand system very much depends on the content type. For traffic engineering the objective is to avoid congestion in the network and to make better use of available resources by adapting the routing to the current traffic situation. The main challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands. This thesis proposes L-balanced routings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level L. L-balanced routing gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic. We present an L-balanced routing algorithm and a heuristic search method for finding L-balanced weight settings for the legacy routing protocols OSPF and IS-IS. We show that the search and the resulting weight settings work well in real network scenarios

Multicast communication support over satellite networks

In this dissertation, we focus on providing multicast communication support over satellite networks. We investigate the possible performance enhancements in terms of the throughput, capacity, and scalability of a Ka-band, multiple spot-beam satellite communication system that supports unicast and multicast services. The role satellite systems play in today's communication infrastructure is changing rapidly, fueled by the technological advance in the design of new satellite systems, and by the new multimedia service applications, such as on-demand multimedia content delivery, distance learning, and distributed software updates that would benefit from the wide-area coverage, direct and ubiquitous access capability of the satellite systems. These applications require concurrent transmission of the same content to multiple users. In order for multicasting-based services to grow over satellite networks, there must be an incentive to deploy them. We address the problem of user heterogeneity that occurs when multicast users that are located across several different spot-beam locations experience different channel conditions. We propose a novel power allocation scheme for smoothing out the heterogeneity experienced by the multicast groups, while making sure that unicast users get a fair share of system resources as well. Our power allocation scheme would benefit from user feedback in determining the channel conditions. However, collecting feedback from a large set of users is a challenging task in satellite systems, since access to the uplink bandwidth is to be shared between several users, and the resources are usually limited. We introduce a novel algorithm that reduces the volume of feedback information that is to be transmitted over the satellite segment of the network, while maintaining that the relevant information is collected in a timely manner. Finally, we focus our attention to the potential benefits of integrating packet level forward error correction coding to packet delivery for reliable multicast services over satellite networks. Forward error protection helps recover corrupted data, and minimizes the need for retransmissions over the satellite channel. We investigate the use of a special form of forward error correcting (FEC) code and couple it with an adaptive control mechanism to dynamically adjust the number of encoding packets forwarded to the users

무선 네트워크에서의 TCP 성능 향상 기법

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 8. 박세웅.TCP (Transmission Control Protocol), one of the most essential protocol for the Internet, has carried the most of the Internet traffic since its birth. With the deployment of various types of wireless networks and proliferation of smart devices, a rapid increase in mobile data traffic volume has been observed and TCP has still carried the majority of mobile traffic, thus leading to huge attention again on TCP performance in wireless networks. In this dissertation, we tackle three different problems that aim to improve TCP performance in wireless networks. Firstly, we dealt with the downstream bufferbloat problem in wireless access networks such as LTE and Wi-Fi. We clarify the downstream bufferbloat problem in resource competitive environments such as Wi-Fi, and design a receiver-side countermeasure for easy deployment that does not require any modification at the sender or intermediate routers. Exploiting TCP and AQM dynamics, our scheme competes for shared resource in a fair manner with conventional TCP flow control methods and prevents bufferbloat. We implement our scheme in commercial smart devices and verify its performance through real experiments in LTE and Wi-Fi networks. Secondly, we consider the upstream bufferbloat problem in LTE networks. We clarify that the upstream bufferbloat problem can significantly degrade multitasking users QoE in LTE networks and design a packet scheduler that aims to separate delay-sensitive packets from non delay-sensitive packets without computational overhead. We implement the proposed packet scheduler in commercial smart devices and evaluate the performance of our proposed scheme through real experiments in LTE networks. Lastly, we investigate the TCP fairness problem in low-power and lossy networks (LLNs). We confirm severe throughput unfairness among nodes with different hop counts and propose dynamic TX period adjustment scheme to enhance TCP fairness in LLNs. Through experiments on the testbed, we evaluate how much the proposed scheme enhances fairness index.1 Introduction 1 1.1 Motivation 1 1.2 Background and Related Work 3 1.3 Outline 7 2 Receiver-side TCP Countermeasure to Bufferbloat in Wireless Access Networks 8 2.1 Introduction 8 2.2 Dynamics of TCP and AQM 11 2.3 Receiver-side TCP Adaptive Queue Control 14 2.3.1 Receiver-side Window Control 15 2.3.2 Delay Measurement and Queue Length Estimation 17 2.3.3 Configuration of RTAC 19 2.4 Experimental Setup and Configuration 20 2.4.1 Receiver Measurement Errors and Configuration 21 2.5 Experimental Results 27 2.5.1 Bufferbloat in Wireless Access Networks 27 2.5.2 Prevention of Bufferbloat 31 2.5.3 Fairness of TCP Flows with Various Receiver Types 32 2.5.4 The Impact of TCP Variants 39 2.5.5 The Impact of Upload Bufferbloat 46 2.5.6 Coexistence with the Unlimited Sender 48 2.6 Summary 48 3 Dual Queue Approach for Improving User QoE in LTE Networks 51 3.1 Introduction 51 3.2 User QoE Degradation in Multitasking Scenarios 54 3.2.1 Unnecessary Large Upload Queueing delay 54 3.2.2 Negative Impact on Performance in Multitasking Scenarios 55 3.3 SOR based Packet Classification with Multiple Transmit Queue 58 3.3.1 Dual Transmit Queue 59 3.3.2 SOR based Packet Classification Algorithm 61 3.4 Experiment Results 63 3.4.1 Packet Classification Metric: Sendbuffer Occupancy Ratio (SOR) 64 3.4.2 Improving RTT performance of Interactive Applications 68 3.4.3 Improving Download Performance 69 3.4.4 Fairness among Competing Upload Flows 71 3.5 Summary 74 4 Uplink Congestion Control in Low-power and Lossy Networks 75 4.1 Introduction 75 4.2 System Model 78 4.3 Proposed Scheme 79 4.3.1 Tx Period 79 4.3.2 Dynamic TX Period Adjustment 80 4.4 Experimental Results 82 4.4.1 Experimental Setup 82 4.4.2 Throughput analysis vs. Measurement 84 4.4.3 TCP Performance in Low-power Lossy Networks 87 4.4.4 Fairness improvement of DTPA 89 4.5 Summary 92 5 Conclusion 93 5.1 Research Contributions 93 5.2 Future Research Directions 95Docto

Scalable approaches for DiffServ multicasting

Over the last several years, there has been an explosion in the introduction of new Internet technologies. Whereas the Internet in its original form was a medium primarily for academia and research interests, the Internet has been redefined as business and consumer interests have dominated the focal points of Internet technology. The dominant question facing the Internet today is, how can the network meet the needs of the users and their applications while trying to keep such implementations scalable to the billions of users present on the Internet? Two of the emerging technologies for answering the question are Differentiated Services (DiffServ) and multicasting. Although the two technologies share complementary goals, the integration of the two technologies is a non-trivial issue due to three fundamental conflicts. The three fundamental conflicts are the scalability of per-group state information, sender versus receiver-driven QoS, and resource management. The issues surrounding how to solve these conflicts provide the basis for this dissertation.;In this dissertation, two architectures (DiffServ Multicasting (DSMCast) and Edge-Based Multicasting (EBM)) are proposed to satisfy the requirements for scalable DiffServ multicasting architectures. In addition to the two architectures, this dissertation also presents the first in-depth study regarding single tree support for heterogeneous QoS multicasting. Furthermore, the dissertation proposes a novel application of DSMCast for fault tolerance and management of the DiffServ network. Finally, the dissertation comments on future applications of the architectures and proposes several areas for future research

A multi-objective particle swarm optimized fuzzy logic congestion detection and dual explicit notification mechanism for IP networks.

Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, 2006.The Internet has experienced a tremendous growth over the past two decades and with that growth have come severe congestion problems. Research efforts to alleviate the congestion problem can broadly be classified into three groups: Cl) Router based congestion detection; (2) Generation and transmission of congestion notification signal to the traffic sources; (3) End-to-end algorithms which control the flow of traffic between the end hosts. This dissertation has largely addressed the first two groups which are basically router initiated. Router based congestion detection mechanisms, commonly known as Active Queue Management (AQM), can be classified into two groups: conventional mathematical analytical techniques and fuzzy logic based techniques. Research has shown that fuzzy logic techniques are more effective and robust compared to the conventional techniques because they do not rely on the availability of a precise mathematical model of Internet. They use linguistic knowledge and are, therefore, better placed to handle the complexities associated with the non-linearity and dynamics of the Internet. In spite of all these developments, there still exists ample room for improvement because, practically, there has been a slow deployment of AQM mechanisms. In the first part of this dissertation, we study the major AQM schemes in both the conventional and the fuzzy logic domain in order to uncover the problems that have hampered their deployment in practical implementations. Based on the findings from this study, we model the Internet congestion problem as a multi-objective problem. We propose a Fuzzy Logic Congestion Detection (FLCD) which synergistically combines the good characteristics of the fuzzy approaches with those of the conventional approaches. We design the membership functions (MFs) of the FLCD algorithm automatically by using Multi-objective Particle Swarm Optimization (MOPSO), a population based stochastic optimization algorithm. This enables the FLCD algorithm to achieve optimal performance on all the major objectives of Internet congestion control. The FLCD algorithm is compared with the basic Fuzzy Logic AQM and the Random Explicit Marking (REM) algorithms on a best effort network. Simulation results show that the FLCD algorithm provides high link utilization whilst maintaining lower jitter and packet loss. It also exhibits higher fairness and stability compared to its basic variant and REM. We extend this concept to Proportional Differentiated Services network environment where the FLCD algorithm outperforms the traditional Weighted RED algorithm. We also propose self learning and organization structures which enable the FLCD algorithm to achieve a more stable queue, lower packet losses and UDP traffic delay in dynamic traffic environments on both wired and wireless networks. In the second part of this dissertation, we present the congestion notification mechanisms which have been proposed for wired and satellite networks. We propose an FLCD based dual explicit congestion notification algorithm which combines the merits of the Explicit Congestion Notification (ECN) and the Backward Explicit Congestion Notification (BECN) mechanisms. In this proposal, the ECN mechanism is invoked based on the packet marking probability while the BECN mechanism is invoked based on the BECN parameter which helps to ensure that BECN is invoked only when congestion is severe. Motivated by the fact that TCP reacts to tbe congestion notification signal only once during a round trip time (RTT), we propose an RTT based BECN decay function. This reduces the invocation of the BECN mechanism and resultantly the generation of reverse traffic during an RTT. Compared to the traditional explicit notification mechanisms, simulation results show that the new approach exhibits lower packet loss rates and higher queue stability on wired networks. It also exhibits lower packet loss rates, higher good-put and link utilization on satellite networks. We also observe that the BECN decay function reduces reverse traffic significantly on both wired and satellite networks while ensuring that performance remains virtually the same as in the algorithm without BECN traffic reduction.Print copy complete; page numbering of 105-108 incorrect

QoS-aware Mobility Management in IP-based Communication Networks

Der allgegenwärtige Zugang zu Informationen, jederzeit und überall, ist ein wichtiges Merkmal künftiger All-IP-Mobilfunktnetze, die verschiedene Systeme miteinander verbinden, dabei dynamischer und flexibler sein werden. Der Einsatz dieser Netze erfordert es jedoch, viele Herausforderungen zu überwinden. Eine der wichtigsten im Rahmen dieser Arbeit, ist die Frage, wie Quality of Service (QoS) Eigenschaften in solchen hoch dynamischen, mobilen Umgebungen zu garantieren sind. Bekanntermaßen beeinflusst die Mobilität von Mobilknoten (MN) die Dienstgüte in mobilen Netzen, da QoS-Parameters für die Ende-zu-Ende-Kommunikation vereinbart werden. Daher müssen Lösungen entwickelt werden, die nahtlose Mobilität, bei gleichzeitigen QoS-Garantien nach Handoffs, unterstützen. Diese Herausforderung ist das Hauptziel der vorliegenden Dissertation, die einen umfassenden Überblick über die bestehenden Mobilitäts- und QoS-Managment-Lösungen in IP-basierten Netzen liefert, gefolgt von einem Einblick in Methoden zur Kopplung von Mobilitätsmanagement und QoS-Lösungen. Nach Betrachtung der Vor- und Nachteile bestehender Ansätze, kommt die Dissertation zu dem Schluss, dass hybride Strategien vielversprechend sind und zu praktikablen Lösungen weiterentwickelt werden können, die sowohl Mobilitäts- als auch QoS-Anforderungen auf effiziente Weise,in allen zukünftigen IP-Mobilfunknetzen erfüllen können. Auf dieser Grundlage schlägt die Dissertation ein neues Hybrid-Protokoll, genannt "QoS-aware Mobile IP Fast Authentication Protocol" (QoMIFA), vor. Unser Vorschlag integriert MIFA als Mobilitäts-Management-Protokoll mit RSVP als QoS Reservierungsprotokoll. MI-FA wird aufgrund seiner Fähigkeit zu schnellen, sicheren und robusten Handoffs gewählt. RSVP hingegen dient als Standardlösung zur Bereitstellung von QoS in bestehenden IP-basierten Netzen. Unter Einhaltung der Hybrid-Architektur wird RSVP um ein neues Objekt, genannt "Mobility Object" erweitert, welches MIFA-Kontrollnachrichten kapselt. Nach der Spezifikation des neuen Vorschlags, bewertet die Dissertation auch seine Leistung im Vergleich zu dem bekannten "Simple QoS Signaling Protocol" (Simple QoS), mittels Simulationsstudien, modelliert mit dem "Network Simluator 2" (NS2). In der Auswertung werden der Einflusses der Netzwerklast und der Geschwindigkeit des Mobilknotens untersucht. Die hierzu verwendeten Leistungsparameter umfassen die Ressourcen-Reservierungs-Latenz, die Anzahl verlorener Pakete pro Handoff, die Anzahl der, vor Abschluss der Reservierung, mit Best-Effort-Eigenschaften übertragenen Pakete pro Handoff und die Wahrscheinlichkeit von Verbindungsabbrüchen. Unsere mittels Simulation erzielten Ergebnisse zeigen, dass QoMIFA schnelle und nahtlose Handoffs mit schneller Ressourcenreservierung nach Handoffs kombinieren kann. Unter Berücksichtigung des Einflusses der Netzwerklast, ist nachweisbar, dass QoMIFA eine besser Leistung als Simple QoS in allen untersuchten Szenarien mit geringer, mittlerer und hoher Last erreicht. Bei Betrachtung des Einflusses der Bewegungsgeschwindigkeit des Mobilknotens auf die Leistung, lassen sich unter beiden Protokollen Ping-Pong-Effekte beobachten, welche zu höheren Ressourcen-Reservierungs-Latenzen, mehr verlorenen Paketen und mehr Best-Effort-Paketen pro Handoff bei geringeren Geschwindigkeiten führen. Der stärkste Einfluss dieser Pinp-Pong-Effekte ist jeweils bei 3 km/h zu beobachten. Allerdings verhält sich QoMIFA unter allen untersuchten Bewegungsgeschwindigkeiten besser als Simple QoS und kann Mobilknoten auch bei hohen Geschwindigkeiten bedienen. In Anschluss an die simulationsgestützte Evaluierung, schätzt die Dissertation die Signalisierungskosten beider Protokolle unter Betrachtung der Kosten für Ortslokalise-rung und Paketzustellung. Im Ergebnis erreicht QoMIFA die zuvor genannten Leistungsverbesserungen auf Kosten von größeren Ortslokalisierungskosten und leicht höherer Paketzustellungskosten.Ubiquitous access to information anywhere, anytime and anyhow is an important feature of future all-IP mobile communication networks, which will interconnect various systems and be more dynamic and flexible. The deployment of these networks, however, requires overcoming many challenges. One of the main challenges of interest for this work is how to provide Qual-ity of Service (QoS) guarantees in such highly dynamic mobile environments.As known, mobility of Mobile Nodes (MNs) affects the QoS in mobile networks since QoS parameters are made for end-to-end communications. Therefore, it is a challenge to develop new solutions capable of supporting seamless mobility while simultaneously providing QoS guarantees after handoffs. Addressing this challenge is the main objective of this dissertation, which provides a comprehensive overview of mobility management solutions and QoS mech-anisms in IP-based networks followed by an insight into how mobility management and QoS solutions can be coupled with each other. Following the highlight of the state of art along with the pros and cons of existing approaches, the dissertation concludes that hybrid strategies are promising and can be further developed to achieve solutions that are capable of simultaneous-ly supporting mobility and QoS, simple from the implementation point of view, efficient and applicable to future all-IP mobile communication networks.Based on this, the dissertation proposes a new hybrid proposal named QoS-aware Mobile IP Fast Authentication Protocol (QoMIFA). Our proposal integrates MIFA as a mobility man-agement protocol with RSVP as a QoS reservation protocol. MIFA is selected due to its capa-bility of the provision of fast, secure and robust handoffs, while RSVP is chosen because it presents the standard solution used to support QoS in existing IP-based networks. The hybrid architecture is retained by introducing a new object, called “mobility object”, to RSVP in or-der to encapsulate MIFA control messages.Following the specification of the new proposal, the dissertation also evaluates its perfor-mance compared to the well-known Simple QoS signaling protocol (Simple QoS) by means of simulation studies modeled using the Network Simulator 2 (NS2). The evaluation compris-es the investigation of the impact of network load and MN speed. The performance measures we are interested in studying comprise the resource reservation latency, number of dropped packets per handoff, number of packets sent as best-effort per handoff until the reservation is accomplished and probability of dropping sessions. Our simulation results show that QoMIFA is capable of achieving fast and smooth handoffs in addition to its capability of quickly re-serving resources after handoffs. Considering the impact of network load, QoMIFA outper-forms Simple QoS in all studied scenarios (low- , middle- and high-loaded scenarios). With respect to the impact of MN speed, it can be observed that the impact of ping-pong effects is seen with both protocols and results in higher resource reservation latency, more dropped packets per handoff and more best-effort packets per handoff at low speeds than at higher ones. The worst impact of ping-pong effects is seen at a speed of 3 km/h when employing QoMIFA and Simple QoS, respectively. However, QoMIFA remains performing significantly better than Simple QoS under all studied MN speeds and can even properly serve MNs mov-ing at high speeds.Following the simulative evaluation, the dissertation estimates the signaling cost of both stud-ied protocols with respect to the location update and packet delivery cost. Our results show that QoMIFA achieves the above mentioned performance improvements at the cost of greater location update cost and slightly higher packet delivery cost than Simple QoS

Esquema de controlo para redes multicast baseadas com classes

Doutoramento em Engenharia ElectrotécnicaThe expectations of citizens from the Information Technologies (ITs) are increasing as the ITs have become integral part of our society, serving all kinds of activities whether professional, leisure, safety-critical applications or business. Hence, the limitations of the traditional network designs to provide innovative and enhanced services and applications motivated a consensus to integrate all services over packet switching infrastructures, using the Internet Protocol, so as to leverage flexible control and economical benefits in the Next Generation Networks (NGNs). However, the Internet is not capable of treating services differently while each service has its own requirements (e.g., Quality of Service - QoS). Therefore, the need for more evolved forms of communications has driven to radical changes of architectural and layering designs which demand appropriate solutions for service admission and network resources control. This Thesis addresses QoS and network control issues, aiming to improve overall control performance in current and future networks which classify services into classes. The Thesis is divided into three parts. In the first part, we propose two resource over-reservation algorithms, a Class-based bandwidth Over-Reservation (COR) and an Enhanced COR (ECOR). The over-reservation means reserving more bandwidth than a Class of Service (CoS) needs, so the QoS reservation signalling rate is reduced. COR and ECOR allow for dynamically defining over-reservation parameters for CoSs based on network interfaces resource conditions; they aim to reduce QoS signalling and related overhead without incurring CoS starvation or waste of bandwidth. ECOR differs from COR by allowing for optimizing control overhead minimization. Further, we propose a centralized control mechanism called Advanced Centralization Architecture (ACA), that uses a single state-full Control Decision Point (CDP) which maintains a good view of its underlying network topology and the related links resource statistics on real-time basis to control the overall network. It is very important to mention that, in this Thesis, we use multicast trees as the basis for session transport, not only for group communication purposes, but mainly to pin packets of a session mapped to a tree to follow the desired tree. Our simulation results prove a drastic reduction of QoS control signalling and the related overhead without QoS violation or waste of resources. Besides, we provide a generic-purpose analytical model to assess the impact of various parameters (e.g., link capacity, session dynamics, etc.) that generally challenge resource overprovisioning control. In the second part of this Thesis, we propose a decentralization control mechanism called Advanced Class-based resource OverpRovisioning (ACOR), that aims to achieve better scalability than the ACA approach. ACOR enables multiple CDPs, distributed at network edge, to cooperate and exchange appropriate control data (e.g., trees and bandwidth usage information) such that each CDP is able to maintain a good knowledge of the network topology and the related links resource statistics on real-time basis. From scalability perspective, ACOR cooperation is selective, meaning that control information is exchanged dynamically among only the CDPs which are concerned (correlated). Moreover, the synchronization is carried out through our proposed concept of Virtual Over-Provisioned Resource (VOPR), which is a share of over-reservations of each interface to each tree that uses the interface. Thus, each CDP can process several session requests over a tree without requiring synchronization between the correlated CDPs as long as the VOPR of the tree is not exhausted. Analytical and simulation results demonstrate that aggregate over-reservation control in decentralized scenarios keep low signalling without QoS violations or waste of resources. We also introduced a control signalling protocol called ACOR Protocol (ACOR-P) to support the centralization and decentralization designs in this Thesis. Further, we propose an Extended ACOR (E-ACOR) which aggregates the VOPR of all trees that originate at the same CDP, and more session requests can be processed without synchronization when compared with ACOR. In addition, E-ACOR introduces a mechanism to efficiently track network congestion information to prevent unnecessary synchronization during congestion time when VOPRs would exhaust upon every session request. The performance evaluation through analytical and simulation results proves the superiority of E-ACOR in minimizing overall control signalling overhead while keeping all advantages of ACOR, that is, without incurring QoS violations or waste of resources. The last part of this Thesis includes the Survivable ACOR (SACOR) proposal to support stable operations of the QoS and network control mechanisms in case of failures and recoveries (e.g., of links and nodes). The performance results show flexible survivability characterized by fast convergence time and differentiation of traffic re-routing under efficient resource utilization i.e. without wasting bandwidth. In summary, the QoS and architectural control mechanisms proposed in this Thesis provide efficient and scalable support for network control key sub-systems (e.g., QoS and resource control, traffic engineering, multicasting, etc.), and thus allow for optimizing network overall control performance.À medida que as Tecnologias de Informação (TIs) se tornaram parte integrante da nossa sociedade, a expectativa dos cidadãos relativamente ao uso desses serviços também demonstrou um aumento, seja no âmbito das atividades profissionais, de lazer, aplicações de segurança crítica ou negócios. Portanto, as limitações dos projetos de rede tradicionais quanto ao fornecimento de serviços inovadores e aplicações avançadas motivaram um consenso quanto à integração de todos os serviços e infra-estruturas de comutação de pacotes, utilizando o IP, de modo a extrair benefícios económicos e um controlo mais flexível nas Redes de Nova Geração (RNG). Entretanto, tendo em vista que a Internet não apresenta capacidade de diferenciação de serviços, e sabendo que cada serviço apresenta as suas necessidades próprias, como por exemplo, a Qualidade de Serviço - QoS, a necessidade de formas mais evoluídas de comunicação tem-se tornado cada vez mais visível, levando a mudanças radicais na arquitectura das redes, que exigem soluções adequadas para a admissão de serviços e controlo de recursos de rede. Sendo assim, este trabalho aborda questões de controlo de QoS e rede com o objetivo de melhorar o desempenho do controlo de recursos total em redes atuais e futuras, através da análise dos serviços de acordo com as suas classes de serviço. Esta Tese encontra-se dividida em três partes. Na primeira parte são propostos dois algoritmos de sobre-reserva, o Class-based bandwidth Over-Reservation (COR) e uma extensão melhorada do COR denominado de Enhanced COR (ECOR). A sobre-reserva significa a reserva de uma largura de banda maior para o serviço em questão do que uma classe de serviço (CoS) necessita e, portanto, a quantidade de sinalização para reserva de recursos é reduzida. COR e ECOR consideram uma definição dinâmica de sobre-reserva de parâmetros para CoSs com base nas condições da rede, com vista à redução da sobrecarga de sinalização em QoS sem que ocorra desperdício de largura de banda. O ECOR, por sua vez, difere do COR por permitir a otimização com minimização de controlo de overhead. Além disso, nesta Tese é proposto também um mecanismo de controlo centralizado chamado Advanced Centralization Architecture (ACA) , usando um único Ponto de Controlo de Decisão (CDP) que mantém uma visão ampla da topologia de rede e de análise dos recursos ocupados em tempo real como base de controlo para a rede global. Nesta Tese são utilizadas árvores multicast como base para o transporte de sessão, não só para fins de comunicação em grupo, mas principalmente para que os pacotes que pertençam a uma sessão que é mapeada numa determinada árvore sigam o seu caminho. Os resultados obtidos nas simulações dos mecanismos mostram uma redução significativa da sobrecarga da sinalização de controlo, sem a violação dos requisitos de QoS ou desperdício de recursos. Além disso, foi proposto um modelo analítico no sentido de avaliar o impacto provocado por diversos parâmetros (como por exemplo, a capacidade da ligação, a dinâmica das sessões, etc), no sobre-provisionamento dos recursos. Na segunda parte desta tese propôe-se um mecanismo para controlo descentralizado de recursos denominado de Advanced Class-based resource OverprRovisioning (ACOR), que permite obter uma melhor escalabilidade do que o obtido pelo ACA. O ACOR permite que os pontos de decisão e controlo da rede, os CDPs, sejam distribuídos na periferia da rede, cooperem entre si, através da troca de dados e controlo adequados (por exemplo, localização das árvores e informações sobre o uso da largura de banda), de tal forma que cada CDP seja capaz de manter um bom conhecimento da topologia da rede, bem como das suas ligações. Do ponto de vista de escalabilidade, a cooperação do ACOR é seletiva, o que significa que as informações de controlo são trocadas de forma dinâmica apenas entre os CDPs analisados. Além disso, a sincronização é feita através do conceito proposto de Recursos Virtuais Sobre-Provisionado (VOPR), que partilha as reservas de cada interface para cada árvore que usa a interface. Assim, cada CDP pode processar pedidos de sessão numa ou mais árvores, sem a necessidade de sincronização entre os CDPs correlacionados, enquanto o VOPR da árvore não estiver esgotado. Os resultados analíticos e de simulação demonstram que o controlo de sobre-reserva é agregado em cenários descentralizados, mantendo a sinalização de QoS baixa sem perda de largura de banda. Também é desenvolvido um protocolo de controlo de sinalização chamado ACOR Protocol (ACOR-P) para suportar as arquitecturas de centralização e descentralização deste trabalho. O ACOR Estendido (E-ACOR) agrega a VOPR de todas as árvores que se originam no mesmo CDP, e mais pedidos de sessão podem ser processados sem a necessidade de sincronização quando comparado com ACOR. Além disso, E-ACOR introduz um mecanismo para controlar as informações àcerca do congestionamento da rede, e impede a sincronização desnecessária durante o tempo de congestionamento quando os VOPRs esgotam consoante cada pedido de sessão. A avaliação de desempenho, através de resultados analíticos e de simulação, mostra a superioridade do E-ACOR em minimizar o controlo geral da carga da sinalização, mantendo todas as vantagens do ACOR, sem apresentar violações de QoS ou desperdício de recursos. A última parte desta Tese inclui a proposta para recuperação a falhas, o Survivability ACOR (SACOR), o qual permite ter QoS estável em caso de falhas de ligações e nós. Os resultados de desempenho analisados mostram uma capacidade flexível de sobrevivência caracterizada por um tempo de convergência rápido e diferenciação de tráfego com uma utilização eficiente dos recursos. Em resumo, os mecanismos de controlo de recursos propostos nesta Tese fornecem um suporte eficiente e escalável para controlo da rede, como também para os seus principais sub-sistemas (por exemplo, QoS, controlo de recursos, engenharia de tráfego, multicast, etc) e, assim, permitir a otimização do desempenho da rede a nível do controlo global

Engineering Automation for Reliable Software Interim Progress Report (10/01/2000 - 09/30/2001)

Prepared for: U.S. Army Research Office P.O. Box 12211 Research Triangle Park, NC 27709-2211The objective of our effort is to develop a scientific basis for producing reliable software that is also flexible and cost effective for the DoD distributed software domain. This objective addresses the long term goals of increasing the quality of service provided by complex systems while reducing development risks, costs, and time. Our work focuses on "wrap and glue" technology based on a domain specific distributed prototype model. The key to making the proposed approach reliable, flexible, and cost-effective is the automatic generation of glue and wrappers based on a designer's specification. The "wrap and glue" approach allows system designers to concentrate on the difficult interoperability problems and defines solutions in terms of deeper and more difficult interoperability issues, while freeing designers from implementation details. Specific research areas for the proposed effort include technology enabling rapid prototyping, inference for design checking, automatic program generation, distributed real-time scheduling, wrapper and glue technology, and reliability assessment and improvement. The proposed technology will be integrated with past research results to enable a quantum leap forward in the state of the art for rapid prototyping.U. S. Army Research Office P.O. Box 12211 Research Triangle Park, NC 27709-22110473-MA-SPApproved for public release; distribution is unlimited