Sciweavers

2076 search results - page 218 / 416
» Universal Routing in Distributed Networks
Sort
View
TOMACS
2010
182views more  TOMACS 2010»
15 years 2 months ago
State-dependent importance sampling for a Jackson tandem network
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estimating the probability of overflow in the downstream queue of a Jacksonian two-n...
Denis I. Miretskiy, Werner R. W. Scheinhardt, Mich...
IJON
2007
184views more  IJON 2007»
15 years 3 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
ICC
2008
IEEE
15 years 10 months ago
Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
Ji Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe...
TRIDENTCOM
2010
IEEE
15 years 1 months ago
Multi-hop Wireless Network Emulation on StarBED
Abstract. In this paper, we present an architecture to emulate multihop wireless networks on StarBED, a wired-network testbed at Hokuriku Research Center of NICT, Japan. The archit...
Lan Tien Nguyen, Razvan Beuran, Yoichi Shinoda
INFOCOM
2007
IEEE
15 years 10 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford