Journal of KIISE:Information Networking (한국정보과학회논문지:정보통신)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Switching Element Disjoint Multicast Scheduling for Avoiding Crosstalk in Photonic Banyan-Type Switching Networks(Part I):Graph Theoretic Analysis of Crosstalk Relationship

광 베니언-형 교환 망에서의 누화를 회피하기 위한 교환소자를 달리하는 멀티캐스트 스케줄링(제1부):누화 관계의 그래프 이론적 분석

  • 차영환 (상지대학교 컴퓨터정보공학부)
  • Published : 2001.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider the scheduling of SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks constructed with directional couplers. This ensures that at most, one connection holds each SE in a given time thus, neither crosstalk nor blocking will arise in the network. Such multicasting usually takes several routing rounds hence, it is desirable to keep the number of rounds(i.e., scheduling length) to a minimum. We first present the necessary and sufficient condition for connections to pass through a common SE(i.e., make crosstalk) in the photonic Banyan-type networks capable of supporting one-to-many connections. With definition of uniquely splitting a multicast connection into distinct subconnections, the crosstalk relationship of a set of connections is represented by a graph model. In order to analyze the worst case crosstalk we characterize the upper bound on the degree of the graph. The successor paper(Part II)[14] is devoted to the scheduling algorithm and the upper bound on the scheduling length. Comparison with related results is made in detail.

본 논문에서는 방향성 커플러를 이용하여 구성한 광 베니언-형 교환 망에 있어 교환소자를 달리하는 멀티캐스팅의 스케줄링을 고려한다. 임의의 주어진 시각에 최대한 하나의 접속만이 각각의 교환소자를 점유하기 때문에 블록킹은 물론 누화가 발생하지 않도록 보장된다. 이러한 멀티캐스팅에서는 대개 수차례 걸친 라우팅이 수반되므로 라우팅 횟수를 최소한으로 하는 것이 바람직하다. 먼저 일-대-다 접속 능력을 제공하는 광 베니언-형 망에서 접속들이 동일한 교환소자를 경유하기 위한 필요충분 조건을 제시한다. 멀티캐스트 접속을 일정한 부분접속들로 분할 하는 규칙을 정의하고 부분접속들간의 누화 관계를 그래프로 표현한다. 최악의 경우의 누화를 분석하기 위해 그래프차수의 상한을 제시한다. 후속 논문(제2부)[14]에서는 스케줄링 알고리즘과 스케줄링 길이의 상한을 고찰하고 관련 연구결과와의 상세한 비교를 다룬다.

Keywords

References

  1. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, London: Academic Press, 1965
  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, San Francisco: Freeman and Company, 1979
  3. C.-T. Lea, 'Bipartite graph design principle for photonic switching systems,' IEEE Trans. Commun., vol. COM-38, no.4, pp.529-538, Apr. 1990 https://doi.org/10.1109/26.52664
  4. Y. Pan, C. Qiao, and Y. Yang, 'Optical multistage interconnection networks: new challenges and approaches,' IEEE Commun. Maga. vol. 37, no. 2, pp. 50-56, Feb. 1999 https://doi.org/10.1109/35.747249
  5. A. Pattavina, 'Nonblocking architectures for ATM switching,' IEEE Commun. Mana, vol. 31, pp. 38-49, Feb. 1993 https://doi.org/10.1109/35.186360
  6. C. Qiao and L. Zhou, 'Scheduling switching element (SE) disjoint connections in stage-controlled photonic banyans,' IEEE Trans. Commun. vol. COM-47, no. 1, pp. 139-148, Jan. 1999 https://doi.org/10.1109/26.747821
  7. R. K. Pankaj 'Wavelength requirements for multicasting in all-optical networks,' IEEE/ACM Trans. Networking, vol. 7, no. 3, pp, 414-424, Jun. 1999 https://doi.org/10.1109/90.779211
  8. Y. Tscha and K. - H Lee, 'Yet another result on multi-$log_2$N networks,' IEEE Trans. Commun, vol. COM-47, no. 9, pp. 1425-1431, 1999 https://doi.org/10.1109/26.789678
  9. M. Vaez and C.-T. Lea, 'Strictly nonblocking directional-coupler-based switching networks under crosstalk constraint,' IEEE Trans. Commun., vol. 48. no. 2, pp. 316-323, Feb. 2000 https://doi.org/10.1109/26.823564
  10. M. Vaez and C.-T. Lea, 'Wide-sense nonblocking Banyan-type switching systems based on directional couplers,' IEEE J. Select Areas Commun., vol, 16, pp. 1327-1332, Sept. 1998 https://doi.org/10.1109/49.725200
  11. A. Varma and C. S. Raghavendra, Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice, IEEE Comput. Soc. Press, 1994
  12. C.-L. Wu and T.-Y. Feng, 'On a class of multistage interconnection networks,' IEEE Trans. Comput., vol. C-29, no. 8, pp. 694-702, Aug. 1980 https://doi.org/10.1109/TC.1980.1675651
  13. H. Hinton. An Introduction to Photonic Switching Fabrics, New York: Plenum, 1993
  14. Y. Tscha, 'Switching element disjoint multicast scheduling for avoiding crosstalk in photonic Banyan-type switching networks(Part II): scheduling lengths and nonblocking property,' Journal of KISS: Information Networking (Accepted for Publication), 2001
  15. D. P. Agrawal, 'Graph theoretical analysis and design of multistage interconnection networks,' IEEE Trans. Comput., vol. C-32, no. 7, pp. 637-648, Jul. 1983 https://doi.org/10.1109/TC.1983.1676295