|
Objective
|
|
Find paths for all potential incoming reqeusts with maximum user
satisfaction under resource constraints
|
|
User satisfaction is represented by the bandwidth/quality
requirement and the profit(price) associated with request
|
|
Solutions
|
|
NP hard problem
|
|
Need heuristic solutions
|
|
Approach 1: Greedy Algorithm: allocated by the order of unit profit
|
|
Approach 2: Integer Programming (Search)
|