Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

How to Reinvent Network Services for All

상이한 네트워크 서비스 어떻게 향상시킬까?

  • 김용재 (건국대학교 경영정보학과) ;
  • 이석준 (건국대학교 경영정보학과) ;
  • 임재익 (아주대학교 경영대학)
  • Published : 2008.11.30
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. Balachandran, K. and S. Radhakrishnan, "Extensions to class dominance characteristics," Management Science, Vol.40, No.10 (1994), pp.353-360 https://doi.org/10.1287/mnsc.40.3.353
  2. Cocchi, R., D. Estrin, S. Shenker, and L. Zhang, "Pricing in computer networks: Motivation, formulation, and example," IEEE/ACM Transactions on. Networking, Vol.1, No.6(1993), pp.614-629 https://doi.org/10.1109/90.266050
  3. Dewan, S. and H. Mendelson, "User Delay Costs and Internal Pricing for a Service Facility." Management Science, Vol.36, No. 12(1990), pp.1502-17 https://doi.org/10.1287/mnsc.36.12.1502
  4. Dovrolis, C. and P. Ramanathan, "A Case for Relative Differentiated Services and the Proportional Differentiation Model," IEEE Network, Vol.13, No.5(1999), pp.26-34 https://doi.org/10.1109/65.793688
  5. Edel, R. and P. Varaiya, "Providing Internet Access:What We Learn from INDEX," IEEE Network, Vol.13, No.5(1999), pp.18-25
  6. Goldberg, D., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989
  7. Hahn R. and Wallsten S., "The Economics of Net Neutrality," http://www.bepress.com/ev/vol3/iss6/art8/, 2006
  8. Kim Y. and M. Mannino, "Optimal incentive-compatible pricing for M/G/1 Queues," Operations Research Letters, Vol.31, No.6(2003), pp.459-461 https://doi.org/10.1016/S0167-6377(03)00060-9
  9. Kleinrock, L. Queueing Systems, Vol. II:Computer Applications, John Wiley and Sons, Inc., 1976
  10. Knudsen, N. "Individual and Social Optimization in Multiserver Queue with a General Cost-Benefit Structure," Econometric, Vol.40, No.3(1972), pp.515-528 https://doi.org/10.2307/1913182
  11. Kwak, J.H., "On network neutrality issues in the US," http://www.kisdi.re.kr/imagedata/pdf/10/1020061003.pdf
  12. Laxton, Jr. W., "The End of Net Neutrality," www.law.duke.edu/journals/dltr/articles/2006dltr0015.html
  13. Mendelson, H., "Pricing Computer Service s:Queueing Effects," Communications of the ACM, Vol.28, No.3(1985), pp.312-321 https://doi.org/10.1145/3166.3171
  14. Mendelson, H. and S. Whang, "Optimal Incentive-compatible Priority Pricing for the M/M/1 Queue," Operations Research, Vol.38, No.5(1990), pp.870-883 https://doi.org/10.1287/opre.38.5.870
  15. Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Third Edition, Berlin, Germany, 1996
  16. Mitrani I., Probabilistic Modelling, Cambridge University Press, 1998
  17. Naor, P., "The Regulation of Queueing Size by Levying Tolls," Econometrica, Vol.37, No.1(1969), pp.15-24 https://doi.org/10.2307/1909200
  18. Pigou, P., The Economics of Welfare, Macmillan, First Edition, London, 1920
  19. Wilson, R., "Efficient and Competitive Rationing," Econometrica, Vol.57, No.1(1989), pp.1-40 https://doi.org/10.2307/1912571