Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 International Journal of Engineering Science and Technology , 2012, Abstract: The integrated management of multi-providers equipments is a key asset for telecommunication operators or service providers when selecting the appropriate network and service management platform fortheir network. In this paper, we present an open and adaptable platform that support fault and configuration management for next-generation networks. This platform Named Nagios based – information technology management system (NB-ITMS) leverage of the well-known Nagios platform to implement new capabilities. Offering additional features applications and management functions enable easy and low cost management of advanced services and networks technologies. The performance of our platform has been compared to existing off-the-shell platforms.
 Computer Science , 2012, Abstract: The integrated management of multi-providers equipments is a key asset for telecommunication operators or service providers when selecting the appropriate network and service management platform for their network. In this paper, we present an open and adaptable platform that support fault and configuration management for next-generation networks. This platform Named Nagios based - information technology management system (NB-ITMS) leverage of the well-known Nagios platform to implement new capabilities. Offering additional features applications and management functions enable easy and low cost management of advanced services and networks technologies. The performance of our platform has been compared to existing off-the-shell platforms.
 Vestnik Astrahanskogo Gosudarstvennogo Tehni？eskogo Universiteta. Seria: Upravlenie, Vy？islitel？naa Tehnika i Informatika , 2010, Abstract: Network management is one of the ways to decrease costs for network operation and loss decreasing, caused by network falls. Some tasks in network management are performed by monitoring system. The present systems of moni-toring of network with a dynamic topology are not suitable for networks with dynamic topology. Among free software, due to its functional characteristics Nagios can be singled out, which was designed to monitoring of static networks. However, Nagios can set network topology of different types including network with dynamic topology. Topology of networks with a dynamic topology is more changeable than in networks with static topology. Practical experience shows that Nagios is sensitive to peak demand on a hardware it is installed. In the current version of Nagios, information of network nodes must be entered manually. To avoid loss of infor-mation on network and nodes state, with topology change, it is required to deter-mine the number of temporary selected centers and isolated networks.
 Mathematics , 2011, DOI: 10.2140/agt.2014.14.3185 Abstract: Motivated by the second author's construction of a classifying space for the group of pure symmetric automorphisms of a free product, we introduce and study a family of topological operads, the operads of based cacti, defined for every pointed topological space $(Y,\bullet)$. These operads also admit linear versions, which are defined for every augmented graded cocommutative coalgebra $C$. We show that the homology of the topological operad of based $Y$-cacti is the linear operad of based $H_*(Y)$-cacti. In addition, we show that for every coalgebra $C$ the operad of based $C$-cacti is Koszul. To prove the latter result, we use the criterion of Koszulness for operads due to the first author, utilising the notion of a filtered distributive law between two quadratic operads. We also present a new proof of that criterion which works over the ground field of arbitrary characteristic.
 Mathematics , 2015, Abstract: The concept of resistance distance was first proposed by Klein and Randi\'c. The Kirchhoff index $Kf(G)$ of a graph $G$ is the sum of resistance distance between all pairs of vertices in $G$. A connected graph $G$ is called a cactus if each block of $G$ is either an edge or a cycle. Let $Cat(n;t)$ be the set of connected cacti possessing $n$ vertices and $t$ cycles, where $0\leq t \leq \lfloor\frac{n-1}{2}\rfloor$. In this paper, the maximum kirchhoff index of cacti are characterized, as well as the corresponding extremal graph.