Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications by: Vladimir Marbukh (Fed)

Displaying 51 - 75 of 84

Self-Deployment Algorithms for Coverage Problem in a Network of Mobile Sensors with Unidentical Sensing Range

December 6, 2009

Author(s)

Vladimir V. Marbukh, Kamran Sayrafian, Hamid Mahboubi, Kaveh Moezzi, Amir G. Aghdam

In this paper, efficient sensor deployment algorithms are proposed to improve the coverage area in the target field. The proposed algorithms calculate the position of the sensors iteratively based on the existing coverage holes in the target field. The

Measuring the Utility/Path Diversity Tradeoff in Multipath Protocols

October 20, 2009

Author(s)

Fern Y. Hunt, Vladimir V. Marbukh

We derive a model of congestion control where the trade-off between utility and path diversity can be investigated. In a network where there can be multiple routes between locations, each source is assigned a route according to a random allocation scheme

Mobile Sensor Networks Self-organization for System Utility Maximization: Work in Progress

August 23, 2009

Author(s)

Vladimir V. Marbukh, Kamran Sayrafian

This paper reports on work in progress on mobile sensor network self-organization for system utility maximization with system utility being the difference between the aggregate utility of sensor information and penalty associated with sensor battery energy

From Network Microeconomics to Network Infrastructure Emergence

April 24, 2009

Author(s)

Vladimir V. Marbukh

This paper suggests that evolutionary models of network infrastructure in market economy can be derived from the underlying selfish behavior of users and providers of network services in the same way as non-equilibrium thermodynamics is derived from the

A Framework for Joint Cross-Layer and Node Location Optimization in Mobile Sensor Networks

September 10, 2008

Author(s)

Vladimir V. Marbukh, Kamran Sayrafian

This paper proposes an extension to Network Utility Maximization (NUM) framework, referred to as L-NUM (Location-aware NUM). This framework is intended to characterize both, the amount of the received sensor information and the network ability to deliver

Toward Understanding of Metastability in Large-Scale Loss Networks with Mobile Users: Emergence and Implications for Performance

July 28, 2008

Author(s)

Vladimir V. Marbukh, Daniel I. Genin

We investigate the behavior of a distributed server loss network with mobile users.While the Markov model provides an accurate ¿microscopic¿ model of the network behavior, the dimension of this model grows exponentially with the number of nodes precluding

Dynamic Routing and Congestion Control Through Random Assignment of Routes

July 15, 2008

Author(s)

Fern Y. Hunt, Vladimir V. Marbukh

We introduce an algorithm for maximizing utility through congestion control and random allocation of routes to users. The allocation is defined by a probability distribution whose degree of randomness as measured by its entropy, is controlled. We seek to

Can TCP Metastability Explain Cascading Failures and Justify Flow Admission Control in the Internet?

June 2, 2008

Author(s)

Vladimir V. Marbukh

This paper discusses implications of possible metastability of TCP-type fair bandwidth sharing under random flow arrivals/departures for understanding and defending the Internet against cascading failures. Cascading failures can be viewed as a process of

On Maximizing Provider Revenue in Market-based Compute Grids

April 17, 2008

Author(s)

Vladimir V. Marbukh, Kevin L. Mills

Market-based compute grids encompass service providers offering limited resources to potential users with varying demands and willingness to pay. Providers face difficult decisions about which jobs to admit and when to schedule admitted jobs. For this

Fair Bandwidth Sharing under Random Flow Arrivals/Departures: Metastability & Flow Admission Control

September 30, 2007

Author(s)

Vladimir V. Marbukh

Flow-level performance of fair bandwidth sharing protocols under random flow arrivals/departures is not sufficiently understood due to intractability of the corresponding Markov model for realistic-size networks. Tractability of the Markov model in fluid

Metastability of Fair Bandwidth Sharing Under Fluctuating Demand and Necessity of Flow Admission control

September 17, 2007

Author(s)

Vladimir V. Marbukh

A flow-level Markov model for fair bandwidth sharing with packet retransmissions under random flow arrivals/departures is proposed and discussed. Fluctuations in the numbers of flows in progress cause the network instability even under light load. The

Fair Bandwidth Sharing Under Flow Arrivals/Departures: Effect of Retransmissions on Stability and Performance

September 1, 2007

Author(s)

Vladimir V. Marbukh

A flow-level Markov model for fair bandwidth sharing with packet retransmissions and random flow arrivals/departures is proposed. The model accounts for retransmissions by assuming that file transfer rates are determined by the end-to-end goodputs rather

Towards Understanding Complex Communication Networks: Performance, Phase Transitions and Control

June 13, 2007

Author(s)

Vladimir V. Marbukh

Micro dynamics of large-scale communication networks is often described by a Markov process with a large number of locally interacting components. Due to astronomically high number of the Markov process states even for moderate-size networks, finding the

Demand Pricing & Resource Allocation in Market-based Compute Grids: A Model and Initial Results

April 13, 2007

Author(s)

Vladimir V. Marbukh, Kevin L. Mills

Market-based compute grids encompass service providers offering limited resources to potential users with varying quality of service demands and willingness to pay. Providers face problems of pricing and allocating resources to maximize revenue. Previous

Towards Cooperative Power and QoS Aware Wireless Network: A Case of On-Line Scheduling in a Multiaccess System

November 30, 2006

Author(s)

Vladimir V. Marbukh, Anastase Nakassis

The paper itself is an extended abstract to be published in an augmented form capturing relevant Workshop discussions.

Intelligent Plane as a Mapping Mechanism for User Level Performance Optimization: A Case of Reliable Services over Unreliable Network

July 28, 2006

Author(s)

Vladimir V. Marbukh

This paper proposes a framework for balancing competing user level requirements by resolving the corresponding trade-offs in a distributed system with limited resources. Assuming that each user's preferences can be characterized by some utility function

Intelligent Plane as a Mapping Mechanism for User Level Performance Optimization: A Case of Reliable Services Over Unreliable Network

July 28, 2005

Author(s)

Vladimir V. Marbukh

On Aggregate Utility Maximization by Greedy ASs Competing to Provide Internet Services

September 29, 2004

Author(s)

Vladimir V. Marbukh, R E. Van Dyck

We consider the effect of competition between N greedy autonomous systems (ASs) on pricing and availability ofInternet services to elastic users. The problem is formalized as a non-cooperative game, where the autonomous systems attempt to maximize their

On the Effect of Limited Competition Between Greedy ASs on Internet Services

June 28, 2004

Author(s)

Vladimir V. Marbukh, R E. Van Dyck

Towards Self Managing Distributed Systems Capable of Resolving Trade-Offs Among Competing Performance Criteria

June 12, 2004

Author(s)

Vladimir V. Marbukh

Since typically network performance is characterized by multiple competing criteria, the network management requires resolving the corresponding trade-offs. The problems include finding the Pareto optimal frontier in space of these criteria and selecting