The one-to-all broadcast is the most primary collective communication pattern in a multicomputer network. We consider this problem in a wormhole-routed torus which uses all-port and dimension-ordered routing model. We derive our routing algorithms based on the concept of "span of vector spaces" in linear algebra. For instance, in a 3-D torus, the nodes receiving the broadcast message will be "s...

Given an undirected graph G = (V,E), and a vertex r ∈ V , an r-acyclic orientation of G is an orientation OE of the edges of G such that the digraph OG = (V,OE) is acyclic and r is the unique vertex with indegree equal to 0. For w ∈ RE+, k(G,w) is the w-maximum packing of r-arborescences for all r ∈ V and all racyclic orientations OE of G. In this case, the Broadcast Routing (in Computers Netwo...

In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to trace network routes and infer the motion pattern of nodes at the end of those routes may pose a serious threat to covert operations. We propose ANODR, an anonymous on-demand routing protocol for mobile ad hoc networks de...

ÐIn this paper, we introduce a family of scalable interconnection network topologies, named Recursive Cube of Rings (RCR), which are recursively constructed by adding ring edges to a cube. RCRs possess many desirable topological properties in building scalable parallel machines, such as fixed degree, small diameter, wide bisection width, symmetry, fault tolerance, etc. We first examine the topo...

The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-toall broadcast algorithm supposing that routers implement distanc...

As required by the Routing Protocol Criteria [RFC 1264], this memo discusses the applicability of the Next Hop Resolution Protocol (NHRP) in routing of IP datagrams over Non-Broadcast Multiple Access (NBMA) networks, such as ATM, SMDS and X.25. 1. Protocol Documents The NHRP protocol description is defined in [1]. The NHRP MIB description is defined in [2].

In this paper we propose a new scheme for optical signal routing within Linear Lightwave Network (LLN) subnets. LLN is a recently proposed ber optic network which performs only linear operations on optical signals: power combining , splitting and possibly linear optical ampliication. LLN can be partitioned into several subnets where each subnet is a tree providing full broadcast among all stati...

Mobile ad hoc network or in short MANET is a group of node that exchange the information from source to destination on wireless network. The main problem structure change continously cause by mobility made route disconnected. If disconnect there will be another discovery processes take much time. AOMDV (Ad On-demand Multipath Distance Vector) routing protocol works doing broadcast Route Request...

Using directional antennas to reduce interference and improve throughput in multi hop wireless networks has attracted much attention from the research community in recent years. In this paper, we consider the issue of minimum delay broadcast in multi rate wireless mesh networks using directional antennas. We are given a set of mesh routers equipped with directional antennas, one of which is the...

In this paper, a routing protocol which utilizes the characteristics of Bluetooth technology is proposed for Bluetooth-based mobile ad hoc networks. The routing tables are maintained in the master devices and the routing zone radius for each table is adjusted dynamically by using evolving fuzzy neural networks. Observing there exists some useless routing packets which are helpless to build the ...