Sciweavers

552 search results - page 53 / 111
» Routing complexity of faulty networks
Sort
View
ISCC
2002
IEEE
144views Communications» more  ISCC 2002»
14 years 18 days ago
A hierarchical distributed protocol for MPLS path creation
Network service provisioning involves the control of network resources through signaling, routing and management protocols that achieve Quality of Service and Traffic Engineering ...
Mohamed El-Darieby, Dorina C. Petriu, Jerry Rolia
SLIP
2003
ACM
14 years 28 days ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
SBACPAD
2007
IEEE
130views Hardware» more  SBACPAD 2007»
14 years 1 months ago
Design of a Feasible On-Chip Interconnection Network for a Chip Multiprocessor (CMP)
In this paper, an adaptive wormhole router for a flexible on-chip interconnection network is proposed and implemented for a Chip-Multi Processor (CMP). It adopts a wormhole switc...
Seung Eun Lee, Jun Ho Bahn, Nader Bagherzadeh
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 7 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen
INFOCOM
2010
IEEE
13 years 6 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li