1,841 research outputs found
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
Software Defined Networks based Smart Grid Communication: A Comprehensive Survey
The current power grid is no longer a feasible solution due to
ever-increasing user demand of electricity, old infrastructure, and reliability
issues and thus require transformation to a better grid a.k.a., smart grid
(SG). The key features that distinguish SG from the conventional electrical
power grid are its capability to perform two-way communication, demand side
management, and real time pricing. Despite all these advantages that SG will
bring, there are certain issues which are specific to SG communication system.
For instance, network management of current SG systems is complex, time
consuming, and done manually. Moreover, SG communication (SGC) system is built
on different vendor specific devices and protocols. Therefore, the current SG
systems are not protocol independent, thus leading to interoperability issue.
Software defined network (SDN) has been proposed to monitor and manage the
communication networks globally. This article serves as a comprehensive survey
on SDN-based SGC. In this article, we first discuss taxonomy of advantages of
SDNbased SGC.We then discuss SDN-based SGC architectures, along with case
studies. Our article provides an in-depth discussion on routing schemes for
SDN-based SGC. We also provide detailed survey of security and privacy schemes
applied to SDN-based SGC. We furthermore present challenges, open issues, and
future research directions related to SDN-based SGC.Comment: Accepte
Class-based multicast routing in interdomain scenarios
DiffServ-like domains bring new challenges to quality of service (QoS) multicast routing simply by shifting the focus from individual flows into classes of flows. Packets are marked at edge routers and receive differentiated treatment according to the class and not the flow that they belong to. DiffServ therefore became adverse to multicast, as packet replication inside the domain may require classification and remarking functions not present in core nodes. At the interdomain level, no doubt multicast QoS complexity is increased by the interleaving of DiffServ and non-Diffserv domains, making it more difficult to address QoS multicast in an end-to-end perspective. In today’s real interconnection world, classes of service have no meaning in certain links of a full interdomain path. While the problem is not new, as already pointed out, there are no real efforts to bring multicast back to a class-of-service domain without compromising its model of operation. In this article, we present an innovative multicast QoS routing strategy, clearly designed for the new class-of-service paradigm. The solution is based upon the construction of multiple trees, one per class of service available, while still allowing receivers to shift for source-specific trees in its own class of service. The strategy is presented in a full end-to-end perspective. Intradomain trees use differentiated routing paths thus helping traffic differentiation. Intradomain receivers are allowed to shift from shared trees into an adequate class-of-service source tree. At interdomain level, each class-of-service interdomain tree branch is accomplished by means of an improved path probing strategy enabling for QoS path establishment. This paper presents this new strategy, and associated protocols, for constructing several multicast and directed distribution trees, one per class of service, within each multicast group. This new strategy and associated protocols are then simulated using NS-2 platform. Simulation results are analyzed and compared with other multicast routing solutions, both at intra- and interdomain levels
Over provisioning-centric QoS-routing mechanism for the communication paradigm of future internet 4WARD proposal
The FP7 4WARD clean-slate Project envisions overcoming the limitations of current Internet by redefining it to efficiently support complex value-added sessions and services, such as location-based, health-care, critical-mission, and geo processing. The list of networking innovations from 4WARD’s Future Internet (FI) proposal includes a new connectivity paradigm called Generic Path (GP), a common representation for all communications. From the networking point of view, a GP is mapped to a communication path for data propagation. For that, GP architecture relies on routing mechanism for selecting best communication paths. In order to assure reliable communications, the routing mechanism must efficiently provision QoS-aware multi-party capable paths, with robustness functions, while keeping network performance. Therefore, this paper proposes the QoS-Routing and Resource Control (QoS-RRC) mechanism to deal with the hereinabove requirements by means of an over provisioning-centric (bandwidth and paths) approach. QoS-RRC achieves scalability by avoiding per-flow operations (e.g., signaling, state storage, etc.). Initial QoS-RRC performance evaluation was carried out in Network Simulator v.2 (NS-2), enabling drastic reduction of overall signaling exchanges compared to per-flow solutions
QoS-RRC: Integrated QoS routing and resource provisioning mechanism for future internet
Generic Path (GP) is a new connectivity paradigm proposed to facilitate the inclusion of new applications and services abstracting communications between entities, regardless of their location or architectural layer. This paper enhances the GP architecture with a new mechanism integrating QoS-Routing and Resource Control (QoS-RRC) strategies to dynamically control GP session requirements regarding QoS and connectivity. This solution uses over-provisioning and admission control, and is aimed at multi-party time-sensitive sessions. Initial performance evaluation was carried out in Network Simulator v.2 (NS-2), showing capabilities in reducing overall signaling load in comparison with a value-added per-flow approach
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
- …