15 research outputs found
A new path probing strategy for inter-domain multicast routing
Many already in use applications require the provision of QoS services from the underlying network infra-structure. This is particularly true for multicast, since it involves many participants at very sparse locations usually aiming to receive or send multimedia real-time streams. One way to provide QoS is through routing, since QoS aware multicast routing protocols can find feasible multicast trees.
At large scale, scalability issues make the QoS multicast routing task a lot more difficult, since it is not possible to have a complete
knowledge of the network topology and its path QoS metrics in a clear up-to-date way. The most promising proposals are therefore based on path probing strategies that evaluate a subset of the available connecting paths.
Assuming that each member can express its requirements as a combination of QoS metrics like available bandwidth, end-to-end loss probability and delay, it is up to QoS routing multicast protocols to build distribution trees connecting members through paths that can satisfy those requirements.
In this paper an inter-domain QoS multicast routing protocol is presented, specifically designed for the hierarchical inter-domain scenario, where requirements like intra-domain independency and policy awareness should be met. Emphasis is given to the path probing mechanism used to connect new members to the multicast tree, stressing how it differs from others.
Simulation results show that despite using a less aggressive and simplified probing mechanism - more suitable for inter-domain scenarios - the proposed routing strategy can build multicast trees with metrics similar
to those build by more aggressive technics, with considerable less effort
Efficient Micro-Mobility using Intra-domain Multicast-based Mechanisms (M&M)
One of the most important metrics in the design of IP mobility protocols is
the handover performance. The current Mobile IP (MIP) standard has been shown
to exhibit poor handover performance. Most other work attempts to modify MIP to
slightly improve its efficiency, while others propose complex techniques to
replace MIP. Rather than taking these approaches, we instead propose a new
architecture for providing efficient and smooth handover, while being able to
co-exist and inter-operate with other technologies. Specifically, we propose an
intra-domain multicast-based mobility architecture, where a visiting mobile is
assigned a multicast address to use while moving within a domain. Efficient
handover is achieved using standard multicast join/prune mechanisms. Two
approaches are proposed and contrasted. The first introduces the concept
proxy-based mobility, while the other uses algorithmic mapping to obtain the
multicast address of visiting mobiles. We show that the algorithmic mapping
approach has several advantages over the proxy approach, and provide mechanisms
to support it. Network simulation (using NS-2) is used to evaluate our scheme
and compare it to other routing-based micro-mobility schemes - CIP and HAWAII.
The proactive handover results show that both M&M and CIP shows low handoff
delay and packet reordering depth as compared to HAWAII. The reason for M&M's
comparable performance with CIP is that both use bi-cast in proactive handover.
The M&M, however, handles multiple border routers in a domain, where CIP fails.
We also provide a handover algorithm leveraging the proactive path setup
capability of M&M, which is expected to outperform CIP in case of reactive
handover.Comment: 12 pages, 11 figure
Uma arquitetura para tráfegos "multicast" no modelo de serviços diferenciados
This paper describes a new kind of architecture to use multicast with a high quality of services through the Internet. This architecture can be useful in projects where multimedia interactive applications, like video/audio teleconferences, and retrieving multimedia documents, are used. Resources reservations will be allocated by a bandwidth allocator server/agent to perform the proposed multicast traffic. This work is based on ideas adapted from many Internet-drafts. Of course, this is not a concluded work, since some implementing details require further studies.Este artigo descreve uma arquitetura para a implementação do tráfego "multicast" com qualidade de serviço na Internet. Esta arquitetura baseia-se na reserva de recursos de rede atravĂ©s de servidores e agentes alocadores de largura de banda no Modelo de Serviços Diferenciados. O ambiente proposto Ă© Ăştil em projetos onde há o uso intensivo de aplicações multimĂdia interativas, como teleconferĂŞncia de vĂdeo/áudio, e a recuperação de documentos multimĂdia. Este trabalho baseia-se em propostas encontradas em diversos "Internet-drafts" referentes aos Modelos de Serviços Integrados e Diferenciados. Naturalmente, este nĂŁo Ă© um trabalho finalizado, visto que alguns aspectos de sua implementação requerem estudos
adicionais
Analysis domain model for shared virtual environments
The field of shared virtual environments, which also
encompasses online games and social 3D environments, has a
system landscape consisting of multiple solutions that share great functional overlap. However, there is little system interoperability between the different solutions. A shared virtual environment has an associated problem domain that is highly complex raising difficult challenges to the development process, starting with the architectural design of the underlying system. This paper has two main contributions. The first contribution is a broad domain analysis of shared virtual environments, which enables developers to have a better understanding of the whole rather than the part(s). The second contribution is a reference domain model for discussing and describing solutions - the Analysis Domain Model
Design and implementation of intentional names
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.Includes bibliographical references (leaves 95-98).by Elliot Schwartz.S.B.and M.Eng
The MASC/BGMP architecture for inter-domain multicast routing
Multicast routing enables efficient data distribution to multiple recipients. However, existing work has concentrated on extending single-domain techniques to wide-area networks, rather than providing mechanisms to realize inter-domain multicast on a global scale in the Internet. We describe an architecture for inter-domain multicast routing that consists of two complementary protocols. The Multicast Address-Set Claim (MASC) protocol forms the basis for a hierarchical address allocation architecture. It dynamically allocates to domains multicast address ranges from which groups initiated in the domain get their multicast addresses. The Border-Gateway Multicast Protocol (BGMP), run by the border routers of a domain, constructs inter-domain bidirectional shared trees, while allowing any existing multicast routing protocol to be used within individual domains. The resulting shared tree for a group is rooted at the domain whose address range covers the group's address; this domain is typically the group initiator's domain. We demonstrate the feasibility and performance of these complementary protocols through simulation. This architecture, together with existing protocols operating within each domain, is intended as a framework in which to solve the problems facing the current multicast addressing and routing infrastructure