한국통신학회논문지 (The Journal of Korean Institute of Communications and Information Sciences)

  • 제31권3B호
  • /
  • Pages.183-198
  • /
  • 2006
  • /
  • 1226-4717(pISSN)
  • /
  • 2287-3880(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

불완전매체공유 시스템을 위한 집중방식 채널할당기법

Centralized Channel Allocation Schemes for Incomplete Medium Sharing Systems with General Channel Access Constraints

  • 김대우 (LG전자(주)) ;
  • 이병석 (서강대학교 전자공학과 고속통신망 연구실) ;
  • 최진우 (서강대학교 전자공학과 고속통신망 연구실)
  • 발행 : 2006.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

매체공유기반 통신 시스템은 매체접근제어 과정에서 단말기의 채별 점유 제약 조건에 따라 크게 완전매체공유 시스템과 불완전매체 공유 시스템으로 구분할 수 있다 본 논문은 불완전매체공유 시스템의 매체접근제어기법의 개발을 위해 채널할당기법을 다루었다. 최적 채널할당기법은 채널할당 문제를 다중항목흐름(multi-commodity flow) 최대화 문제로 간주하고 선형 프로그래밍 문제를 유도하여 전역 최적해를 구한다. 또한 연산 복잡도를 낮추기 위한 대안으로 준최적 채널할당기법을 제안한다. 이 방식은 2단 iSLIP 채널할당기법과 순차적(sequential) 채널할당기법으로 구분하여 제안한다. 모의실험 결과 순차적 채널할당기법이 2단 iSLIP 채널할당기법 비해 상대적으로 낮은 연산 복잡도와 우월한 성능을 나타냄을 확인할 수 있었다.

We define the incomplete medium sharing system as a multi-channel shared medium communication system where constraints are imposed to the set of channels that may be allocated to some transmitter-receiver node pairs. To derive a centralized MAC scheme of a incomplete medium sharing system, we address the problem of optimal channel allocation The optimal channel allocation problem is then translated into a max-flow problem in a multi-commodity flow graph, and it is shown that the optimal solution can then be obtained by solving a linear programming problem. In addition, two suboptimal channel allocation schemes are proposed to bring down the computational complexity to a practical/feasible level; (1) one is a modified iSLIP channel allocation scheme, (2) the other is sequential channel allocation scheme. From the results of a extensive set of numerical experiments, it is found that the suboptimal schemes evaluate channel utilization close to that of the optimal schemes while requiring much less amount of computation than the optimal scheme. In particular, the sequential channel allocation scheme is shown to achieve higher channel utilization with less computational complexity than . the modified iSLIP channel allocation scheme.

키워드

참고문헌

  1. J. Sha, 'Optical CDMA,' Optics & Photonics News, vol. 14, no. 4, pp. 42-47, April 2003
  2. J. A. Salehi and C. A. Brackett, 'Code Division Multiple-Access Techniques in Optical Fiber Networks - Part II: Systems Performance Analysis,' IEEE Transactions on Communications, vol. 37, no. 8, pp. 834-842, Aug. 1989 https://doi.org/10.1109/26.31182
  3. J. A. Salem, 'Emerging optical code-division multiple access communication systems,' IEEE Network, Vol. 3, pp. 31-39, March 1989 https://doi.org/10.1109/65.21908
  4. J. A. Salehi, 'Code division multiple access technique in optical fiber networks - Part I: Fundamental principles,' IEEE Transaction on Communications, Vol. 3, pp. 824-833, Aug. 1989
  5. K. Kitayama, 'Code Division Multiplexing Lightwave Networks Based upon Optical Code Conversion,' IEEE Journal on Selected Areas in Communications, vol. 16, no. 7, p.p. 1309-1319, Sept. 1998 https://doi.org/10.1109/49.725198
  6. 이우성 최진우 신동준 ' 광부호분할다중접속 네트워크에서의 매체접근제어와 부호관리체계에 대한 연구' 한국통신학회 하계 종합학술발표대회논문 모음집. 2004년 7월
  7. Mokhtar SS.Bazaraa, John J. Jarvis and Hanif D.Sherali, 'Linear programming and network flows', 2nd Wiley
  8. Thomas H. Connen, Charles E. Leiserson, Ronald L. Rivest and Clisfford Stein, 'Introduction to algorithms' 2nd MIT Press
  9. Thomas H. Connen, Charles E. Leiserson, Ronald L. Rivest and Clisfford Stein, 'Introduction to algorithms' 2nd MIT Press
  10. Adisak Mekkittikul and Nick McKeown, 'A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches,' IEEE lNFOCOM 98, San Francisco, April 1998
  11. N.Mckeown, A. Mekkittikul, V. Anantharam, and lWalrand, 'Achieving 100% throughput in an input-queued switch,' IEEE Trans. Communication vol. 7, no. 2 pp. 188-201, April 1999
  12. Ying Jiang and Mounir Hamdi 'A Fully Desynchronized Round-Robin Matching Scheduler for a VOQ Packet Switch Architecture,' High Performance Switching and Routing, 2001 IEEE Workshop on 29-31 May 2001 Page(s) : 407-411
  13. Yihan Li, Shivendra S. Panwar and H. Jonathan Chao, 'The Dual Round Robin Matching Switch with Exhaustive Service, Merging Optical and IP Technologies. Workshop on 26-29 May 2002 Page(s): 58 63
  14. Mei Yang and S.Q. Zheng, 'Pipelined Maximal Sieze Matching Scheduling Algorithms for CIOQ Switches,' Computers and Communication, 2003. (ISCC 2003)
  15. M. Ajmone Marsan, A. Bianco, P. giaccone, E. Leonardi and F. Neri, 'Packet Scheduling in Input-Queued Cell-Based Switches, in Proceedings of IEEE lNFOCOM 2001, pp. 1085-1094, April, 2001
  16. H. Jonathan Chao, Soung Y. Liew and Zhigang Jing, 'A Dual-Level Matching Algorithm for 3-Stage elos-Network Packet Switches', IEEE Proc. of the 11th Symposium on High Performance Interconnects, Aug. 2003 Page(s) : 38 - 43
  17. T. Anderson, S. Owicki, l Saxe, and C. Thacker, 'High Speed Switch Scheduling for Local Area Networks,' ACM Trans. Communication Systems, pp. 319-52, Nov. 1993