<--- Back to Details
First PageDocument Content
Fiber-optic communications / Optical burst switching / Max-min fairness / Fairness measure / Request for proposal / Burst switching / Computing / Routing algorithms / Scheduling algorithms / Business
Date: 2009-12-01 21:26:02
Fiber-optic communications
Optical burst switching
Max-min fairness
Fairness measure
Request for proposal
Burst switching
Computing
Routing algorithms
Scheduling algorithms
Business

FAIRNESS PROVISIONING IN OPTICAL BURST SWITCHING NETWORKS Tananun Orawiwattanakul

Add to Reading List

Source URL: www.nii.ac.jp

Download Document from Source Website

File Size: 63,29 KB

Share Document on Facebook

Similar Documents

1  Max-min Fairness inMesh Networks Douglas J. Leith, Qizhi Cao, Vijay G. Subramanian Hamilton Institute, NUI Maynooth

1 Max-min Fairness inMesh Networks Douglas J. Leith, Qizhi Cao, Vijay G. Subramanian Hamilton Institute, NUI Maynooth

DocID: 1t4Eu - View Document

Principles of resource allocation in networks Devavrat Shah (MIT) and Damon Wischik (UCL) ABSTRACT  Step 1: identify the feasible region.

Principles of resource allocation in networks Devavrat Shah (MIT) and Damon Wischik (UCL) ABSTRACT Step 1: identify the feasible region.

DocID: 1oKbr - View Document

PDF Document

DocID: 1msSL - View Document

Multi-Resource Allocation: Fairness-Efficiency Tradeoffs in a Unifying Framework Carlee Joe-Wong∗ , Soumya Sen∗ , Tian Lan† , Mung Chiang∗ ∗ Department  † Department

Multi-Resource Allocation: Fairness-Efficiency Tradeoffs in a Unifying Framework Carlee Joe-Wong∗ , Soumya Sen∗ , Tian Lan† , Mung Chiang∗ ∗ Department † Department

DocID: 1l49J - View Document

On Allocations that Maximize Fairness Uriel Feige∗ Abstract We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n

On Allocations that Maximize Fairness Uriel Feige∗ Abstract We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n

DocID: 1by2S - View Document