Sciweavers

605 search results - page 88 / 121
» Reducing complexity in tree-like computer interconnection ne...
Sort
View
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 2 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICT
2004
Springer
128views Communications» more  ICT 2004»
14 years 2 months ago
SRBQ and RSVPRAgg: A Comparative Study
Abstract This paper presents a comparative evaluation of the Scalable ReservationBased QoS (SRBQ) and the RSVP Reservation Aggregation (RSVPRAgg) architectures, both designed to pr...
Rui Prior, Susana Sargento, Pedro Brandão, ...
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 8 months ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar
ICNP
2006
IEEE
14 years 2 months ago
Robust Path-Vector Routing Despite Inconsistent Route Preferences
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
Aaron D. Jaggard, Vijay Ramachandran
IEEEPACT
2005
IEEE
14 years 2 months ago
A Distributed Control Path Architecture for VLIW Processors
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
Hongtao Zhong, Kevin Fan, Scott A. Mahlke, Michael...