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.
DHT-based P2P networks have a problem of topology mismatch which causes high latency for message routing. This paper focuses on improving the latency of routing process for chord, which is a typical DHT-based P2P network protocol. We propose a simple method to build a chord network based on the proximity of nodes in the underlying physical network. The idea of our method is the combination of two...
InfiniBand networks are aimed to fulfill increasing communication demand of parallel applications in high performance clusters. However, the dynamic behavior of communication load may cause bottlenecked link(s) which lead to message congestion. Congestion spreading increases latency and reduces network throughput causing important performance degradation. In this paper, we propose a congestion control...
Current Network-on-Chip (NoC) architectures sometimes employ mesh or torus topology with the dimension-order routing. In this paper, we propose a deadlock-free routing algorithm, referred to as Balanced Dimension-Order Routing (BDOR), which provides the balanced minimal paths to each destination based on the simple routing regulations. Since the BDOR has the similar path regularity to that of the...
D-meshes belong to an extended family of regular two-dimensional meshes of an arbitrary degree d. They have shorter maximal and average node-to-node distances than most other interconnection networks. Competitive congestion-free routing algorithms for all-to-all communication can be implemented on d-meshes. Additional nodes can be added to the system with no changes on most of existing nodes and with...
A fast rerouting scheme is proposed to guarantee the QoS performance of rerouted path when handling link and node failures. The new scheme is based on deflection routing mechanism and improves on two aspects: first, it can promptly handle single node failure as well as single link failure, second, QoS metric is taken into accounted when calculating recovery routes. Simulation results show that the...
This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed...
A significant drive to consolidate data center networks on a single infrastructure is taking place. 10-Gigabit Ethernet is one of the contenders to fulfill the role of universal data center interconnect. One of the key features missing from conventional Ethernet is congestion management; this void is being filled by the standardization work of the IEEE 802.1Qau working group. However, the schemes...
We envision an information-centric future Internet where the network is built around named pieces of data instead of explicitly addressable hosts. One clear way of implementing information-centric networking is using publish and subscribe (pub/sub) operations instead of the send and receive primitives. Internet-like pub/sub networking requires completely different routing protocols and forwarding...
The power consumption of interconnects is increased as the link bandwidth is improved in PC clusters. In this paper, we propose an on/off link activation method that uses the static analysis of the traffic in order to reduce the power consumption of Ethernet switches while maintaining the performance of PC clusters. When a link whose utilization is low is deactivated, the proposed method renews the...
In modern system-on-chips the communication architecture is a crucial part of the design for performances and power constraints because the number of modules is increasing due to continuous integration scale. Network-on-Chip (NoC) architecture lets to obtain greater performances over the traditional communication architectures. NoC design is more complex because there are more components and networks...
Burst contention is a well-known challenging problem in optical burst switching (OBS) networks. Deflection routing is used to resolve contention. Burst retransmission is used to reduce the burst loss ratio (BLR) by retransmitting dropped bursts. Previous works show that combining deflection and retransmission outperforms both pure deflection and pure retransmission approaches. This paper proposes...
We present a MIP formulation and an efficient heuristic for the problem of logical topology design for a distributed computing application to survive one computing cluster failure and one fiber link failure in WDM networks.
NoC is a potent solution to address design complexity and productivity problems whose its key component is the interconnect architecture which directly affects both cost and performance parameters. The purpose of this paper is to present the basic ideas behind the development of our new hierarchical network-on-chip (NoC) architecture, called ldquoNormardquo that its most distinguished characteristic...
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging...
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.