How to Reinvent Network Services for All

다국어 초록 (Multilingual Abstract)

Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. For non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

목차 (Table of Contents)

• 1. Introduction
• 2. Description of the System-Before and After Prioritization
• 3. Fundamental Transition Theorems
• 4. The Model for the Transition Problem
• 5. Genetic Algorithm and Simulation Study
• 6. Concluding Remarks
• Reference

참고문헌 (Reference)

1 Dewan,S.and H.Mendelson,"User Delay Costs and Internal Pricing for a Service Facility."Management Science,Vol.36,No.12, "pp"

2 Naor, P., "The Regulation of Queueing Size by Levying Tolls" 37 (37): 15-24, 1969

3 Pigou, P., "The Economics of Welfare, Macmillan, First Edition, London, 1920"

4 Kleinrock, L, "Queueing Systems, Vol. II：Computer Applications, John Wiley and Sons, Inc., 1976"

5 Edel, R, "Providing Internet Access：What We Learn from INDEX" 13 (13): 18-25, 1999

6 Mitrani I., "Probabilistic Modelling" Cam-bridge University Press 1998

7 Cocchi, R., "Pricing in computer networks：Motivation, formulation, and example" 1 (1): 614-629, 1993

8 Mendelson, H., "Pricing Computer Services：Queueing Effects" 28 (28): 312-321, 1985

9 Kim Y, "Optimal incen-tive-compatible pricing for M/G/1 Qu-eues" 31 (31): 459-461, 2003

10 Mendelson, H, "Optimal Incentive-compatible Priority Pricing for the M/M/1?Queue" 38 (38): 870-883, 1990

11 Knudsen, N, "Individual and Social Opt-imization in Multiserver Queue with a General Cost-Benefit Structure" 40 (40): 515-528, 1972

12 Goldberg, D., "Genetic Algorithms in Search, Optimization, and Machine Learning, Addi-son-Wesley, Reading, MA, 1989"

13 Michalewicz, Z., "Genetic Algorithms + Data Structures = Evolution Programs, Springer- Verlag, Third Edition, Berlin, Germany, 1996"

14 Balachandran, K, "Extensions to class dominance characteristics" 40 (40): 353-360, 1994

15 Wilson, R., "Efficient and Competitive Ra-tioning" 57 (57): 1-40, 1989

16 Dovrolis, C, "A Case for Relative Differentiated Services and the Proportional Differentiation Model" 13 (13): 26-34, 1999

17 Laxton, Jr. W., ""The End of Net Neutrality," www.law.duke.edu/journals/dltr/articles/2006dltr0015.html"

18 Hahn R, ""The Economics of Net Neutrality," http://www.bepress.com /ev/vol3/iss6/art8/, 2006"

19 Kwak, J.H., ""On network neutrality issues in the US," http://www.kisdi.re.kr/imagedata/pdf/10/1020061003.pdf"