• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.2
• /
• pp.62-68
• /
• 2000

The Dynamic Channel Assignment have a detect which satisfy lots of conditions. It makes system efficiency depreciate because the Dynamic Channel Assignment executes computation process of several steps that demands lots of time. In this paper, we have proposed a traffic control algorithm which makes simple computation process for improving the detect.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.52-57
• /
• 2007

한정된 자원을 효율적으로 사용해야하는 이동통신망에서 멀티미디어 서비스 요구에 따른 무선 트래픽 채널을 할당하는 기법은 무선이라는 특수 환경으로 인해 제약을 받을 수밖에 없다. 이동망의 기지국의 경우 여러 무선 가입자 보드로부터 요구되는 서비스별 트래픽요구에 대한 채널 할당과 이에 대한 메인보드에서 처리해야 하는 작업 스케줄링은 무선과 CPU라는 서로 다른 환경을 잘 매핑하는 과제를 안고 있다. 본 논문에서는 음성과 데이터 호를 동시에 서비스하는 셀룰러 시스템에서 멀티미디어 서비스 트래픽 특성을 고려한 주파수할당과 작업 스케줄링이라는 두 가지 요소를 접목할 때 인공지능알고리즘인 유전자알고리즘을 이용하는 방법과 이에 적합한 작업 스케줄링 방식을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.507-513
• /
• 2005

As the rapid increasement of the number of internet users has occured recently, many multimedia application services have been emerging. To improve quality of service, traffic can be suggested to be classified with priority in EPON(Ethernet Passive Optical Network), which is supporting the multimedia application services. In this paper, multimedia application services treat bandwidth classifying device in serving both delay sensitive traffic for real-time audio, video and voice data such as Von(Voice over Internet Protocol), and for real-time traffic such as BE(Best Effort). With looking through existing mechanisms, new mechanism to improve the quality will be suggested. The delay performances and packet losses of traffic achieved by supporting bandwidth allocation of upstream traffic in suggested mechanism will be analized with simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1169-1176
• /
• 2000

In this paper, label assignment schemes considering the IP flow model for the efficient MPLS traffic engineering are proposed and evaluated. Based on the IP flow model, the IP flows are classified into transient flows and base flows. Base flows, which last for a long time, transmit data in high bit rate, and be composed of many packets, have good implications for the MPLS traffic engineering, because they usually cause network congestion. To make use of base flows for the MPLS traffic engineering, we propose two base flow classifiers and label assignment schemes where transient flows are allocated to the default LSPs and base flows to explicit LSPs. Proposed schemes are based on the traffic-driven label triggering method combined with a routing tabel. The first base flow classifier uses both flow size in packet counts and routing entries, and the other one, extending the dynamic X/Y flow classifier, is based on a cut-through ratio. Proposed schemes are shown to minimize the number of labels, not degrading the total cut-through ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2275-2282
• /
• 1999

In ATM networks, bandwidth allocation using available bandwidth is important to control ABR traffic efficiently. However, it is difficult to dynamically assign bandwidth on bursty traffic, because the tracking of the existing available bandwidth information uses statistical value. In this paper, we propose a output-bufferd ATM switch using Per-VC queueing scheme with timer and Controller. The controller determines whether each VC is in congestion state or not, and the timer can assign dynamically as determining the available bandwidth for the Present period by Backlogged time and total link capacity, and then transmitting the determined bandwidth to source. Instead of using statistical parameters, the proposed scheme can improve link efficiency as allocating the bandwidth of the next period, by use of measured bandwidth during the current period.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.441-446
• /
• 2003

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. The PON architecture is very simple but it requires a MAC protocol for control of upstream traffic. The MAC protocol must support QoS (Quality of Service) administration function by various traffic class, efficient dynamic bandwidth assignment function, CDV (Ceil Delay Variation) minimization function etc. This paper proposes a dynamic bandwidth assignment algorithm of the MAC protocol for a broadband access network using an Ethernet Passive Optical Network supporting various traffic class. We compare our proposed with MDRR algorithm using simulation, and confirmed that our proposed Request-Counter algorithm produces shorter average cell delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.868-878
• /
• 2004

In this paper, we analyse feasibility of Zone-based Power Control (ZPC) scheme introduced for CDMA forward link(1) in the reverse link. To operate ZPC scheme in the CDMA systems the maximum power level that can be allocated to each traffic channel should be determined. Because all the service channels share the whole power resource in the forward lint a specific mechanism that determines Maximum power resource to each traffic channel is required to operate ZPC scheme in the forward link. However, ZPC scheme can be easily adopted to the reverse link, because of the fact that the whole power resource of service terminal is only confined to its traffic channel. In other words, we need not to determine the maximum power resource to be allocated in the reverse traffic channel. Simulation results show that ZPC scheme adopted to the reverse link yields a significant performance improvement compared with the conventional TPC(IS-95 TPC) scheme in terms of the power consumption and the traffic capacity of Portables, especially with the increasing number of high-rate data traffics. With the proposed scheme, not only be extended the service coverage of high-rate data traffic to the entire cell service coverage, but also the QoS of low-rate traffic can keep going through the service time, especially, in the situation that the incoming interference is much larger.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1426-1437
• /
• 1999

The introduction of fast packet switching networks such as the ATM leads to the possibility of video services with constant quality. However, the fixed traffic descriptor(TD), which is defined by ATM Forum and ITU-T, can not simultaneously satisfy network efficiency and video quality. This paper presents fast resource reallocation protocol (FRRP) which can provide an effective compromise between network efficiency and video quality. This protocol reallocates the network resources and then adapts the traffic to the reallocated resources. In the proposed method, a video session is divided into several time-intervals according to its generated traffic and TD is calculated which well characterizes the traffic during the specific subdivided interval. In addition, a system model, where MPEG coding algorithm and network control are unified, is proposal and the performance of the FRRP in terms of cell loss rate(CLR) is evaluated though the simulation using real video traffic(Star Wars). Simulation results show that the FRRP has only 5 ~35% CLR of the fixed TD.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.486-488
• /
• 1998

인터넷 사용의 증가로 인한 정체 현상을 극복하기 위한 방안으로 캐시 서버를 사용하고 있다. 캐시 서버의 보다 효율적인 사용을 위해 할당 네트웍의 트래픽에 대한 이해는 매우 중요하다. 즉, 보다 적극적인 캐싱 전략을 수립하기 위해 트래픽 분석이 선행되어야한다. 본 논문에서는 URL- tree와 URL-net이라는 자료구조를 제안하고, 이것을 이용하여 웹 트래픽 분석을 수행한다. 이러한 자료구조를 통해 웹 트래픽에 존재하는 '참조의 연결성'이라는 성질을 찾을 수 있다. 본 논문에서는 위의 두 자료구조들이 인터넷 트래픽을 분석하는데 어떻게 도움을 주고 그러한 분석이 효율적인 캐싱 전략을 수립하는데 어떻게 사용될 수 있는가를 보여준다.

• Information and Communications Magazine
• /
• v.14 no.7
• /
• pp.117-132
• /
• 1997

본 논문에서는 위성 통신 시스템에 있어서 제한된 채널을 다수의 사용자가 효율적으로 사용하기 위한 다중 접속 방식인 고정 할당 다중 접속, 랜덤 다중 접속, 요구할당 다중 접속, 혼합 랜덤/예약 다중 접속 방식등의 프로토콜에 관하여 고찰하였으며, 몇 가지의 프로토콜에 관한 성능을 비교 검토하였다. 고정 할당 다중 접속 방식의 경우 연속적인 트래픽에 효율적이므로 소수의 기관 통신에는 적합하나 다수의 사용자를 수용하기에는 부적합한 특성을 갖고 있으며, 랜덤 다중 접속 방식은 접속 방식이 간단하며, 버스트한 트래픽을 가진 다수의 사용자에 대하여 적은 지연 특성을 갖는 장점이 있으나 한정된 채널 효율과 사용자 수의 증가에 따른 지연의 증가가 심각하다. 따라서, 지상의 초고속 통신망의 위성 시스템을 적용하기 위해서는 지상 B-ISDN의 패킷화된 ATM 셀의 전송을 위해 접속 방식은 다소 복잡하지만 채널 효율 및 지연 특성이 비교적 우수한 요구 할당 다중 접속 또는 혼합 랜덤/예약 다중 접속 방식이 적합할 것으로 보인다.