서지주요정보
Performance of collision-free protocols for local area networks with star topology = 스타 구조를 갖는 근거리 통신망에서 사용되는 충돌 없는 프로토콜의 성능 분석에 관한 연구
서명 / 저자 Performance of collision-free protocols for local area networks with star topology = 스타 구조를 갖는 근거리 통신망에서 사용되는 충돌 없는 프로토콜의 성능 분석에 관한 연구 / Sea-Hyeon Nam.
저자명 Nam, Sea-Hyeon ; 남세현
발행사항 [대전 : 한국과학기술원, 1991].
Online Access 제한공개(로그인 후 원문보기 가능)원문

소장정보

등록번호

8002330

소장위치/청구기호

학술문화관(문화관) 보존서고

DEE 9130

SMS전송

도서상태

이용가능

대출가능

반납예정일

초록정보

The main objective of this dissertation is to investigate the performance characteristics of a broadcast star network with collision avoidance switch and a multichannel local lightwave network with grouping property. So far, quite a few attempts have been made to model the broadcast star network with collision avoidance switch. Most of those models assumed constant message length and random selection policy at the central hub. If the central hub can choose the oldest message among the messages which are transmitted at the same slot, then the service discipline becomes first-come first-served (FCFS). Although the FCFS discipline has many desirable features such as fairness and lowest variance of message delay, this discipline is not easy to implement since the central hub does not know the arrival times of messages. If the central hub chooses one message randomly among the messages which are transmitted at the same slot, then the service discipline becomes random-order of service (ROS). While the ROS discipline is easy to implement, the message delay is not bounded and the variance of message delay becomes large in this discipline. For this reason, we first proposed a service discipline which is relatively easy to implement and which has the variance characteristics of message delay almost the same as the FCFS case (ideal case). The proposed service discipline is a combination of FCFS and ROS disciplines and it uses reservation and priority fields in the message header. Using the proposed service discipline, we presented models for a broadcast star network with collision avoidance switch separately in two cases: a broadcast star network with small propagation delay and a broadcast star network with large propagation delay. We assumed that the network consists of an infinite population of stations which collectively generate new messages according to a Poisson distribution and that the size of each message is distributed according to a general distribution. We also assumed that the network is symmetric and that the channel operation is slotted so that each ready station can start transmission only at the beginning of a slot. Then the ready stations were modeled as a distributed queue, and the entire system was modeled as an M/G/1 queueing system with multiple server vacations. Here the vacation lengths are equal to the slot length. Then we presented performance analyses of the models to obtain distributions of the message delay for the proposed service discipline, and compared the results with that for other service disciplines. We found that the broadcast star network with collision avoidance switch has the potential of combining the benefits of random access.(low delay with light traffic, simple, distributed, and therefore robust) and controlled access with excellent network utilization. We also found that the proposed service discipline is suitable for the broadcast star network with collision avoidance switch in that it is easy to implement and it exhibits relatively low variance of the message delay. In addition, we presented a model for the broadcast star network with collision avoidance switch and with multiple priority classes of messages. We assumed that the network consists of an infinite population of stations which collectively generate new messages according to a Poisson distribution and that the size of each message is distributed according to a general distribution. Here, each message belongs to one out of n classes. We also assumed that the network is symmetric and that the channel operation is slotted so that each ready station can start transmission only at the beginning of a slot. Then the ready stations were modeled as a distributed queue, and the entire system was modeled as a priority M/G/1 queueing system with multiple server vacations. Here the vacation lengths are equal to the slot length. Then we proposed a service discipline which is used to select one message among the same class messages which are transmitted at the same slot. Also, we analyzed the model to obtain distributions of the message delay for the proposed service discipline, and compared the results with that for the FCFS discipline. From numerical results, it was shown that the variance of message delay for the proposed service discipline is almost the same as that for the FCFS discipline (idea case) for any distribution of message length and also for any value of normalized propagation delay. Finally, we proposed a multichannel local lightwave network with a grouping property which exhibits better channel efficiency as the traffic is more likely within groups and also avoids both wavelength agility and pretransmission coordination problems. Two network topologies were considered. One was a multichannel lightwave network with full connection within groups, and the other was a multichannel lightwave network with minimal connection within groups. For performance analysis the network capacities and the mean queueing delays for the two network topologies were obtained. We observed that the network with full connection within groups outperforms the network with minimal connection within groups in respect of delay-throughput characteristics. However, in a situation where the cost of the receiver may cause a major restriction on network construction, the network topology with minimal connection within groups may be preferred.

서지기타정보

서지기타정보
청구기호 {DEE 9130
형태사항 xi, 150 p. : 삽도 ; 26 cm
언어 영어
일반주기 Includes appendix
저자명의 한글표기 : 남세현
지도교수의 영문표기 : Chong-Kwan Un
지도교수의 한글표기 : 은종관
학위논문 학위논문(박사) - 한국과학기술원 : 전기 및 전자공학과,
서지주기 Reference : p. 139-148
주제 Data traffic management systems (Computer systems)
Computer network protocols
Multichannel communication
Queuing theory
LAN --과학기술용어시소러스
트래픽 처리 --과학기술용어시소러스
프로토콜 --과학기술용어시소러스
다중 접근 --과학기술용어시소러스
충돌 방지 장치 --과학기술용어시소러스
Local area networks
QR CODE qr code