this paper describes an integrated management architecture and solution for controlling network elements composed of controller, optional aggregation switch and a variable number of optical line terminals (OLTs), incl...
详细信息
this paper describes an integrated management architecture and solution for controlling network elements composed of controller, optional aggregation switch and a variable number of optical line terminals (OLTs), including multiple OLTs based on different technologies and presenting distinct features. the YANG language was used to model configuration and state data manipulated by the Network Configuration Protocol (NETCONF). the system allows the configuration of OpenFlow switches, providing greater protocol flexibility and forwarding algorithms to the aggregation network. the architecture has been implemented and tested using a real Gigabit-capable Passive Optical Network (GPON), a stacked GPON and switch equipment in a variety of scenarios.
Owing to the widely used of data stream, frequent itemset mining on data stream have received more attention. data stream is fast changing, massive, and potentially infinite. therefore, we have to establish new data s...
详细信息
ISBN:
(纸本)9781479951529
Owing to the widely used of data stream, frequent itemset mining on data stream have received more attention. data stream is fast changing, massive, and potentially infinite. therefore, we have to establish new data structure and algorithm to mine it. On the base of our previous work, we propose a new paralleled frequent itemset mining algorithm for data stream based on sliding window, which is called PFIMSD. the algorithm compresses whole data in current window into PSD-trees on paralleled processor only by one-scan. Increment method is used to append or delete related branch on PSD-tree when window is sliding. the experiment shows PFIMSD algorithm has good performance on efficiency and expansibility.
the rise of cloud computing and its elastic, on-demand resource provisioning introduces the need for a flexible and scalable multi-tenant architecture. In a multi-tenant application every tenant (client) makes use of ...
详细信息
the rise of cloud computing and its elastic, on-demand resource provisioning introduces the need for a flexible and scalable multi-tenant architecture. In a multi-tenant application every tenant (client) makes use of shared application instances, but each tenant typically has its own user data. the shared application instance behaves like a private instance by guaranteeing bothdata separation and performance separation for every tenant. As the number of tenants increases, the amount of data grows. A scalable solution for the storage is needed, allowing tenant data to be divided over multiple database instances, but taking into account performance isolation and custom data assurance policies. In this paper we introduce an abstraction layer for achieving high scalability for the storage of tenant data. this layer uses data allocation algorithms to determine an acceptable allocation of tenant data to different databases. We describe a mathematical model for the allocation of tenant data which can be optimized using existing linear programming techniques, and introduce the BDAA-n and FDAA, two algorithmsthat will find an optimal allocation of data by iterating over the possible permutations. the proposed solutions are evaluated based on their flexibility, complexity and efficiency. the flexibility of the BDAA and FDAA makes them easy to customize and extend to fit most scenarios, but the algorithms will achieve best results for tenants with a limited number of subtenants. Linear programming is an alternative for tenants with a higher number of subtenants, but the customizability of the algorithm for specific use cases is limited due to the need for linear functions.
Specifically designed to exchange configuration information from a management platform to network components, the XML-based NETCONF protocol has become widely used. In combination with NETCONF, YANG is the correspondi...
详细信息
Specifically designed to exchange configuration information from a management platform to network components, the XML-based NETCONF protocol has become widely used. In combination with NETCONF, YANG is the corresponding protocol that defines the associated datastructures, supporting virtually all network configuration protocols. YANG itself is a semantically rich language, which - in order to facilitate familiarization withthe relevant subject - is often visualized using UML to involve other experts or developers and to support them by their daily work (writing applications which make use of YANG/NETCONF). To support this process, this paper presents an novel approach to optimize and simplify YANG data models, as current solutions tend to produce very complex UML diagrams. therefore, we have (i) defined a bidirectional mapping of YANG to UML, (ii) developed a strategy to reduce the numbers of objects, and (iii) created a tool that renders the created UML diagrams, closing the gap between technically improved data models and their human readability.
Based on granular space,the hierarchical structure invariance and optimal approximation for proximity data are presented,and four results are obtained as ***,an improved algorithm for computing the hierarchical struct...
详细信息
ISBN:
(纸本)9781479951499
Based on granular space,the hierarchical structure invariance and optimal approximation for proximity data are presented,and four results are obtained as ***,an improved algorithm for computing the hierarchical structure and the related min-transitive closure of a fuzzy proximity relation are given,and the properties of key point sequence are studied by introducing the key points and key values of a fuzzy proximity ***,two basic concepts,the hierarchical structure invariance and isomorphism of fuzzy proximity relations are introduced,and some examples are given to illustrate that the hierarchical structure of a fuzzy proximity relation is variant under three typical triangular ***,the hierarchical structure invariance theorem of fuzzy proximity relation under a mapping or transformation is ***,for a given fuzzy proximity relation,a mathematical model for obtaining the optimal approximation in order to keep its hierarchical structure is established through the use of the linear combination of its minimum fuzzy proximity relation and min-transitive *** results help us understand the hierarchical structures,and provide theories and methodologies for the structural analysis and applications of proximity data.
In this paper, an experimental comparison of publicly available algorithms for computing intents of all formal concepts and mining frequent closed itemsets is provided. Experiments are performed on real data sets from...
详细信息
In this paper we show the results of the experimental comparison of five triclustering algorithms on real-world and synthetic data wrt. resource efficiency and 4 quality measures. One of the algorithms, the OAC-triclu...
详细信息
this paper describes datastructures and algorithmsthat allow disciplinary taxonomic experts to embed Formal Contexts within a graph of Archive Information Packages (AIP's). the AIP's are standardized objects...
详细信息
We present a product-centric collaboration platform comprising partner companies and their customers. By employing the Linked data principles it enables them to easily publish and retrieve information about products a...
详细信息
We present a product-centric collaboration platform comprising partner companies and their customers. By employing the Linked data principles it enables them to easily publish and retrieve information about products and to include user-generated content as well as publicly available information from the Linked Open data web. Information about products is modelled as OWL ontologies, which makes it more useful and easier to understand for application developers. Self-explanatory datastructures also lower the threshold for new partners interested in joining the network and contributing their products. the versatility of this approach is illustrated by two application scenarios.
the proceedings contain 17 papers. the topics discussed include: asymmetric distribution of nodes in the spatial preferred attachment model;a spatial preferential attachment model with local clustering;a local cluster...
ISBN:
(纸本)9783319035352
the proceedings contain 17 papers. the topics discussed include: asymmetric distribution of nodes in the spatial preferred attachment model;a spatial preferential attachment model with local clustering;a local clustering algorithm for connection graphs;on the power of adversarial infections in networks;on the choice of kernel and labeled data in semi-supervised learning methods;a nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks;evolution of the media web;random intersection graph process;alpha current flow betweenness centrality;tree nash equilibria in the network creation game;fast low-cost estimation of network properties using random walks;fast algorithms for the maximum clique problem on massive sparse graphs;a faster algorithm to update betweenness centrality after node alteration;and generalized preferential attachment: tunable power-law degree distribution and clustering coefficient.
暂无评论