Search

A study was conducted to propose a Celnet Xplorer-based self-optimizing network (SON) architecture that enables detailed analysis of network performance. The use of highly efficient, autonomic self-optimization and configuration processes is needed in order to meet performance objectives in Long Term Evolution (LTE) networks.

Problem statement: As group key management extended into the area of large dynamic networks, complex issues emerged involving the many operations that run over several network topologies. The issues that occurred due to multiple topologies were also compounded by differing views of the network, taken at different time slices or positions within the network. This was especially complex when figuring in mobile, ad-hoc networks. View synchrony is the current operational technique, or assumption, applied to group key exchange protocols. However, before this analysis view synchrony was just that, an assumption and the literature for group key exchange lacked an inquiry into what could happen when view synchrony was removed. Current group key management protocols rely on view synchrony and yet all protocols vary in requisite operational descriptions and performance measures. In this study, a framework for group key management protocol operations and performance measures was defined and examined how that framework could be used to compare and contrast existing protocols with and, more importantly, without view synchrony. Approach: Current literature lacked categories by which to quantify the performance metric of the protocols. This study first defined the dynamic key operations that all protocols share. By these definitions, group key management protocols were directly compared. Once definitions existed, this study assembled a list of costs that every protocol requires to establish and share keys across the dynamic group. These results provided an understanding of view synchrony's role and whether or not it should be solely relied on in these current protocols. Results: The prior conclusion that view synchrony was an integral part of all group key management protocols was shattered, when seen through the lens of communication costs and assumptions in wireless ad-hoc networks. View synchrony, as an assumed part of all group key management was previously inconsistently portrayed. The ability to see this before did not exist because a framework upon which to evaluate the costs did not exist. Now, literature can proceed with clearly defined understandings of what values exist in group key management protocols. Conclusion/Recommendations: Better communication in group key management will be a benefit to the entire field. Now that costs can be analyzed, procedure and security can be improved and protocols can be implemented for wireless ad-hoc networks. In addition, it led two authors of this study to create a new protocol, DTEGK, to maximize the most efficient communication, as view synchrony was hindering the effectiveness of previous protocols. Without the hindrance of view synchrony and a quantitative list of defined communication costs, protocols can also now be extended into the wireless, ad-hoc realm of group key management. Key words: Group key management, cryptography, wireless, ad-hoc networks, INTRODUCTION In 1976, Diffie and Hellman (1976) introduced an implementation of two-party key exchange protocol that allowed two participants to create a private cryptographic key through the use of publicly [...]

Alternative network and service architectures for multiple parallel home sensor applications are proposed. The advantage of providing these services and the management of a home sensor network are described.

A hierarchical multi-cell arbiter interconnecting multiple parallel processing devices is proposed. The proposed arbitration scheme decreases signaling overhead and arbitration processing time, while maximizing throughput and delay performance.

The interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using combinatorics and graph theory. A number of interconnection network topologies have been studied. The Extended Fibonacci Cube, EFC, is a topology which provides good properties for an interconnection network regarding diameter, node degree, recursive decomposition, embeddability and communication algorithms. In this research we present some properties of the Extended Fibonacci Cubes, we define a Gray code for extended Fibonacci cubes and show how a hamiltonian path, a hamiltonian cycle and a 2D mesh can be embedded in an Extended Fibonacci Cube. Key words: Interconnection network, extended Fibonacci cube, embeddings, Gray code, hamiltonian path, INTRODUCTION An interconnection network consists of a set of processors, each with a local memory and a set of bidirectional (or unidirectional) links that serve for the exchange of data [...]

An analytics engine, an application enabler accepting inputs from various sources, is proposed to enhance data mining and analytics for service providers. Service providers can monetize available information in their networks using the analytics engine.

The intelligent service-oriented infrastructure is proposed to reduce the effort and cost of providing virtualized networks. This infrastructure allows the testing and running of content delivery services in parallel with each other and introduces resource-sharing capabilities.

An extensible markup language (XML) router topology-discovery control plane algorithm for creating an overlay network of XML routers is presented. This algorithm reduces processing requirements while delivering flexibility, scalability, and minimization of delays.

A comprehensive framework for mining wireless Ad Hoc Sensor Networks (WASNs) is proposed. Findings reveal the efficiency of the proposed framework.

The optimization of the convergence rate of distributed algorithm by the topology given by the nonbipartite Ramanujan graphs is discussed. Results concluded that Ramanujan graphs could be prepared only for a limited number.

This article discusses the underlying supporting technologies, increasing management needs, architecture of broadband home and access networks. These strategies allow operators to deliver services that involve wide range of technologies, terminals and appliances to end users' within their home.

This article describes the next-generation architectures and supporting technologies that will be used for making the next generation of passive optical networks. These innovations will result in a long-term increase in bandwidth, improvement in cost structure and an increase in the area of coverage.

This article describes the process of intelligent packet drop discarding logic encoded in the access node to improve the video quality of experience for broadcast Internet Protocol television (IPTV) services. This allows the operator to increase digital subscriber line coverage of IPTV service package along with fast channel change and without the requirement of additional bandwidth.

The ATLAS experiment will use of order three thousand nodes for the online processing farms. The administration of such a large cluster is a challenge. The ability to quickly turn on/off machines, especially after a power cut, and the ability to remote monitor the hardware health whether the machine be on or off are some of the major issues. To solve these problems ATLAS has decided wherever possible to use Intelligent Platform Management Interfaces (IPMI) for its nodes. This paper will present the mechanisms which were developed to allow the distribution of management and monitoring commands to many machines. These commands were run simultaneously on the prototype farm, by taking into account the specificities of the different IPMI versions and implementations, and the network topology. Results from timing measurements for the distribution of commands to many nodes, for booting and for shutting down of the nodes will be shown with an extrapolation to the final cluster size. Index Terms--Administration, ATLAS, cluster, farm.

In distributed system, the concept of clustering consists on dividing the geographical area covered by a set of nodes into small zones. In mobile network, the clustering mechanism varied due to the mobility of the nodes any time in any direction. That causes the partitioning of the network or the joining of nodes. Several existing centralized or globalized algorithm have been proposed for clustering technique, in a manner that no one node becomes isolated and no cluster becomes overloaded. A particular node called head cluster or leader is elected, has the role to organize the distribution of nodes in clusters. We propose a distributed clustering and leader election mechanism for Ad-Hoc mobile networks, in which the leader is a mobile node. Our results show that, in the case of leader mobility the time needed to elect a new leader is smaller than the time needed a significant topological change in the network is happens. Key words: Dynamic head cluster, Ad-Hoc networks, mechanism, leader, election algorithm, INTRODUCTION Mobile network is a network in which the location of the nodes is variant with the time. The mobile networks can be configured in two manners, infrastructure network and [...]

Power management in mobile network is an open challenges where the power level in the network influences the network life time. However, there are a trade off between the power consumption and the connectivity in mobile networks. We present a topology control mechanism and a routing protocol for Ad-Hoc wireless networks that chooses the shortest path given the lower power consumption. The power consumption in forwarding a packet in the proposed topology is depends on only two main factors are the number of hops and the packet size. Our analytical results are confirmed by our simulation results where both has give the same results for power consumption in sending a packet taking in consideration only the power consumed in communication. Keywords: Power saving, dynamic tree, dynamic routing protocol, topology discovering for mobile networks., INTRODUCTION In wireless communications networks, energy consumption is a major performance metric, lower is the energy consumption longer is the network life time. Thus, there are an increasing interest in [...]

Mobile ad hoc networks(MANET) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self organize into arbitrary and temporary ad-hoc network topologies, allowing people and devices to seamlessly internet work in areas with no preexisting communication infrastructure e.g., disaster recovery environments. An ad-hoc network is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad-hoc paradigm. Recently the introduction of new technologies such as Bluetooth, IEEE 802.11 and hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent revolutions have been generating a renewed and growing interest in the research and development of MANET. To facilitate communication within the network a routing protocol is used to discover routes between nodes. The goal of the routing protocol is to have an efficient route establishment between a pair of nodes, so that messages can be delivered in a timely manner. Bandwidth and power constraints are the important factors to be considered in current wireless network because multi-hop ad-hoc wireless relies on each node in the network to act as a router and packet forwarder. This dependency places bandwidth, power computation demands on mobile host to be taken into account while choosing the protocol. Routing protocols used in wired network cannot be used for mobile ad-hoc networks because of node mobility. The ad-hoc routing protocols are divided into two classes: table driven and demand based. This paper reviews and discusses routing protocol belonging to each category. Keywords: MANET, Routing Protocol, On-demand, active and reactive protocols, INTRODUCTION Wireless network has become very popular in the computing industry. Wireless network are adapted to enable mobility. There are two variations of mobile network. The first is infra-structured network [...]

We study a map of the Internet (at the autonomous systems level), by introducing and using the method of k-shell decomposition and the methods of percolation theory and fractal geometry, to find a model for the structure of the Internet. In particular, our analysis uses information on the connectivity of the network shells to separate, in a unique (no parameters) way, the Internet into three subcomponents: (i) a nucleus that is a small ([approximately equal to] 100 nodes), very well connected globally distributed subgraph; (ii) a fractal subcomponent that is able to connect the bulk of the Internet without congesting the nucleus, with self-similar properties and critical exponents predicted from percolation theory; and (iii) dendrite-like structures, usually isolated nodes that are connected to the rest of the network through the nucleus only. We show that our method of decomposition is robust and provides insight into the underlying structure of the Internet and its functional consequences. Our approach of decomposing the network is general and also useful when studying other complex networks.

This paper investigates the performance of a distributed wireless network in which the nodes are equipped with fully adaptive smart antennas. The main goal is the evaluation of the influence that the geometrical configuration of the antenna array has on network throughput and packet delay. Analysis and simulations are performed to study the relationship between the geometry of the antenna array and the network topology. In this paper, the performance degradation due to both the small-channel angular spreads and the speed of mobile nodes is investigated. The results, which hold for the low-rank channel model only, extend to this specific case previous results obtained in ideal channel conditions. The study adopts an access scheme, previously proposed for ad-hoc networks, which is able to exploit the interferer suppression capabilities of smart antennas, together with realistic models for the antenna and the channel behaviors. Index Terms--Fading channel model, interference mitigation, multipath fading, smart antennas, space-division multiple access, wireless networks.

The simulations results showed that the overall EABR enhancement, when compared with ABR, in terms of communication overhead was ranging from 36% to 56%. While the overall EABR enhancement in terms of number of operation required to reconstructing the route was ranging from 36% to 55%. These enhancements were contributed to the novel way in route reconstructing introduced by EABR. Keywords: ad-hoc mobile Network, ABR, EABR, Associativity, Simulation, INTRODUCTION In (2) a new method for route reconstruction for the ABR(1) was proposed. The routing table was amended with a Serial No field to enhance the optimization while reconstruction [...]

This paper introduces a new intelligent-based approach for detecting islanding in distributed generation (DG). This approach utilizes and combines various system parameter indices in order to secure the detection of islanding for any possible network topology, penetration level and operating condition of the DG under study. Hence, every parameter index displays characteristics for a given set of events. The proposed technique uses the data-mining technology to extract information from the large data sets of these indices after they are screened off-line via massive event analyses using network simulations. The technique is tested on a typical DG with multiple distributed resources and the results indicate that this technique can successfully detect islanding operations. In addition, this technique can also overcome the problem of setting the detection thresholds inherent in the existing techniques by optimizing their settings. Index Terms--Artificial intelligence, data mining, distributed generation, power system protection, power systems.

Multirate simulation of electric networks exhibiting a wide variety of time constants decreases the simulation runtimes by exploiting the property of circuit latency. The fundamental idea is to use different integration steps for different network subsystems, according to the requirements of accuracy of each subsystem. Programs that exploit circuit latency are usually based on relaxation methods that require iterations among the different subsystems of the original networks. These methods lack the numerical robustness of direct implicit integration methods used in circuit simulators and are not adequate for real-time simulation due to their non-uniform solution times. This paper proposes circuit latency exploitation without iterations making use of the concept of interlinked Multi-Area Thevenin Equivalents (MATE). Results are presented showing the efficiency and accuracy of the method. Index Terms--Circuit latency exploitation, multirate simulation, multi-area Thevenin equivalents (MATEs), numerical integration rules.

We extend previous results on sufficient conditions for rearrangeable [Log.sub.2](N, m, p) networks to [Log.sub.d](N, m, p) networks. We show that the original argument using path-intersecting graphs cannot be extended to d > 2, and we give a new argument. Further, we show our sufficient conditions are also necessary. Index Terms--Banyan networks, Log(N, k, p) networks, rearrangeable networks.

This paper proposes a novel framework for developing adaptive and scalable network services. In the proposed framework, a network service is implemented as a group of autonomous agents that interact in the network environment. Agents in the proposed framework are autonomous and capable of simple behaviors (e.g., replication, migration, and death). In this paper, an evolutionary adaptation mechanism is designed using genetic algorithms (GAs) for agents to evolve their behaviors and improve their fitness values (e.g., response time to a service request) to the environment. The proposed framework is evaluated through simulations, and the simulation results demonstrate the ability of autonomous agents to adapt to the network environment. The proposed framework may be suitable for disseminating network services in dynamic and large-scale networks where a large number of data and services need to be replicated, moved, and deleted in a decentralized manner. Index Terms--Adaptive and scalable network services, autonomous agents, evolutionary computation, sell-organization, swarm intelligence.

Equilibrium flow in a physical network with a large number of users (e.g., transportation, communication, and computer networks) need not be unique if the costs of the network elements are [...]

An efficient parallel implementation of neural networks on mesh-connected SIMD machines is discussed.

An innovative transport-aware Internet protocol (IP) router architecture is described and discussed.

An innovative distributed deadlock mechanism is proposed and discussed.

A pseudo-likelihood approach is proposed for solving network tomography problems.

An algorithm for the gossiping problem, defined over an n processor network, N, where multicasting is allowed,?is described and discussed. ?

An approach is described for for enabling network and Web server clients to evaluate a system's multiclass mechanisms and parameters.