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.
Opportunistic routing (OR) is a promising technology for improving the throughput of wireless networks. In contrast to traditional routing techniques that forward messages along predetermined paths, OR schemes allow selection of a set of candidate nodes as potential next-hop forwarders to utilize the broadcast nature of the wireless medium. An analysis of transmission latency and signaling overhead...
Various topologies have been proposed in the context of high-performance computing and data center networking. Direct-connect topologies generally offer large capacity with high path diversity and are highly cost effective for general data center traffic patterns. However, the lack of simple yet efficient load balancing techniques for direct-connect fabrics has hindered these networks from gaining...
Most sensor networks employ dynamic routing protocols so that the routing topology can be dynamically optimized with environmental changes. The routing behaviors can be quite complex with increasing network scale and environmental dynamics. Knowledge on the routing path of each packet is certainly a great help in understanding the complex routing behaviors, allowing effective performance diagnosis...
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for network dynamics...
A low-latency and reliable message switching network is critical for constructing high-speed datacenter networks. In this paper, we present the design, implementation, and evaluation of a novel Location basEd Source Switching (LESS) for datacenter networks. LESS enables lightweight source switching through a location-based addressing scheme. Each switch and host can independently derive a source route...
We introduce structural transformations that allow simplifying a given network while preserving its original “bandwidth” and “routing” capabilities, transparently to specific allocations. We minimize a certain objective such as the aggregate capacity of network links, number of nodes, or number of links, in such a way that all the bandwidth that could be routed in the original network can also be...
The spined cube is a variant of the hypercube and it provides a promising topology of interconnection networks for massively parallel systems. The diameter of the n-spined cube is almost equal to (n + 3) / 3, which is smallest among the variants of the hypercube. In this paper, we propose a shortest-path routing algorithm in spined cubes.
The locally twisted cube provides a prospective topology suitable for interconnection networks of the massively parallel systems. A routing algorithm is proposed in this paper that tolerates faulty vertices in locally twisted cubes based on two kinds of routing probabilities. A computer experiment is also conducted to verify the performance of our algorithm.
Wireless devices such as sensors have increasingly more processing, storage, and networking capabilities, making wireless sensor networks (WSNs) get lots of attentions in recent years. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care,...
In this poster, we consider software-defined wireless sensor networks (SDWSNs) and present a lightweight flow management to reconfigure flow entries in flow-table when link fault occurs in the data plane of SDWSNs.
High throughput data transfers across the Internet has become a challenge with deployment of data centers and cloud platforms. In this paper, we propose to utilize the cores of a router to build multiple abstractions of the underlying topology to parallelize end-to-end (e2e) streams for bulk data transfers. By abstracting a different graph for each core, we steer each core to calculate a different...
Datacenter networks (DCNs) play an important role in supporting cloud computing and Internet-based services. The cost and power consumption of a DCN grow rapidly with the increases of network scale and bandwidth requirement. The cost, complexity and efficiency of a DCN are determined by several design factors including the topology, addressing and routing. In this paper, we propose a simple and cost-effective...
By carefully selecting and establishing overlay edges and computing multiple underlay-edge-disjoint paths, the ability to still fulfill demands in a VPN in case of edge-failures can be significantly increased. This article presents an approach to construct efficient and optimally resilient VPN overlay topologies together with the corresponding overlay paths to fulfill a given set of demands (connectivity...
Efficient and secure device to device communication is a necessary enabler for realization of fog and edge computing models. With an ever-increasing number, diversity, and geographical distribution of heterogeneous devices, ranging from pervasive sensor networks to edge cloudlets, the interconnection and network management of these devices emerges as a major challenge. Peer-to-peer (P2P) network overlays...
There has been explosive growth of satellite applications in the past decades. Broadcast is a fundamental operation in satellite networks, which is required for satellites self-organization, routing discovery, coordination and collaborations. In this paper, we study the problem of delay bounded and energy efficient broadcast in satellite networks. Broadcast routing is a challenging issue in satellite...
Network messaging delay historically constitutes a large portion of the wall-clock time for High Performance Computing (HPC) applications, as these applications run on many nodes and involve intensive communication among their tasks. Dragonfly network topology has emerged as a promising solution for building exascale HPC systems owing to its low network diameter and large bisection bandwidth. Dragonfly...
We analyze topological entropy in wireless networks that are subject to local scattering and macroscopic shadowing effects. To this end, we model a network as a random geometric graph with probabilistic pair connections (due to channel randomness) and define uncertainty as the Shannon entropy of the underlying graph ensemble. We present new bounds on topological entropy that are functionals of the...
Leveraging Software-Defined Networking (SDN) and middleboxes, application-level policies can be propagated to the network. SMART is an SDN middlebox architecture that differentiates network flows based on tenant inputs. By leveraging FlowTags software middlebox in addition to the OpenFlow rules, it supports a larger scope of tenant preferences and rules from the application layer to alter the network...
Interconnection network is a main concern in the architecture design of highly parallel systems such as high density data centers and supercomputers that reach millions of endpoints, e.g., 10M cores for Sunway TaihuLight system. As the number of endpoints of such systems has gradually increased to meet the higher computing and storage demand, the interconnection network is required to provide a low...
On most supercomputers, except some torus network based systems, resource managers allocate nodes to jobs without considering the sharing of network resources by different jobs. Such network-oblivious resource allocations result in link sharing among multiple jobs that can cause significant performance variability and performance degradation for individual jobs. In this paper, we explore low-diameter...
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.