default search action
1st NET-COOP 2007: Avignon, France
- Tijani Chahed, Bruno Tuffin:
Network Control and Optimization, First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007, Proceedings. Lecture Notes in Computer Science 4465, Springer 2007, ISBN 978-3-540-72708-8 - Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
A Jamming Game in Wireless Networks with Transmission Cost. 1-12 - Giovanni Neglia, Giuseppe Lo Presti, Honggang Zhang, Donald F. Towsley:
A Network Formation Game Approach to Study BitTorrent Tit-for-Tat. 13-22 - Ishai Menache, Nahum Shimkin:
Fixed-Rate Equilibrium in Wireless Collision Channels. 23-32 - Nahum Shimkin:
A Survey of Uniqueness Results for Selfish Routing. 33-42 - Rade Stanojevic, Robert Shorten:
Beyond CHOKe: Stateless Fair Queueing. 43-53 - Rade Stanojevic, Robert Shorten:
How Expensive Is Link Utilization? 54-64 - Kyungmo Koo, Joon-Young Choi, Jin Soo Lee:
Two Different Models of FAST TCP and Their Stable and Efficient Modification. 65-73 - Richard Marquez, Isbel González, Niliana Carrero, Yuri Sulbarán:
Revisiting Adaptive RED: Beyond AIMD Algorithms. 74-83 - Peng Wang, Stephan Bohacek:
The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization. 84-94 - Peter Clifford, Douglas J. Leith:
Channel Dependent Interference and Decentralized Colouring. 95-104 - Sondes Khemiri, Khaled Boussetta, Nadjib Achir, Guy Pujolle:
Optimal Call Admission Control for an IEEE 802.16 Wireless Metropolitan Area Network. 105-114 - Saswati Sarkar:
A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks. 115-119 - Jens Winter:
Finite Horizon Control Problems Under Partial Information. 120-128 - Lasse Leskelä, Jacques Resing:
A Tandem Queueing Network with Feedback Admission Control. 129-137 - José Niño-Mora:
Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging. 138-149 - Vivek S. Borkar:
Some Examples of Stochastic Approximation in Communications. 150-157 - Marc Wennink, Phil Williams, Nigel G. Walker, Ben Strulo:
Optimisation-Based Overload Control. 158-167 - Ben Strulo, Nigel G. Walker, Marc Wennink:
Lyapunov Convergence for Lagrangian Models of Network Control. 168-177 - Yiming Zhang, Dongsheng Li, Rui Chu, Xicheng Lu:
NCRS: A Network RAM-Based Computational Resource Sharing Grid. 178-184 - Wouter Rogiest, Dieter Fiems, Koenraad Laevens, Herwig Bruneel:
Tracing an Optical Buffer's Performance: An Effective Approach. 185-194 - Mats Petter Pettersson, Krzysztof Kuchcinski:
A New Necessary Condition for Shortest Path Routing. 195-204 - Enrique Mallada, Fernando Paganini:
Optimal Congestion Control with Multipath Routing Using TCP-FAST and a Variant of RIP. 205-214 - Vandy Berten, Bruno Gaujal:
Grid Brokering for Batch Allocation Using Indexes. 215-225 - Gilles Brunet, Fariba Heidari, Lorne Mason:
Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions. 226-235 - Soheil Saberi, Roland P. Malhamé, Lorne Mason:
Pricing for QoS Provisioning Across Multiple Internet Service Provider Domains. 236-246 - Fernando Ordóñez, Nicolás E. Stier Moses:
Robust Wardrop Equilibrium. 247-256 - Yezekael Hayel:
Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing. 257-265 - Dominique Barth, Johanne Cohen, Loubna Echabbi, Chahinez Hamlaoui:
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach. 266-275 - Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Cost Minimisation in Multi-interface Networks. 276-285 - Attila Vidács, Jorma T. Virtamo:
Minimum Transmission Energy Trajectories for a Linear Pursuit Problem. 286-295 - Jung-Ryun Lee:
A Hybrid Energy Saving Mechanism for VoIP Traffic with Silence Suppression. 296-304
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.