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.
As the technology scales toward deeper submicron, system-on-chip designs have migrated from fairly simple single processor and memory designs to relatively complicated systems with higher communication requirements. Network-on-chip architectures emerged as promising solutions for future system-on-chip communication architecture designs. However, the switching and routing algorithm design of network-on-chip...
Delay Tolerant Networks (DTNs) differ from the traditional Mobile Ad Hoc networks (MANETs) in that DTNs are not always interconnected. The issue of routing data in a DTN is considered here. Many routing protocols exist for DTNs. Some are based on comparing nodes to each other, whereas others focus on the internal properties of the messages they hold. There are wide ranges of protocols, and they perform...
The paper proposes a new technique for deadlock control for a class of generalized Petri net (PN) with S4PR net, from the concept of control siphon. One important property of PN is to design structure, in terms of siphons, in order to the characterization of the deadlock prevent, and analytic structure of the synchronization subsystem which is needed to control place in a system. An efficient siphon...
This paper investigates the network function virtualization (NFV)-enabled multicast problem, and proposes a steiner tree-based algorithm to reduce the cost of virtual network function (VNF) deployment and routing. In the algorithm, to minimize the bandwidth consumption, the Steiner tree is constructed by taking all the destination nodes as the terminals. Then a interconnection node of the tree is...
The Network on-Chip (NoC) is considered as an emerging technology for distributed embedded systems which is proposed as an alternative interconnection solution in Mutli-Processors System on-Chip (MPSoC). This paper proposes a graphical toll that allows researchers to generate and configure quickly their Network on-Chip in the hope to evaluate easily their contributions in no time. Unlike major existing...
We present two geometric routing algorithms that reliably deliver messages to all devices in a geocast region. One algorithm is based on flooding, the other on concurrent geometric routing. They are the fist known stateless geocasting algorithms. We formally prove the algorithms correct, evaluate their performance through abstract and concrete simulation and estimate their message complexity.
Recent rapid scale out of high performance computing systems has rapidly and continuously increased the scale and complexity of the interconnects. As a result, current static and over-provisioned interconnects are becoming cost-ineffective. Against this background, we have been working on the integration of network programmability into the interconnect control, based on the idea that dynamically controlling...
In this paper, the effect of power via stub resonance on 25Gbps+ signaling is investigated. Two methods of removing lower frequency resonances caused by power vias are proposed for symmetrical high speed signal and power via structures. This paper analyses the effectiveness of the proposed methods by presenting simulations and experimental data. The signaling impact of power vias on conventional solutions...
There are some shortcomings in the delay tolerant network (DTN) routing algorithm, such as low message delivery rate, low network efficiency and high cost in the satellite network. In order to solve the problem above, this paper proposes a limited copy algorithm MPWLC based on service probability. In MPWLC, not only is the number of copies limited, but the storage resources of the satellite are also...
The Vehicular Ad Hoc Networks (VANETs), as an important part of intelligent transportation systems (ITS), has been becoming a promising research area. Due to the high mobility of vehicles and intermittent connected topology resulting in the dramatically changing network topology, it is difficult to design a protocol including congestion control mechanism, which is helpful for a well network performance...
This paper evaluates the performance of the first-last-exact fit spectrum allocation policy for elastic optical networks. The first-last-exact fit spectrum allocation policy is intended to increase the number of aligned available slots and avoid small contiguous available slots, and hence suppresses the blocking probability. This policy separates the allocation of disjoint and non-disjoint connections...
Vehicular communication systems have significant benefits. Their adoption and use in motor vehicles can help prevent road traffic accidents, increase route efficiency and fuel economy, and positively impact the user experience. As autonomous vehicles and inter-vehicular communication systems are becoming increasingly commonplace, the need for robust and secure wireless communication between vehicles...
Benefit from the caching hits on the routers along the request routing path, in-network caching plays an important role in diminishing the distance between the consumers and their desired contents. A content caching model is proposed to intuitively analyze the small world characteristics of in-network caching in information centric networks. A directed long edge from a caching node to the provider...
Vehicular Delay Tolerant Networks (VDTNs) routing protocols is a hot research topic in the global context of Intelligent Transport Systems (ITS). To cope with the intermittent connectivity of vehicular communications, numerous protocols based on Store Carry and Forward (SCF) paradigm were designed, ranging from an adaptation of generic Delay Tolerant Networks (DTNs) to those specifically dedicated...
To realize information system for reducing the traffic congestion, it is important to analyze the relationship between traffic congestion and route choice decision of each mobile object. In this paper, we show the characteristics of density clusters including percolation threshold in connection with route choice decision from analysis of simulation results on 100 × 100 non-diluted periodical square...
We investigate the impact of an unevenly distributed load among nodes of a distributed key-value store on response times. We find that response times of “get” operations quickly degrade in the presence of power law distributions of load and identify the point, at which the system needs to apply a mitigation approach. The migration technique, which we propose, overcomes the long response times of consistent...
Because of the feature of hybrid wireless mesh network, hybrid routing protocol is the most proper routing protocol for this kind of network. Hybrid routing protocol is composed of proactive routing protocol and reactive routing protocol. The proactive one is adaptive for static mesh routers, and the reactive one is suitable for mobile mesh clients. Existing hybrid routing protocols all neglect the...
Geometry-based localization algorithms come to the forefront with its unique superiority. This paper proposes a Delaunay triangulation based localization scheme (DBLS), which takes use of received signal strength indicator(RSSI) from anchor nodes. Based on RSSI, the Delaunay area is generated. The unknown node determines which Delaunay area it belongs to and then record it down. After several iteration,...
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...
The Prophet routing algorithm is a multi-copy algorithm which is based on historical information and transitive probability, which selects the relay node with a high probability to encounter the destination node. However, the selection of a relay node does not consider the current congestion level of node. Even if the current relay node has a high delivery probability to the destination node, it may...
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.