The Price of Anarchy (POA) of network coding and routing based on average pricing mechanism

Details The Price of Anarchy (POA) of network coding and routing based on average pricing mechanism The Price of Anarchy (POA) of network coding and routing based on average pricing mechanism

2011-10-19

arxiv.org/abs/1110.4175v1

Computer Science

Networking and Internet Architecture

5 pages,3 figures,Submitted to ICC 2012

Scientific paper

The congestion pricing is an efficient allocation approach to mediate demand and supply of network resources. Different from the previous pricing using Affine Marginal Cost (AMC), we focus on studying the game between network coding and routing flows sharing a single link when users are price anticipating based on an Average Cost Sharing (ACS) pricing mechanism. We characterize the worst-case efficiency bounds of the game compared with the optimal, i.e., the price-of anarchy (POA), which can be low bound 50% with routing only. When both network coding and routing are applied, the POA can be as low as 4/9. Therefore, network coding cannot improve the POA significantly under the ACS. Moreover, for more efficient use of limited resources, it indicates the sharing users have a higher tendency to choose network coding.

Affiliated with

Also associated with

No associations

Rating

The Price of Anarchy (POA) of network coding and routing based on average pricing mechanism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Price of Anarchy (POA) of network coding and routing based on average pricing mechanism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Price of Anarchy (POA) of network coding and routing based on average pricing mechanism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-596847