• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 한국통신학회 1998년도 하계종합학술발표회 논문집(하)
• /
• pp.971-974
• /
• 1998

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 한국통신학회 1998년도 추계종합학술발표회 논문집(상)
• /
• pp.185-188
• /
• 1998

• Journal of the Korea Society of Computer and Information
• /
• 제3권1호
• /
• pp.125-148
• /
• 1998

The use of shaping mechanism, realized by means of a leaky bucket based algorithm on input traffic of an ATM network allows to achieve higher utilization of network resources, and to guarantee the quality of service requested by the users. The functionalities of the shaping mechanism based on leaky bucket, are characterized by the token pool sire and by input queue size. In this paper we have analyzed, using simulations, the effect on the quality of service in ATM network of leaky bucket algorithm when shaper parameters described above are changed.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (D)
• /
• pp.666-670
• /
• 2006

많은 센서 노드가 환경정보를 수집하는 이벤트 기반의 센서 네트워크는 국부적인 이벤트 발생에 따라 혼잡이 발생할 수 있다. 네트워크의 혼잡으로 인해 중요한 정보의 손실이 일어날 수 있으며, 과다한 RF 모듈의 사용으로 네트워크의 수명이 단축될 수 있다. 본 논문에서는 이벤트가 발생하여 네트워크 트래픽이 증가할 때, 트래픽이 집중된 노드에서 주변 노드들의 데이터 전송률을 고려하여 자식 노드들의 트래픽을 분산 시키는 유전자 알고리즘 기반의 트래픽 분산 기법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2000년도 추계학술발표논문집 (하)
• /
• pp.1103-1106
• /
• 2000

정체(congestion)가 발생한 네트워크에서 자원관리 시스템은 정체를 제어하고 프레임 상실(loss)을 최소화함으로써 리얼타임 트래픽에 대한 요구를 충족시키기 위해 절대적으로 요구된다. 그에 따라 본 논문에서는 외부출력 인터페이스(Outgoing Interface)를 통과한 각종 멀티미디어 프레임들의 정체나 상실을 최소화하는 것을 기본 목적으로 하여 임계작업(mission critical)의 애플리케이션이 요청한 트래픽이 삽입되는 큐에 프레임이 존재하는 한, 부 스케줄러(Child Scheduler)를 생성하여 연속적으로 처리를 해주는 한편, 다른 트래픽들은 주 스케줄러(Parent Scheduler)가 할당된 대역폭만큼 Round-Robin 방식으로 계속 처리를 해주도록 하여 기아(starvation)가 일어나지 않도록 하는 CQ(Custom Queuing) 기반의 대역폭 공유 큐잉 알고리즘을 설계하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2000년도 추계종합학술대회
• /
• pp.288-291
• /
• 2000

In ATM Network, many algorithms have been proposed for rate-based ABR new control. The object of these Algorithms is to him around from cell loss and to use the unused bandwidth by ABR Traffic. These Algorithms are applied to control ABR Traffic by EFCI and ER switches. In previous paper, we showed the using rate of bandwidth for the characteristic of each algorithm applied these algorithm network In this paper, we will do that to apply these algorithms to a network and to make a graph of characteristic of each algorithm.

• Journal of Internet Computing and Services
• /
• 제3권3호
• /
• pp.67-74
• /
• 2002

Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rate to send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link, An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used for feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

• Journal of KIISE:Information Networking
• /
• 제36권5호
• /
• pp.413-424
• /
• 2009

Wireless sensor network is based on an event driven system. Sensor nodes collect the events in surrounding environment and the sensing data are relayed into a sink node. In particular, when events are detected, the data sensing periods are likely to be shorter to get the more correct information. However, this operation causes the traffic congestion on the sensor nodes located in a routing path. Since the traffic congestion generates the data queue overflows in sensor nodes, the important information about events could be missed. In addition, since the battery energy of sensor nodes exhausts quickly for treating the traffic congestion, the entire lifetime of wireless sensor networks would be abbreviated. In this paper, a new congestion control method is proposed on the basis of genetic algorithm. To apply genetic algorithm, the data traffic rate of each sensor node is utilized as a chromosome structure. The fitness function of genetic algorithm is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets, the proposed method selects the optimal data forwarding sensor nodes for relieving the traffic congestion. In experiments, when compared with other methods to handle the traffic congestion, the proposed method shows the efficient data transmissions due to much less queue overflows and supports the fair data transmission between all sensor nodes as possible. This result not only enhances the reliability of data transmission but also distributes the energy consumptions across the network. It contributes directly to the extension of total lifetime of wireless sensor networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제41권12호
• /
• pp.15-21
• /
• 2004

The Guaranteed Bandwidth Rate scheme has been designed to accomodate non-real-time applications, such as Internet based traffic in Pm networks. The Guaranteed Bandwidth Rate scheme not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this paper, we propose a cell control algorithm which can improve the fairness and the throughput through the traffic control in PM networks. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

• The Transactions of the Korea Information Processing Society
• /
• 제4권1호
• /
• pp.224-236
• /
• 1997

In order to control the flow of traffic in ATM networks and optimize the usage of network resources, an appropriate control mechanism is necessary to cope with congestion or prevent degradation of network performance caused by congestion. While the conventional UPC algorithm provides only unstable preventive function unrelated with the state of networks and is unable to recover congestion, the proposed adaptive UPC algorithm supervises the situation of ATM networks using the information from OAM cell. Then the monitor of the proposed adaptive UPC algorithm controls leaky rate and buffer threshold value according to QOS. Therefore, the proposed algorithm can cope with congestion as well as prevent and react sensitively to buffer delay. In proportion to the diversity of traffic and the increase of transmission rate in networks, the adaptive UPC-BT algorithm proposed in this paper can be effectively used in ATM networks with wide applications. This paper shows that the proposed algorithm efficiently uses in ATM networks with application. This paper shows that the proposed algorithm efficiently use network resources and provides QOS to users for various kinds of traffics by comparing with conventional UPC algorithms.