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.
Diversity coding is a form of network coding for link failure recovery in communication networks. Since it employs coding, there is no feedback signaling, and that feature makes it very fast. Previously, we have employed this basic technique and linear programming to come up with fast link failure recovery systems that also have small extra capacity. One approach, Diversity Coding Tree, employs mixed...
As modern CMPs scale to ever increasing core counts, Networks-on-Chip (NoCs) are emerging as an interconnection fabric, enabling communication between components. While NoCs provide high and scalable bandwidth, current routing algorithms, such as dimension-ordered routing, suffer from poor load balance, leading to reduced throughput and high latencies. Improving load balance, hence, is critical in...
In this paper, we propose an energy-efficient transmission scheme for monitoring soldier health in tactical mobile ad hoc networks (T-MANET). In the proposed scheme, a constrained route discovery algorithm is used to determine feasible routing paths between the source nodes and sink node. A cross-layer optimization approach is then used to determine the optimal routes and minimum power required to...
With the rapid growth of the Internet, the update messages in backbone routers become more and more frequent due to the ever-increasing dynamic changes on network topologies and new emerging functionalities of the Internet. In addition, update messages often come as a burst. Update action interrupts the packet lookup operation in the router's data plane, thus inefficient incremental update algorithm...
Cognitive radio (CR) is a promising technology to solve the spectrum scarcity problem by enabling secondary users (SU) to utilize the spectrum holes of primary users (PU) caused by static spectrum allocation. However, SUs need to avoid the interference to PUs, imposing new challenges in routing protocol designs and throughput improvement in CR networks (CRN). In this paper we propose a cross-layer...
In Cognitive-Radio (CR) enabled Vehicular Ad-Hoc NETworks (CR-VANETs), high mobility of vehicles and dynamically varying spectrum occupation statuses frequently cause the established routes broken. To deal with the increasing mobility and dynamics of accessible spectrum, we propose an expected path-duration maximized routing (EPDM-R) algorithm in CR-VANETs. Specifically, we study the scenario of cognitive...
We address the problem of finding the least cost disjoint path pair with delay constraints, where working and protection paths require different delay constraints. A heuristic algorithm is proposed and compared with optimal ILP results.
The Internet is facing severe routing scalability problem. The Internet Service Providers cannot afford to upgrade their routers at the pace of routing table growth. Therefore, FIB aggregation has been proposed. However, current single-nexthop FIB aggregation solutions cannot provide a satisfactory performance. In this paper, we first propose the next hop of strict partial order (SPO next hop) to...
The paper presents an approach of the design optimization for the TAFHNET model, including cognitive features, with the focus on a secure (anonymous) routing algorithm (SECRAL). The SECRAL is offering a simpler solution with an alternative original mathematical model, aiming a balance between the highest security and the complexity cost and including scalable additional cognitive information (ACI)...
With the fast development of Internet, the size of routing tables in the backbone routers keeps a rapid growth in recent years. An effective solution to control the memory occupation of the ever-increased huge routing table is the Forwarding Information Base (FIB) compression. Existing optimal FIB compression algorithm ORTC suffers from high computational complexity and poor update performance, due...
In scenarios in which new robots and tasks are added to a network of already deployed, interchangeable robots, a trade-off arises in minimizing the cost to execute the tasks and the level of disruption to the system. This paper considers a navigation-oriented variant of this problem and proposes a parametrizable method to adjust the optimization criterion: from minimizing global travel time (or energy,...
This paper propose a novel, induction based replicative patterns algorithm towards searching all routes in a unidirectional flow network. The fundamental approach is to generate all paths from a source node to sink node (destination node), represented in a two-dimensional matrix applying the proposed induction based on replicative patterns of matrix cells. It is found that, by starting a network with...
Small-World networks have been an active and common topic in many disciplines, including the social and natural sciences. In order to understand the "Small-World phenomenon" deeply, Klein berg proposed an augmented graph model and demonstrated "six degrees of separation" from an algorithmic perspective. Since then, the Small-World model has been an important issue which has been...
Design automation for analog and mixed signal designs has become more important, as analog and digital components are integrated on the same system-on-chips (SOCs). Exact route matching is an important constraint for analog and mixed signal designs with nonuniform metal stacks. In this paper, we propose a constrained-path based maze routing algorithm that can handle exact matching constraints for...
We present a path selection algorithm that is used when deploying hard real-time traffic flows onto a chip-multiprocessor system. This chip-multiprocessor system uses a priority-based real-time network-on-chip interconnect between the multiple processors. The problem we address is the following: given a mapping of the tasks onto a chip-multiprocessor system, we need to determine the paths that the...
We considered the one-sided single-detour untangling twisted nets problem for printed circuit board bus routing. A previous optimal dynamic programming based O(n3) algorithm was proposed in a previous work, where n is the number of nets. In this paper, we propose an optimal O(n) untangling algorithm without considering capacity, and this algorithm is further modified to consider capacity. Experimental...
As technology evolves, networks-on-chip will need to survive to manufacturing faults in order to sustain yield. An effective configuration strategy implies the design of an efficient routing infrastructure, that enables a fast and efficient configuration of the NoC system to go around faulty links and switches. The strategy must minimize the overhead in resources and guarantee the entire system to...
Routing in a wireless sensor network field requires significant resources. Computing optimal routes using graph theoretic algorithms becomes intractable as number of nodes become very large. In this paper, authors propose an alternative using a continuous function approximation for path cost. It is based on a fluid type approximation in which the whole network is replaced by a continuum plain - where...
Several large-scale distributed applications exploiting multicast communication require reliable delivery of data to all participants. In addition, scalability, throughput stability, efficient loss recovery and buffer management are essential communication properties in large-scale settings. In this paper, we first analyze, the instability factors and their results in the multicast infrastructure,...
As the satellites are limited by the deficient hardware resources and the difficulty of upgrading, the application of inter-satellite dynamic routing has been restricted. Meanwhile, the rapid changes of the satellites dynamic network topology caused by satellites' high-speed movement require a highly efficient static routing algorithm. By fully considering the characteristics of sparse edges of the...
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.