相关论文: Heavy traffic analysis of open processing networks…

We consider a stochastic control model driven by a fractional Brownian motion. This model is a formal approximation to a queueing network with an on-off input process. We study stochastic control problems associated with the long-run…

The effectiveness of many optimal network control algorithms (e.g., BackPressure) relies on the premise that all of the nodes are fully controllable. However, these algorithms may yield poor performance in a partially-controllable network…

This paper presents resource management techniques for allocating communication and computational resources in a distributed stream processing platform. The platform is designed to exploit the synergy of two classes of network connections…

Stochastic Processing Networks (SPNs) can be used to model communication networks, manufacturing systems, service systems, etc. We consider a real-time SPN where tasks generate jobs with strict deadlines according to their traffic patterns.…

This paper considers the problem of throughput optimal routing/scheduling in a multi-hop constrained queueing network with random connectivity whose special case includes opportunistic multi-hop wireless networks and input-queued switch…

Finite-time optimal feedback control for flow networks under information constraints is studied. By utilizing the framework of multi-parametric linear programming, it is demonstrated that when cost/constraints can be modeled or approximated…

We consider a discrete-time bipartite matching model with random arrivals of units of supply and demand that can wait in queues located at the nodes in the network. A control policy determines which are matched at each time. The focus is on…

Navigation in complex and noisy environments is a key issue in diverse fields from biology to engineering. Despite extensive progress in numerical optimization methods for computing navigation policies, insights into how disorder reshapes…

We present a fluid-dynamic model for the simulation of urban traffic networks with road sections of different lengths and capacities. The model allows one to efficiently simulate the transitions between free and congested traffic, taking…

In this paper, we consider stochastic clearing systems with multiple drifted Brownian motion inputs. First, we propose an instantaneous rate policy, which is shown to be the optimal one among a large class of renewal type clearing policies…

This paper presents a unified framework for analyzing the input-output behavior of discrete time complex networks viewed as open systems. Importantly, we focus on systems that are inherently modeled in discrete time-such as opinion…

Competitive analysis of online algorithms has commonly been applied to understand the behaviour of real-time systems during overload conditions. While competitive analysis provides insight into the behaviour of certain algorithms, it is…

Supporting the quality of service of unlicensed users in cognitive radio networks is very challenging, mainly due to dynamic resource availability because of the licensed users' activities. In this paper, we study the optimal admission…

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there…

We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…

We study a robust control problem for dynamical flow networks. In the considered dynamical models, traffic flows along the links of a transportation network --modeled as a capacited multigraph-- and queues up at the nodes, whereby control…

We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the underlay characteristics. We pose the…

We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…

In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer,…

We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes carrying copies of the packets obeys a linear dynamics. We…