Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
INFOCOM
1999
IEEE
favorite
Email
discuss
report
138
views
Communications
»
more
INFOCOM 1999
»
Bandwidth Sharing: Objectives and Algorithms
14 years 3 months ago
Download
perso.rd.francetelecom.fr
This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the so-called max
Laurent Massoulié, James Roberts
Real-time Traffic
Classical Fairness Notion
|
Communications
|
INFOCOM 1999
|
Proportional Fairness Criterion
|
So-called Maxmin Fairness
|
claim paper
Post Info
More Details (n/a)
Added
03 Aug 2010
Updated
03 Aug 2010
Type
Conference
Year
1999
Where
INFOCOM
Authors
Laurent Massoulié, James Roberts
Comments
(0)
Researcher Info
Communications Study Group
Computer Vision