Sciweavers

1689 search results - page 237 / 338
» Approximate zero-variance simulation
Sort
View
MOBIHOC
2007
ACM
15 years 9 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
INFOCOM
2009
IEEE
15 years 4 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
AMMA
2009
Springer
15 years 4 months ago
School Choice: The Case for the Boston Mechanism
I study school assignment problems, focusing on two popular mechanisms: the Boston Mechanism (BM) and Deferred Acceptance (DA). The former has been criticized regarding both e¢ c...
Antonio Miralles
NETCOOP
2009
Springer
15 years 4 months ago
Optimal File Splitting for Wireless Networks with Concurrent Access
The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a p...
Gerard Hoekstra, Rob van der Mei, Yoni Nazarathy, ...
INFOCOM
2008
IEEE
15 years 4 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel