Sciweavers

2808 search results - page 121 / 562
» Routing betweenness centrality
Sort
View
214
Voted
ICDCS
1998
IEEE
15 years 10 months ago
A Feedback Based Scheme for Improving TCP Performance in Ad-Hoc Wireless Networks
Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communication support facilities (such as base stations). The topo...
Kartik Chandran, Sudarshan Raghunathan, S. Venkate...
ICNP
1997
IEEE
15 years 9 months ago
On path selection for traffic with bandwidth guarantees
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
Qingming Ma, Peter Steenkiste
CCR
2004
86views more  CCR 2004»
15 years 6 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
ASUNAM
2009
IEEE
16 years 29 days ago
Social Network Discovery Based on Sensitivity Analysis
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
Tarik Crnovrsanin, Carlos D. Correa, Kwan-Liu Ma
COMCOM
2007
136views more  COMCOM 2007»
15 years 6 months ago
Demand-scalable geographic multicasting in wireless sensor networks
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
Shibo Wu, K. Selçuk Candan