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.
Content delivery network interconnection (CDNi) as a new interactive network which inherits all of the advantages of single CDN. Moreover, CDNs supported by different network operators can communicate with each other directly through the interfaces between them. Meanwhile, the interactivity also brings some security issues. In this paper, we propose a new CDNi communication architecture which combined...
Space Information Flow (SIF) is a new research paradigm that studies network coding in a geometric space, which is different with Network Information Flow (NIF) that studies network coding in a graph. One of the key open problems at the core of SIF is to design an algorithm that computes optimal SIF solutions. A new heuristic SIF algorithm based on non-uniform recursive space partitioning is proposed...
AODV protocol is a comparatively more popular on demand routing protocol in mobile ad hoc networks. However, reliability in terms of data communication is not much satisfactory in traditional AODV. This paper presents an AODV with end to end reliability (AODV-EER). The main idea of proposed modification in AODV is to find the route with lowest drop rate from source to destination. We also propose...
In this paper we present a new way of mapping data-parallel applications on coarse-grained reconfigurable architectures (CGRAs) to increase their performance. Traditional mapping approaches aim to map an application to a minimum number of contexts. In this work we gave up this idea. We propose to use the temporal domain with multiple contexts, as the preferred mapping domain. The benefit of this approach...
Identify & measure social relations has been proposed as a method for information routing in opportunistic networks. In this paper, we design a social-relations-based routing algorithm (SRBRA), which overcomes the common issues in existing identify &measure social relation algorithms, such as the deficiency of measuring parameters and the restrict usage of application domain. Firstly,...
Detailed routing is an important stage in VLSI physical design. Due to the high routing complexity, it is difficult for existing routing methods to guarantee total completion without design rule checking violations (DRCs) and it generally takes several days for designers to fix remaining DRC-s. Studies has shown that the low routing quality partly results from non-optimal net-ordering nature of traditional...
In this paper, we have extended the GeoDivRP geodiverse routing protocol to consider jitter requirements when using multiple geographic paths for telecommunication networks under regional challenges. We have formulated bounded-jitter multipath routing using a multi-commodity flow problem and proposed an integer linear programming formulation to solve it. We have implemented the routing protocol in...
The paper presents description algorithm of the trajectory motion correction of an aircraft. The part operations of algorithm are shown in detail. Example of calculation of returning the aircraft to a predetermined route line is given.
In the last few years, Wireless Sensor Network (WSN) emerges and appears as an essential platform for prominent concept of Internet of Things (IoT). Their application ranges from so-called “smart cities”, “smart homes” over environmental monitoring. The connectivity in IoT mainly relies on RPL (IPv6 Routing Protocol for Low Power and Lossy Network) - a routing algorithm that constructs and maintains...
The routing policy Size Interval Task Assignment (SITA) isolates small arrivals from large arrivals, while choosing intervals to balance the workload of each server. It works well for highly variable arrivals, but the isolation can cause server idle-ness. To improve this, we suggest a scheme to add pooling to these SITA-like systems, which can result in better performance. We propose a routing policy,...
In this paper, we consider the problem of finding the maximum routing throughput between any pair of nodes in an arbitrary multirate wireless mesh network (WMN) using multiple paths. Multipath routing is an efficient technique to maximize routing throughput in WMN, however maximizing multipath routing throughput is a NP-complete problem due to the shared medium for electromagnetic wave transmission...
The sensor nodes deployed in wireless sensor networks (WSNs) are strictly energy constrained. Thus energy conservation for maximizing lifetime of the network is central to the design of WSNs. In many applications, the nodes nearer to the sink are overburdened by means of huge traffic load as the data from the entire region are forwarded through them to reach to the sink. As a result, their energy...
Bio-inspired network controls are driven by the competition between their ordering force and disordering force. Both forces simultaneously affect their performance and robustness. Therefore, we must carefully determine their balance. In this paper, we focus on thermodynamic phenomena where a substance achieves the balance between both forces depending on its temperature. We translate bio-inspired...
Delay Tolerant Networks are the kind of networks in which an end-to-end path between any source and destination pair may never exist. In these networks, nodes use store-carryforward mechanism for data transmission. In this mechanism, nodes store the messages in their buffers and carry them to reach the appropriate forwarding chance. Most of the previous efforts on improving the performance of routing...
Opportunistic Routing (OR) takes advantage of the broadcast nature of the wireless medium to increase reliability in communications. Instead of selecting one node as the next-hop forwarder, OR selects a set of candidates to forward the packet. In this way, if one of them does not receive the packet from the source, another candidate will be able to do it, this avoids the need forare-transmission from...
In this paper, we first propose a static analysis approach to estimate the maximum value of the worst-case latency of all possible communications in a Chip Multi-Processor (CMP) with a 2D-Mesh Network-on-Chip (NoC), which is called the Worst-case Inter-core Communication Latency (WICL). Then the Hop-based Priority scheduling approach is proposed for a 2D-Mesh NoC to improve its WICL. Our experimental...
Vehicular Ad hoc Networks (VANETs) have gained considerable attention in recent years because of the extensive applications. However, VANETs are confronted with numerous difficulties and challenges, which lead to communication performance degradation and even data delivery failure. In this paper, we propose a new routing protocol called Intersection-based Delay sensitive Routing using Ant colony optimization...
Backpressure Routing is a cross-layer control algorithm that makes decisions on routing and resource allocation in mobile ad hoc networks using network state information like queue backlog values and current available channel rates. While it is desirable because of its provable performance guarantees, including providing optimal throughput, the real world problem of implementing backpressure routing...
This paper proposes and subsequently delineates quantification of network security metrics using software defined networking approach in real time using a progressive testbed. This comprehensive testbed implements computation of trust values which lend sentient decision making qualities to the participant nodes in a network and fortify it against threats like blackhole and flooding attacks. AODV and...
With the rapid increase in the number of processor cores on a chip, packet-switching networks on chip (NoCs) have emerged as a promising paradigm for designing scalable communication infrastructures for future multi-core processors. The quest for high-performance networks, however, has led to very area-consuming and complex routers with marginal return in performance. On the other hand, studies show...
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.