Sciweavers

422 search results - page 80 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
SECON
2007
IEEE
14 years 2 months ago
The Optimum Number of OSPF Areas for MANETs
—Mobile ad hoc networks (MANETs) are a critical technology in filling the gap where the network infrastructure is insufficient or does not exist at all. The dynamic topology of...
Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores,...
MOBICOM
2006
ACM
14 years 2 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
NETGAMES
2006
ACM
14 years 2 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
PODC
2003
ACM
14 years 1 months ago
Scaling properties of 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...
WG
1998
Springer
14 years 23 days ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano