Sciweavers

366 search results - page 6 / 74
» A new model for selfish routing
Sort
View
DAC
2006
ACM
15 years 3 months ago
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
Ming Li, Qing-An Zeng, Wen-Ben Jone
INFOCOM
1999
IEEE
15 years 1 months ago
New Dynamic SPT Algorithm Based on a Ball-and-String Model
A key functionality in today's widely used interior gateway routing protocols such as OSPF and IS
Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng
PADS
2003
ACM
15 years 2 months ago
Reducing the Size of Routing Tables for Large-scale Network Simulation
In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted....
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
ICON
2007
IEEE
15 years 3 months ago
TEAM: Trust Enhanced Security Architecture for Mobile Ad-hoc Networks
— Security is paramount in Mobile Ad-hoc Networks (MANET) as they are not conducive to centralized trusted authorities. Several solutions have been proposed MANET in the areas of...
Venkatesan Balakrishnan, Vijay Varadharajan, Udaya...
INFOCOM
2006
IEEE
15 years 3 months ago
Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks
— Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing strategy p...
Vincent Lenders, Martin May, Bernhard Plattner