This paper presents and experimentally demonstrates the generalized architecture of Openflow-controlled optical packet switching (OPS) network. Openflow control is enabled by introducing the Openflow/OPS agent into th...
详细信息
This paper presents and experimentally demonstrates the generalized architecture of Openflow-controlled optical packet switching (OPS) network. Openflow control is enabled by introducing the Openflow/OPS agent into the OPS network, which realizes the Openflow protocol translation and message exchange between the Openflow control plane and the underlying OPS nodes. With software-defined networking (SDN) and Openflow technique, the complex control functions of the conventional OPS network can be offloaded into a centralized and flexible control plane, while promoted control and operations can be provided due to centralized coordination of network resources. Furthermore, a contention-aware routing/rerouting strategy as well as a fast network adjustment mechanism is proposed and demonstrated for the first time as advanced Openflow control to route traffic and handle the network dynamics. With centralized SDN/Openflow control, the OPS network has the potential to have better resource utilization and enhanced network resilience at lower cost and less node complexity. Our work will accelerate the development of both OPS and SDN evolution.
Based on directional diffusion algorithm, this paper proposes a novel cooperative wake-up routing algorithm (CWR algorithm) for wake-up mechanism in heterogeneous sensor networks. We substitute a high-cost node with t...
详细信息
Based on directional diffusion algorithm, this paper proposes a novel cooperative wake-up routing algorithm (CWR algorithm) for wake-up mechanism in heterogeneous sensor networks. We substitute a high-cost node with the nearest low-cost node, which launches multi-hop diffusion. In particular, we add two steps: routing displacement and routing repair to establish network topology between low-cost nodes and their corresponding high-cost nodes, thus provide a necessary network topology foundation for wake-up mechanism. Simulation results demonstrate that our CWR algorithm is energy-efficient during wake-up process.
The virtual coordinate-based geometric routing protocol is widely used in wireless sensor networks. In this paper Schnyder geometric routing algorithm based on coordinate-based geometric is researched and implemented....
详细信息
Global routing is a crucial step in VLSI physical design. To address the problems that the low utilization rate of capacity and easy to fall into local optimum in the existing global routing algorithms, a high-quality...
详细信息
Abstract The work presented addresses the case of connections in pipe networks for crude oil transportation, using pumps to overcome negative differences of pressure. The studied systems are operated by controlling va...
详细信息
Abstract The work presented addresses the case of connections in pipe networks for crude oil transportation, using pumps to overcome negative differences of pressure. The studied systems are operated by controlling valves and pumps, and can be modelled as discrete event systems. We use models based on undirected graphs. We present a path-search algorithm with obligatory pump nodes. This algorithm is meant to provide assistance to the operator of the pipe network SCADA. We tested the algorithms using data from real pipe networks located in Venezuela.
This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized Partially- Minimal (RPM) routing that provably achieves optimal worstcase throughput for 3D meshes when the network radix k...
详细信息
3D integration can greatly benefit future many-cores by enabling low-latency three-dimensional Network-on-Chip (3D-NoC) topologies. However, due to high cost, low yield, and frequent failures of Through-Silicon Via (T...
详细信息
3D integration can greatly benefit future many-cores by enabling low-latency three-dimensional Network-on-Chip (3D-NoC) topologies. However, due to high cost, low yield, and frequent failures of Through-Silicon Via (TSV), 3D-NoCs are most likely to include only a few vertical connections, resulting in incomplete topologies that pose new challenges in terms of deadlock-free routing and TSV assignment. The routers of such networks require a way to locate the nodes that have vertical connections, commonly known as elevators, and select one of them in order to be able to reach other layers when necessary. In this paper, several alternative TSV selection strategies requiring a constant amount of configurable bits per router are introduced. Each proposed solution consists of a configuration algorithm, which provides each router with the necessary information to locate the elevators, and a routing algorithm, which uses this information at runtime to route packets to an elevator. Our algorithms are compared by simulation to highlight the advantages and disadvantages of each solution under various scenarios, and hardware synthesis results demonstrate the scalability of the proposed approach and its suitability for cost-oriented designs.
Geographic routing is widely used in wireless sensor networks due to its great efficiency, low routing overhead and good scalability. However, the problem that most of the geographic routing algorithms which adopt gre...
详细信息
Geographic routing is widely used in wireless sensor networks due to its great efficiency, low routing overhead and good scalability. However, the problem that most of the geographic routing algorithms which adopt greedy algorithm as their basic routing strategies have to face is the 'routing void phenomena'. Aiming at this problem, this paper presents a new geographic routing algorithm, Greedy algorithm based on the geographic information of 2-hop neighbors (Greedy-2). Greedy-2 algorithm makes nodes be aware of the existence of voids before the packet reaches a region where the Greedy forwarding fails, so that the packet can bypass the dead-end node ahead of time to reduce the probability of encountering the routing voids. PATN, a Planarization Algorithm based on Two-hop Neighbors, is also introduced. PATN ensures the success of perimeter routing through the planarization without extra overhead, and guarantees delivery in UDG networks when Greedy-2 algorithm fails. Extensive simulation further shows that Greedy-2 algorithm can significantly decrease the routing void phenomena. It obtains better performance than Greedy algorithm based on 1-hop neighbors in aspects of the packet delivery rate and the length of routing path. GPSR-2, which combines Greedy-2 and PATN algorithms, has less average length of routing path than GPSR.
Optical wavelength converters are expensive, and their technology is stillevolving. Deploying full conversion capability in all nodes of a large opticalnetwork would be prohibitively costly. We present a new algorithm...
详细信息
Optical wavelength converters are expensive, and their technology is stillevolving. Deploying full conversion capability in all nodes of a large opticalnetwork would be prohibitively costly. We present a new algorithm for the sparseplacement of full wavelength converters based on the concept of a k-minimumdominating set (k-MDS) of graphs. The k-MDS algorithm is used to select the best setof nodes that will be equipped with full-conversion capability. To allow placementof full wavelength conversion at any arbitrary number of nodes, we introduce aHYBRID algorithm and compare its performance with the simulation-based k-BLKapproach. We also extend the k-MDS algorithm to the case of limited conversioncapability by using a scalable and cost-effective node-sharing switch *** with full search algorithms previously proposed in the literature ouralgorithm has better blocking performance, has better time complexity, and avoidsthe local minimum problem. The performance benefit of our algorithms is demonstratedby simulation.
暂无评论