Sciweavers

290 search results - page 28 / 58
» Network as a Computer: Ranking Paths to Find Flows
Sort
View
HICSS
2005
IEEE
130views Biometrics» more  HICSS 2005»
15 years 3 months ago
Knowledge Flow in Interdisciplinary Teams
Knowledge flow in interdisciplinary teams has become of particular interest as research and alliances cross traditional disciplinary boundaries, and as computing is applied in any...
Caroline Haythornthwaite
JCM
2007
131views more  JCM 2007»
14 years 9 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
CCR
2002
62views more  CCR 2002»
14 years 9 months ago
An enforced inter-admission delay performance-driven connection admission control algorithm
Connection Admission Control (CAC) is an important function in a computer network that supports Quality of Service (QoS). The function of CAC is to decide whether a new connection...
Stanislav Belenki
MOBIHOC
2006
ACM
15 years 9 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
SIGCOMM
2005
ACM
15 years 3 months ago
Implications of autonomy for the expressiveness of policy routing
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, a...
Nick Feamster, Ramesh Johari, Hari Balakrishnan