Sciweavers

524 search results - page 104 / 105
» Characterizing the Paralation Model using Dynamic Assignment
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Runtime Support for Virtual BSP Computer
Abstract. Several computing environments including wide area networks and nondedicated networks of workstations are characterized by frequent unavailability of the participating ma...
Mohan V. Nibhanupudi, Boleslaw K. Szymanski
GLOBECOM
2009
IEEE
13 years 11 months ago
Optimal Resource Scheduling in Wireless Multiservice Systems with Random Channel Connectivity
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
Hussein Al-Zubaidy, Ioannis Lambadaris, Ioannis Vi...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Rethinking Information Theory for Mobile Ad Hoc Networks
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...
Jeffrey G. Andrews, Nihar Jindal, Martin Haenggi, ...
ANSS
2007
IEEE
14 years 1 months ago
Vehicular Mobility Simulation for VANETs
During the last few years, continuous progresses in wireless communications have opened new research fields in computer networking, aimed at extending data networks connectivity ...
Marco Fiore, Jérôme Härri, Fethi...
MOBICOM
2000
ACM
13 years 12 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson