Congestion allocation for distributed networks: an experimental study

Content Provider	Semantic Scholar
Author	Chen, Yan Razzolini, Laura Turocy, Theodore L.
Copyright Year	2007
Abstract	This paper reports an experimental study of two prominent congestion and cost allocation mechanisms for distributed networks. We study the fair queuing (or serial) and the FIFO (or average cost pricing) mechanisms under two different treatments: a complete information treatment and a limited information treatment designed to simulate distributed networks. Experimental results show that the fair queuing mechanism performs significantly better than FIFO in all treatments in terms of efficiency, predictability measured as frequency of equilibrium play, and the speed of convergence to equilibrium.
Starting Page	121
Ending Page	143
Page Count	23
File Format	PDF HTM / HTML
DOI	10.1007/s00199-007-0213-z
Alternate Webpage(s)	https://page-one.springer.com/pdf/preview/10.1007/s00199-007-0213-z
Alternate Webpage(s)	http://www.si.umich.edu/~yanchen/published/Chen_Razzolini_Turocy_ET_2007.pdf
Alternate Webpage(s)	http://yanchen.people.si.umich.edu/published/Chen_Razzolini_Turocy_ET_2007.pdf
Alternate Webpage(s)	http://yanchen.people.si.umich.edu/papers/chen_raz_20050901.pdf
Alternate Webpage(s)	http://www.people.vcu.edu/~lrazzolini/chen_razzolini_srl.pdf
Alternate Webpage(s)	https://doi.org/10.1007/s00199-007-0213-z
Volume Number	33
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article