| Title: | The Parallels Between Packet Switching and Information Transmission |
| Date: |
August 18, 2006 (Friday)
|
| Time: |
2:30 p.m. - 3:30 p.m.
|
| Venue: |
Room 121, 1/F, Ho Sin-hang Engineering Building,
The Chinese University of Hong Kong, Shatin, N.T. |
| Speaker: |
Prof. Tony T. Lee
Department of Information Engineering Chinese University of Hong Kong |
All communication networks comprise transmission systems and switching systems, even though they are usually treated as two separate issues. Communication channels are generally disturbed by noise from various sources. In circuit switched networks, reliable communication requires the error-tolerant transmission of bits over noisy channels. In packet switched networks, however, not only can bits be corrupted with noise, but resources along connection paths are also subject to contention. Thus, quality of service (QoS) is determined by buffer delays and packet losses. The theme of this paper is to show that transmission noise and packet contention actually have similar characteristics and can be tamed by comparable means to achieve reliable communication. The following analogies between transmission and switching are identified.
1. Buffering against contention is a process that is similar to the error correction of noise corrupted signals. A signal-to-noise ratio that represents the carried load of packet switches can be deduced from the Boltzmann model of packet distribution.
2. When deflection routing is applied to the Clos networks the loss probability decreases exponentially, which is similar to the exponential behavior of the error probability of binary symmetric channels with random channel coding. In information theory, this result is stated as the noisy channel coding theorem.
3. The similarity between Hall's condition of bipartite matching and expander graph manifests the resemblance between route assignments and error-correcting codes. An extension of Sipser-Speilman decoding algorithm of expander codes to route assignments of Benses networks is given to illustrate their correspondence.
4. Scheduling in packet switching serves the same function as noiseless channel coding in digital transmission. The smoothness of scheduling, like source coding, is bounded by entropy inequalities.
5. The sampling theorem of bandlimited signals provides the cornerstone of digital communication and signal processing. Recently, Birkhoff-von Neumann decomposition of traffic matrices has been widely applied to packet switches. With respect to the complexity reduction of packet switching, we show that the decomposition of a doubly stochastic traffic matrix plays a similar role to that of the sampling theorem in digital transmission.
6. We conclude that packet switching systems are governed by physical laws that are similar to those of digital transmission systems as envisioned by Shannon in his seminal 1948 paper, A mathematical theory of communication.
BIOGRAPHY:
Tony T. Lee received his BSEE degree from National Cheng Kung University, Taiwan in 1971, and his MS and PhD degrees in electrical engineering from Polytechnic University in New York, in 1976 and 1977, respectively. Currently, he is a Professor of Information Engineering at the Chinese University of Hong Kong, and an adjunct Professor of the Institute of Applied Mathematics of Chinese Academy of Science. From 1991 to 1993, he was a Professor of Electrical Engineering at Polytechnic University of New York, Brooklyn, New York. He was with AT&T Bell Laboratories, Holmdel, NJ, from 1977 to 1983, and Bellcore, currently Telcordia Technologies, Morristown, NJ, from 1983 to 1993. He is now serving as an Editor of the IEEE Transactions on Communications, and an area Editor of Journal of Communication Network. Tony is a fellow of IEEE and HKIE. He has received many awards including The National Natural Science Award from China, the Leonard G. Abraham Prize Paper Award from IEEE Communication Society and the Outstanding Paper Award from IEICE.
Enquiries: Miss Temmy So at tel 2609 8444
For more information, please refer to http://www.cse.cuhk.edu.hk/seminar