Lecture Notes in Computer Science - Network Control and Optimization
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540727088, 9783540727095

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimal Congestion Control with Multipath Routing Using TCP-FAST and a Variant of RIP

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_22 ◽

2007 ◽

pp. 205-214 ◽

Cited By ~ 1

Author(s):

Enrique Mallada ◽

Fernando Paganini

Keyword(s):

Congestion Control ◽

Multipath Routing

Download Full-text

Some Examples of Stochastic Approximation in Communications

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_16 ◽

2007 ◽

pp. 150-157 ◽

Cited By ~ 1

Author(s):

Vivek S. Borkar

Keyword(s):

Stochastic Approximation

Download Full-text

A Survey of Uniqueness Results for Selfish Routing

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_4 ◽

2007 ◽

pp. 33-42 ◽

Cited By ~ 2

Author(s):

Nahum Shimkin

Keyword(s):

Selfish Routing ◽

Uniqueness Results

Download Full-text

Two Different Models of FAST TCP and Their Stable and Efficient Modification

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_7 ◽

2007 ◽

pp. 65-73 ◽

Cited By ~ 2

Author(s):

Kyungmo Koo ◽

Joon-Young Choi ◽

Jin S. Lee

Keyword(s):

Fast Tcp

Download Full-text

The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_9 ◽

2007 ◽

pp. 84-94

Author(s):

Peng Wang ◽

Stephan Bohacek

Keyword(s):

Mesh Network ◽

Computational Techniques ◽

Utility Optimization ◽

Network Utility ◽

Practical Performance ◽

Network Utility Optimization

Download Full-text

How Expensive Is Link Utilization?

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_6 ◽

2007 ◽

pp. 54-64 ◽

Cited By ~ 4

Author(s):

Rade Stanojević ◽

Robert Shorten

Keyword(s):

Link Utilization

Download Full-text

A Hybrid Energy Saving Mechanism for VoIP Traffic with Silence Suppression

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_31 ◽

2007 ◽

pp. 296-304 ◽

Cited By ~ 1

Author(s):

Jung-Ryun Lee

Keyword(s):

Energy Saving ◽

Hybrid Energy ◽

Silence Suppression

Download Full-text

Grid Brokering for Batch Allocation Using Indexes

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_23 ◽

2007 ◽

pp. 215-225

Author(s):

Vandy Berten ◽

Bruno Gaujal

Download Full-text

Revisiting Adaptive RED: Beyond AIMD Algorithms

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_8 ◽

2007 ◽

pp. 74-83 ◽

Cited By ~ 1

Author(s):

Richard Marquez ◽

Isbel González ◽

Niliana Carrero ◽

Yuri Sulbarán

Download Full-text

A New Necessary Condition for Shortest Path Routing

Lecture Notes in Computer Science - Network Control and Optimization ◽

10.1007/978-3-540-72709-5_21 ◽

2007 ◽

pp. 195-204

Author(s):

Mats Petter Pettersson ◽

Krzysztof Kuchcinski

Keyword(s):

Shortest Path ◽

Necessary Condition ◽

Shortest Path Routing

Download Full-text

Lecture Notes in Computer Science - Network Control and OptimizationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Optimal Congestion Control with Multipath Routing Using TCP-FAST and a Variant of RIP

Some Examples of Stochastic Approximation in Communications

A Survey of Uniqueness Results for Selfish Routing

Two Different Models of FAST TCP and Their Stable and Efficient Modification

The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization

How Expensive Is Link Utilization?

A Hybrid Energy Saving Mechanism for VoIP Traffic with Silence Suppression

Grid Brokering for Batch Allocation Using Indexes

Revisiting Adaptive RED: Beyond AIMD Algorithms

A New Necessary Condition for Shortest Path Routing

Lecture Notes in Computer Science - Network Control and Optimization
Latest Publications