Successive Max-min Connection-Ratio Preoblem:Routing with Fairness and Efficiency in Circuit Telecommunication Networks

연속적인 최대-최소 연결비율 문제: 회선망에서의 공정성 및 효율성을 보장하는 경로설정

  • 박구현 (홍익대학교 산업공학과) ;
  • 우재현 (홍익대학교 산업공학과)
  • Published : 1997.06.01

Abstract

This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

Keywords

References

  1. 추계종합학술발표회 논문집 광전달망에서 최고파장 수의 한계값을 구하는 실질적인 방법 이종원;박구현;이창회
  2. 춘계공동학술대회 논문집 연속적인 최대-최소 연결 비율 문제의 발견적 알고리즘 구현 및 수치적용 박구현;우재현
  3. Network Flows: Theory, Algorithms, and Applications Ahuja, R.K.;Magnanti, T.L.;Orin, J.B.
  4. GAMS: A User's Guide, Release 2.25 body and fraster Brooke, A.;Kendrick, D.;Meerraus, A.
  5. Computers and Intractability: A Guide to the Theory of NP-Completeness Garey, M.R.;D.S. Johnson
  6. Fiber Optic Networks Green, P.E. JR.
  7. Journal of the Association for Computing Machinery v.37 no.2 The Maximum Concurrent Flow Problem Shahrokhi, F.;D.W. Matula
  8. Fiber Network Service Survivability Wu, T.-H.