Topological design for packet network with hop-count the minimum degree ordering method

경유교환기 수의 제약을 고려한 패킷 통신망 설계에 관한 연구

  • Published : 1995.08.01

Abstract

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.

Keywords

References

  1. 패킷교환망 구성 및 운용기술 연구 한국통신, 통신시스템개발센터
  2. 패킷교환망 구성 및 서비스 기술조사 한국통신연구개발단
  3. ISDN과 패킷교환 한국전자통신연구소
  4. ITC-13 DOPNET : A PC Tool for Design and Planning Packet Switching Networks G.Cappellini;A.Massari
  5. IEEE Transactions on Communications v.37 no.4 A System for Routing and Capacity Assugnment in Computer Communication Networks B.Gavish;I.Neuman
  6. IEEE Transactions on Communications v.25 no.1 On the Topological Destributed Computer networks M.Gerla;L.Kleinrock
  7. ITC-13 Capacity and Flow Assignment of Packet-Switched Networks with Concave Line Function K.Kamimura;H.Nishino
  8. IEEE J. on SAC. v.4 no.6 Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks C.L.Monma;D.D.Sheng
  9. IEEE Transactions on Communications v.35 no.2 Joint Optimization of Capacity and Assignment in a Packet-Switched Communications Network T.M.J Ng;D.B.Hoang
  10. IEEE J. on SAC. v.7 no.8 Topological Analysis of Packet Networks V.R.Saksena
  11. Transmission Networking: SONET and the Synchronous Digital Hierarchy M.Sexton;A.Reid
  12. Topology Optimization R.L.Sharma
  13. Data Network Design D.L.Spohn
  14. Data and Computer Communications W.Stallings
  15. IEEE Communication Magagine v.25 no.9 Designing a New Architecture for Switching Cimmunication Networks L.Zhang