Results 1 - 10 of 3,338

Reliable Asymmetric Path Capacity Measurement

by Edmond W. W. Chan, Xiapu Luo, Rocky K. C. Chang
"... Existing non-cooperative methods for network capacity measurement are quite restrictive for capacity-asymmetric paths, and their results could be affected by adverse network conditions (e.g., packet delay, packet loss, and packet reordering). In this paper, we propose to use two types of packet pair ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Existing non-cooperative methods for network capacity measurement are quite restrictive for capacity-asymmetric paths, and their results could be affected by adverse network conditions (e.g., packet delay, packet loss, and packet reordering). In this paper, we propose to use two types of packet

Receiver-Based Path Capacity Estimation for TCP

by Christoph Barz, Matthias Frank, Peter Martini, Markus Pilz - In Proceedings of KIVS'05 , 2005
"... Abstract: This paper presents a new TCP-based packet pair measurement approach for network path capacity estimation. It addresses some drawbacks other approaches still bear. In contrast to these, our approach uses an unmodified TCP sender and utilizes techniques to identify probing packets that were ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract: This paper presents a new TCP-based packet pair measurement approach for network path capacity estimation. It addresses some drawbacks other approaches still bear. In contrast to these, our approach uses an unmodified TCP sender and utilizes techniques to identify probing packets

Theoretical improvements in algorithmic efficiency for network flow problems

by Jack Edmonds, Richard M. Karp - , 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract - Cited by 560 (0 self) - Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the Ford-Fulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties

On limits of wireless communications in a fading environment when using multiple antennas

by G. J. Foschini, M. J. Gans - Wireless Personal Communications , 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (M ..."
Abstract - Cited by 2426 (14 self) - Add to MetaCart
the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver. We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared

AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks

by Ling-Jyh Chen Tony, Tony Sun, Guang Yang, M. Y. Sanadidi, Mario Gerla
"... Abstract - Knowledge of end-to-end path capacity is useful for video/audio stream adaptation, rate control and overlay design. Capacity estimation in wired and last-hop wireless networks has been extensively investigated, but an in-depth study of path capacity in ad hoc, multihop wireless networks i ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
Abstract - Knowledge of end-to-end path capacity is useful for video/audio stream adaptation, rate control and overlay design. Capacity estimation in wired and last-hop wireless networks has been extensively investigated, but an in-depth study of path capacity in ad hoc, multihop wireless networks

A Decentralized Model for Virtual Path Capacity Allocation

by unknown authors
"... Abstract—We investigate the problem of Virtual Path (VP) capacity allocation in a decentralized way. Users (VP controllers), sharing common network resources, are assumed to control their VP capacities according to their performance measures. We formulate a model that differs from previous ones in t ..."
Abstract - Add to MetaCart
Abstract—We investigate the problem of Virtual Path (VP) capacity allocation in a decentralized way. Users (VP controllers), sharing common network resources, are assumed to control their VP capacities according to their performance measures. We formulate a model that differs from previous ones

SenProbe: Path Capacity Estimation in Wireless Sensor Networks +

by Tony Sun, Ling-jyh Chen, Guang Yang, M. Y. Sanadidi, Mario Gerla
"... Abstract + The infusion of mobile computing elements (e.g. data mules, mobile actuators/sinks and etc.) into Wireless Sensor Networks undoubtedly requires the knowledge of various wireless network properties to fasten their interactivity. Moreover, since the rate of a wireless link can vary dynamica ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
dynamically and rapidly due to changes in interference, distance, or energy optimization policy, timely knowledge of the end-to-end path capacity in WSN can be of great assistance to more efficient routing and traffic management. Particularly, information on end-to-end path capacity can be used to assess

VL2: Scalable and Flexible Data Center Network”,

by Albert Greenberg , James R Hamilton , Navendu Jain , Srikanth Kandula , Changhoon Kim , Parantap Lahiri , David A Maltz , Parveen Patel , Sudipta Sengupta - ACM SIGCOMM Computer Communication Review, , 2009
"... Abstract To be agile and cost e ective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL, a practical network architecture that scales t ..."
Abstract - Cited by 461 (12 self) - Add to MetaCart
to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer- semantics. VL uses () at addressing to allow service instances to be placed anywhere in the network, () Valiant Load Balancing to spread tra c uniformly across network

End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput

by Manish Jain, Constantinos Dovrolis - In Proceedings of ACM SIGCOMM , 2002
"... The available bandwidth (avail-bw) in a network path is of major importance in congestion control, streaming applications, QoS verification, server selection, and overlay networks. We describe an end-to-end methodology, called Self-Loading Periodic Streams (SLoPS), for measuring avail-bw. The basic ..."
Abstract - Cited by 414 (20 self) - Add to MetaCart
in heavily utilized paths, as well as in paths with limited capacity (probably due to a lower degree of statistical multiplexing). We finally examine the relation between avail-bw and TCP throughput. A persistent TCP connection can be used to roughly measure the avail-bw in a path, but TCP saturates the path

On the capacity of MIMO broadcast channel with partial side information

by Masoud Sharif, Babak Hassibi - IEEE TRANS. INFORM. THEORY , 2005
"... In multiple-antenna broadcast channels, unlike point-to-point multiple-antenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and single-antenna users, the ..."
Abstract - Cited by 349 (9 self) - Add to MetaCart
In multiple-antenna broadcast channels, unlike point-to-point multiple-antenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and single-antenna users
Results 1 - 10 of 3,338