133,505 research outputs found
Introducing database communication technologies for TED replication in multi-domain networks
In multi-domain transport networks, exchange of Traffic Engineering information is required to enable effective end-to-end service provisioning and restoration by efficiently utilizing network resources. So far, several solutions have been proposed by the communication community such as the Hierarchical Path Computation Element (H-PCE) architecture. Using the H-PCE architecture a parent PCE is responsible for inter-domain path computation, while a dedicated child PCE performs intra-domain path computation within each domain. However, this approach can introduce scalability concerns especially under dynamic traffic condition such as during restoration because all path computation procedures are coordinated by the parent PCE and may require the exchange of many control messages. This paper proposes a standard communication among database systems located at the child PCEs, to exchange and share YANG-based Traffic Engineering information in multi-domain networks. By exploiting currently available database technologies, scalable and predictable performance is demonstrated for both replication mechanisms among child PCEs and information retrieval from the stored databases. Thus, this proposal enables the sharing of intra-domain information at each cPCE that can be locally used, upon failure, to speed-up the recovery procedure
Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
An interrelation between a topological design of network and efficient
algorithm on it is important for its applications to communication or
transportation systems. In this paper, we propose a design principle for a
reliable routing in a store-carry-forward manner based on autonomously moving
message-ferries on a special structure of fractal-like network, which consists
of a self-similar tiling of equilateral triangles. As a collective adaptive
mechanism, the routing is realized by a relay of cyclic message-ferries
corresponded to a concatenation of the triangle cycles and using some good
properties of the network structure. It is recoverable for local accidents in
the hierarchical network structure. Moreover, the design principle is
theoretically supported with a calculation method for the optimal service rates
of message-ferries derived from a tandem queue model for stochastic processes
on a chain of edges in the network. These results obtained from a combination
of complex network science and computer science will be useful for developing a
resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of
Collective Adaptive Systems) at The 9th IEEE International Conference on
SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201
Implementation of QoS onto virtual bus network
Quality of Service (QoS) is a key issue in a multimedia environment because multimedia applications are sensitive to delay. The virtual bus architecture is a hierarchical access network structure that has been proposed to simplify network signaling. The network employs an interconnection of hierarchical database to support advanced routing of the signaling and traffic load. Therefore, the requirements and management of quality of service is important in the virtual bus network particularly to support multimedia applications. QoS and traffic parameters are specified for each class type and the OMNeT model has been described
Multiple-Tree Push-based Overlay Streaming
Multiple-Tree Overlay Streaming has attracted a great amount of attention
from researchers in the past years. Multiple-tree streaming is a promising
alternative to single-tree streaming in terms of node dynamics and load
balancing, among others, which in turn addresses the perceived video quality by
the streaming user on node dynamics or when heterogeneous nodes join the
network. This article presents a comprehensive survey of the different
aproaches and techniques used in this research area. In this paper we identify
node-disjointness as the property most approaches aim to achieve. We also
present an alternative technique which does not try to achieve this but does
local optimizations aiming global optimizations. Thus, we identify this
property as not being absolute necessary for creating robust and heterogeneous
multi-tree overlays. We identify two main design goals: robustness and support
for heterogeneity, and classify existing approaches into these categories as
their main focus
Transport of video over partial order connections
A Partial Order and partial reliable Connection (POC) is an end-to-end transport connection authorized to deliver objects in an order that can differ from the transmitted one. Such a connection is also authorized to lose some objects. The POC concept is motivated by the fact that heterogeneous best-effort networks such as Internet are plagued by unordered delivery of packets and losses, which tax the performances of current applications and protocols. It has been shown, in several research works, that out of order delivery is able to alleviate (with respect to CO service) the use of end systemsâ communication resources. In this paper, the efficiency of out-of-sequence delivery on MPEG video streams processing is studied. Firstly, the transport constraints (in terms of order and reliability) that can be relaxed by MPEG video decoders, for improving video transport, are detailed. Then, we analyze the performance gain induced by this approach in terms of blocking times and recovered errors. We demonstrate that POC connections fill not only the conceptual gap between TCP and UDP but also provide real performance improvements for the transport of multimedia streams such MPEG video
Dirichlet belief networks for topic structure learning
Recently, considerable research effort has been devoted to developing deep
architectures for topic models to learn topic structures. Although several deep
models have been proposed to learn better topic proportions of documents, how
to leverage the benefits of deep structures for learning word distributions of
topics has not yet been rigorously studied. Here we propose a new multi-layer
generative process on word distributions of topics, where each layer consists
of a set of topics and each topic is drawn from a mixture of the topics of the
layer above. As the topics in all layers can be directly interpreted by words,
the proposed model is able to discover interpretable topic hierarchies. As a
self-contained module, our model can be flexibly adapted to different kinds of
topic models to improve their modelling accuracy and interpretability.
Extensive experiments on text corpora demonstrate the advantages of the
proposed model.Comment: accepted in NIPS 201
Macro-routing: a new hierarchical routing protocol
In a continually evolving Internet, tools such as quality of service routing must be used in order to accommodate user demands. QoS routing raises scalability issues within very large networks, which can he avoided by using hierarchical routing strategies. However, such strategies can lead to inaccurate path selection due to the aggregation process. To avoid such problems, we propose a hierarchical routing protocol, called macro-routing, which can distribute the route computation more efficiently throughout the network using mobile agents. It processes more detailed information than conventional hierarchical routing protocols, so is more likely to find the best path between source and destination. Also, by using mobile agents, more than one available path can be found. This provides a fast recovery mechanism, where no protocol restart is needed in a failure situation
- âŠ