The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper considers the problem of constructing minimum-delay multicast trees for message dissemination in overlay networks in which nodal delays for processing messages are taken into account in addition to communication delays. The objective is to find a multicast tree to deliver a message from a source to multiple destinations in minimum delay time. This paper introduces a new delay measure called...
A core area of peer-to-peer (P2P) research is the overlay topology of the network. There are two main types of overlay topologies: structured and unstructured. The unstructured networks have excessive lookup costs, while the structured networks have many restraints between the shared data placement and topology characteristics of P2P networks. Hybrid peer-to-peer (P2P) networks that construct overlay...
The increasing growth of the global Internet making the shortcomings of its unstructured topology and distributed routing algorithm are exposed more rapidly. To design a controllable, scalable and manageable backbone network with a simple, efficient architecture is very imperative. Among many topologies, Tree topology which has a natural hierarchical structure and explicit end-to-end transmission...
We consider a class of single-source multicast discrete memoryless tree networks in which the root node is the source, each parent node in the graph has at most one noisy child node and any number of noiseless child nodes, and subsets of leaf nodes are destinations. For this class of multicast tree networks, lower and upper bounds on the capacity are presented and these two bounds are shown to meet...
This paper presents a particle swarm optimization for solving Steiner tree problem. In the algorithm a tree structure representation is used to encode a particle. To realize the transmission of tree structure information a novel method of particles flying in search space is proposed. We also present the r-neighborhood ring topology of particles to enhance the ability of local and global search of...
Currently implemented Spanning Tree Protocol (STP) cannot meet the requirement of a data center due to its poor bandwidth utilization and lack of multipathing capability. In this paper, we propose a layer-2 multipathing solution, namely dynamic load balancing multipathing (DLBMP), for data center Ethernets. With DLBMP, traffic between two communication nodes can be spread among multiple paths. The...
This paper compares different alternative aggregation techniques for Wireless Sensor Networks Optimization based on tree construction. The main idea is to efficiently elect parent nodes responsible of data aggregation according to their connectivity degree. Thus, the quantity of data transmitted on the network remains minimal during the transfer from all sensors towards the sink. Simulations have...
We investigate the performance of IEEE 802.15.4 MAC (Medium Access Control) sublayer in beacon-enabled tree-topology Wireless Sensor Networks (WSNs). To our knowledge, current literature has mostly focused on relatively simpler star topology or non-beacon-enabled peer-to-peer networks. In our work, we first respectively evaluate the impact of different traffic loads from the source nodes in each depth...
Peer-to-peer (P2P) architectures have recently become a popular design choice for building virtual environments (VEs). In P2P-based VEs, peer connectivity between the different VE users depends on their positions in the virtual world regardless of the underlying physical network, which is subject to redundant hops and delay. In this paper, we propose Tri-Cast, a fully-distributed P2P architecture...
Adaptive global synchronization of a class of directed dynamical networks with switching topologies is investigated. It is found that if there exists a directed spanning tree in the fixed time-average of network topology and the time-average is achieved sufficiently fast, then the network will reach global synchronization for appreciate coupling strength. A sufficient condition about the global synchronization...
The paper proposed a structure measure of multicast tree using FPN( fuzzy Petri net) model with the concept of IRS(immediately reachable set) in MANET(Mobile Ad Hoc Networks). It allows structured representation of network topology, and improves the efficiency of the ad hoc network routing scheme. Therefore when a packet is to be multicast to a group by a multicast source, a heuristic algorithm is...
The capacity of wireless mesh networks can be enhanced with judicious channel assignment. This paper deals with one particular type of mesh network topology - the tree topology. The unique characteristics of this topology is that all the traffic to/from the mesh nodes goes through the root. This enables design of an efficient channel allocation algorithm that utilizes the intrinsic characteristics...
The demand for faster failure-recovery in pure intra-domain IP networks has led to the development of several IP Fast ReRoute (IPFRR) mechanisms. However, these mechanisms are all either too computationally expensive, or fail to provide satisfiable protection coverage. For these reasons, IPFRR schemes have yet to see widespread commercial deployment. In this paper, we present a new IPFRR mechanism...
Spanning Tree Protocol (STP) is a layer-2 IEEE approved standard that provides a loop-free forwarding topology in Ethernet networks. STP does this task by reducing the topology of a switched network to a tree topology where redundant ports are blocked. This action ensures there is a unique path from any node to every other node. In STP, there isn't any traffic engineering mechanism for load balancing...
Topology control and maintenance of network connectivity are two important issues that need to be addressed in wireless networks in tactical scenarios. Topology control is more prominent with multi-interface multi-channel (MIMC) tactical mobile ad hoc networks (MANETs) due to mobility of wireless nodes. The nodes in tactical mobile ad hoc networks within non-uniform transmission range require proper...
The paper investigates an impact of direct and combining collective communications models that may be critical for performance of parallel applications. Analysis provided for any given start-up time and message transfer time reveals the fastest collective communication mode in relation to the number of processing elements in 2D meshes and fat tree networks on a chip.
The tree decomposition of graphs is a fundamental algorithmic tool. It has been shown that difficult problems, such as some NP-complete ones, can be solved efficiently over classes of graphs of bounded tree-width. We consider in this paper the distributed construction of the tree decompositions of network topology graphs. We propose algorithms to distributively construct the tree-decomposition of...
To reduce influence of node failure and achieve high reliability in communications, research on node protection algorithm is needed. In this paper, we first provide an overview of current research of redundant tree algorithm (RT). Then we propose a new algorithm called single node protection algorithm (SNP) based on previous redundant tree algorithm, which is used to achieve recovery form single node...
Energy utilization is a challenging task that is being encountered in low-powered Wireless Sensor Networks (WSNs) when designing an algorithm, protocol or hardware. Congestion is a factor that can affect a network's lifetime (and energy utilization), since it usually leads to packet drops or collisions in the medium followed by possible retransmissions. Forwarding data packets through alternative...
In this paper we analyze the challenging problem of energy saving in IP networks. A novel network-level strategy based on a modification of current link-state routing protocols, such as OSPF, is proposed; according to this strategy, IP routers are able to power off some network links during low traffic periods. The proposed solution is a three-phases algorithm: in the first phase some routers are...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.