한국콘텐츠학회논문지 (The Journal of the Korea Contents Association)

  • 제8권5호
  • /
  • Pages.52-60
  • /
  • 2008
  • /
  • 1598-4877(pISSN)
  • /
  • 2508-6723(eISSN)
한국콘텐츠학회 (The Korea Contents Association)
권호 표지
DOI QR코드

DOI QR Code

그래프 채색에 의한 타임 슬롯 할당 알고리즘

Time Slot Assignment Algorithm with Graph Coloring

  • 권보섭 (안동대학교 컴퓨터교육과)
  • 발행 : 2008.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

위성 통신 분야에서 널리 사용되는 시분할 다중 스위칭 시스템은 많은 저대역폭 가입자들로부터 발생되는 트랙픽을 반복되는 프레임에 타임 슬롯을 할당해야 한다. 본 논문에서는 타임 슬롯 할당을 위한 새로운 방법을 제안한다. 기존의 방법인 네트워크 흐름 모델을 사용하지 않고 새로운 방법인 그래프 채색방법을 사용하여 효율적인 타임 슬롯 할당 알고리즘을 제안하였다. 제안된 알고리즘은 주어진 트래픽의 프레임 길이가 2의 멱승일 경우 트래픽을 정확히 반으로 나누어 할당한다. 분할된 트래픽의 프레임 길이가 1이 될 때까지 이 과정을 계속적으로 반복해 분할한다. 제안된 알고리즘의 시간 복잡도는 프레임의 길이가 L이고 스위치 크기가 N인 경우에는 기존의 네트워크 흐름 모델을 사용한 최적의 타임 슬롯 할당 알고리즘의 시간 복잡도는 $O(N^{4.5})$ 인데 반해 $O(NLlog_2L)$이다.

A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

키워드

참고문헌

  1. M. A. Bonuccelli, F. Martelli, and S. Pelagatti, "Optimal Packet Scheduling in tree-structured LEO Satellite Cluster," Mobile Networks and Application, Vol.9, pp.289-295, 2004. https://doi.org/10.1023/B:MONE.0000031588.69327.34
  2. K. T. Yiu, "Scheduling Satellite- Switched Time-Division Multiple Access With Geneneral Switching Modes," IEEE/ACM Trans, Vol.12, No.4, 2004(8). https://doi.org/10.1109/TNET.2004.833154
  3. K. Y. Eng and A. S. Acampora, " Fundamental Conditions Governing TDM Switching Assignments in Terrestrial and Satellite Networks," IEEE Trans. on Commun., Vol.35, pp.755-761, 1987(7). https://doi.org/10.1109/TCOM.1987.1096842
  4. S. C Liew, "Comments on `Fundamental Conditions Governing TDM Switching Assignments in Terrestrial and Satellite Networks'," IEEE Trans, on Commun, Vol.37, pp.187-189, 1989(2). https://doi.org/10.1109/26.20088
  5. G. Haigang and L. Ming, "A Two Level TDMA Scheduling Protocol with Intra-cluster Coverage for Large Scale Wireless Sensor Network," IJCSNS, Vol.6, No.2B, 2006(2).
  6. M. A. Bonuccelli, "A Fast Time-slot Assignment Algorithm for TDM Hierarchical Switching System," IEEE Trans, on Commun., Vol.37, pp.870-874, 1989(8). https://doi.org/10.1109/26.31186
  7. M. A. Bonuccelli, I. Gopal, and C. K. Wong, "Incremental Time-Slot Assignment in SS/TDMA Satellite Systems," IEEE Trans. on Commun., Vol.39, pp.1147-1156, 1991(7). https://doi.org/10.1109/26.87220
  8. S. Chalasani and A. Varmar, "An improved Time-slot Assignment Algorithm for TDM Hierarchical Switching Systems," IEEE Trans. on Commun., Vol.41, pp.312-317, 1993(2). https://doi.org/10.1109/26.216505
  9. S. Chalasani and A. Varmar, Parallel Algorithms for Time-slot Assignment in TDM Switching System," IEEE Trans. on Commun., Vol.41 pp.1736-1747, 1993(11). https://doi.org/10.1109/26.241754
  10. ISaac Keslassy, Murali Kodialam, T. V. Lakshman, and Dimitrios Stiliadis, "On Guaranted Smooth Scheduling for Input-Queued Switches," IEEE/ACM Trans., Vol.13, No.6, 2005(12). https://doi.org/10.1109/TNET.2005.860104
  11. K. T. Yiu, "A unified Algorithmic Framework for Variable-Rate TDM Switching Assignments," IEEE/ACM Trans., on Networking, Vol.9, No.5, 2001(10). https://doi.org/10.1109/90.958333
  12. S. Kulkarni, "TDMA service for sensor network," In 24th Int. Conf. on Distributed Computing Systems(ICDCS04), ADSN Workshop, pp.604-609, 2004(3). https://doi.org/10.1109/ICDCSW.2004.1284094
  13. S. Suresh, J. Eric, Harder, and H. A. Choi, "Scheduling multi-rate sessions in time division multiplexed wavelength-routing networks," IEEE Journal on Selected Areas in Communications, Vol.18, No.10, 2000(10) https://doi.org/10.1109/49.887929