Sciweavers

5079 search results - page 715 / 1016
» Hidden-Action in Network Routing
Sort
View
SIROCCO
2007
15 years 8 months ago
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions
Abstract. The problem we consider originates from the design of efficient on-board networks in satellites (also called Traveling Wave Tube Amplifiers). Signals incoming in the net...
Jean-Claude Bermond, Frédéric Giroir...
JVM
2004
133views Education» more  JVM 2004»
15 years 8 months ago
Towards Virtual Networks for Virtual Machine Grid Computing
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
Ananth I. Sundararaj, Peter A. Dinda
CN
2006
174views more  CN 2006»
15 years 6 months ago
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
Today's wireless networks are characterized by a fixed spectrum assignment policy. However, a large portion of the assigned spectrum is used sporadically and geographical var...
Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, Sh...
PERCOM
2006
ACM
15 years 6 months ago
Bootstrapping Chord in Ad Hoc Networks: Not Going Anywhere for a While.
With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. ...
Curt Cramer, Thomas Fuhrmann
SPAA
1999
ACM
15 years 11 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...