• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2042-2051
• /
• 1998

VBR compressed, pre-recorded video is known to exhibit significant, multiple time-scale bit rate variability. To reduce the variability and burstiness of the aggregated transmission rate as low as possible, in this paper, we present an adaptive bandwidth smoothing algorithm, that can be effectively applicalble for VoD services over a shared-medium channel. For these environments where many clients are connected to a single server, by introducing the conventional MVBA(minimum variability bandwidth allocation) algorithm and controlling adaptively the conventional MVBA(minimum variability bandwidth asllocation) algorithm and controlling adaptively the aggregated transmission rate whenever a new clients request is arrived at the server side, the proposed algorithm effectively reduces the burstiness and variability of the aggregated transmission rate. Through computer experiments, it is shown that the proposed method perporms better than the convertional non-aggregated bandwidth smoothing schemes in terms of the peak rate, standard deviation, number of rate changes for the aggregated traffic.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.122-125
• /
• 2018

최근 다양한 네트워크 서비스에 대한 수요가 증가함에 따라 Service Function (SF)의 동적 구성을 위한 유연한 모델이 요구된다. Service Function Chaining (SFC)은 일련의 SF로 구성된 새로운 네트워크 서비스 배포 모델을 정의한다. Software Defined Networking (SDN)은 제어 평면을 중앙 집중화함으로써 네트워크 트래픽 제어를 단순화하여 SFC동작에 중요한 역할을 한다. SDN 기반 SFC(SD_SFC)는 SF 장애를 감지하기 위한 모니터링 시스템이 필요하다. 그러나 기존의 모니터링 방식은 모든 SF에 Monitoring Agent(MA)를 배치하기 때문에 높은 시그널링 비용을 가진다. 본 논문에서는 최소한의 SF에 MA를 배치함으로써 시그널링 비용을 줄이는 SFC모니터링 방식을 제안한다. 제안하는 SF selection 알고리즘은 최적화된 SF 집합을 사용하여 오버로드된 SF를 반환하여 MA를 배치한다. 우리는 제안 시스템의 효율성을 평가하기 위해 테스트베드 구현을 통해 실험하였다. 실험 결과에 따르면 우리는 기존 방식에 비해서 시그널링 비용을 59.2% 절감하였다.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.527-538
• /
• 2004

In this paper, we present the flow aggregation method and the FLTC(flow lasting time control) algorithm to reduce the number of flows and solve the scalability problem in high speed IP switching networks. The flow aggregation based on the destination address could reduce the total number of flows, improve the label efficiency, and increase the total amount of the switched packets. The FLTC algorithm also eliminates the waste of label by deleting the flow binding efficiently. With the traces of real Internet traffics, we evaluate the performance of these schemes by simulation. The label efficiency, the average number of label used, and the percentage of packets switched and the number of packets switched are used as performance measures for this simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.923-930
• /
• 2001

In this paper, in order to improve the performance of TCP short traffic services in wireless Internet environments, the Split-ACKs(SPACK) scheme is proposed. In wireless networks, unlike wired networks, packet losses will occur more often due to high bit error rates. Therefore, each packet loss over wireless links results in congestion control procedure of TCP being invoked at the source. This causes severe end-to-end performance degradation of TCP. In this paper, to alleviate the TCP performance, the SPACK method, split acknowledgement packets in the base station, is proposed. Using computer simulation, the performance of TCP using SPACK is analyzed and shows better performance than traditional TCP protocol.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.68-75
• /
• 2004

In this paper, n study a distributed establishment scheme to setup lightpath in WDM/TDM Network considering user traffic characteristics. We propose a GBTA(guaranteed-bandwidth time-slot allocation) algorithm which assigns time-slots according to the requred traffic so that it can utilize given network resources efficiently in RWTA(routing and wavelength time-slot assignment) schemes. We consider traffic specification on the basis of ATM traffic classes. Also, in order to increase link utilization and minimize blocking probability, we extend distributed lightpath establishment protocol based on GBTA algorithm. In order to establish lightpath in distributed WDM/IDM network, we use backward resonation protocol that resewes resource with recent information. We use DOWTns(Distributed Optical WDM/TDM ns) that is extended from NS(Network Simulator), in order to verify proposed GBTA-based optical wavelength routed network.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.1-9
• /
• 2002

Converged LAN accepts diverse traffics so that performance analysis is very important for successful development of converged LAN. In this paper, we develop simulation program using SALM II and simulate queue management scheme and scheduling algorithm for converged LAN. The result of simulation shows the effect of performance for cyclic service algorithm larger than priority algorithm using weight. And queue management can be easy by implementation of Back Pressure scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.147-151
• /
• 2002

One of the main issues in Diffserv AS architecture is guaranteeing fairness among the flows which have their own QoS requirements. Because the methodology of resource allocation and traffic conditioning would affect the end-to-end QoS and backbone link utilization. In this paper, we propose a variant of TSW algorithm for enhancing fair bandwidth allocation and link utilization and presents performance evaluation between TSW & TS2W3C through NS-2 Simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.757-763
• /
• 2006

In this paper, a novel multiple access scheme using SMA(Split and Merge Algorithm) is proposed to reduce the accessdelay of wireless MAC protocols. The key idea of the SMA is to dynamically split and merge the contending terminals depending on their traffic loads for effective control of access to the channels. The SMA divides the collided terminals into several sub-groups if a collision occurs and merges the idle terminals of the split sub-groups into their original group. The merge algorithm can be used to resolve collision and split operation can be used to dynamic group management. The simulation results indicate that our algorithm may provide a higher throughput and a lower collision rate than the existing algorithms, especially under heavy traffic loads.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1125-1134
• /
• 2013

Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.8-17
• /
• 2006

Recently, the high-speed Internet users increase rapidly and broadband networks have been widely deployed. However, the current TCP congestion control algorithm was designed for relatively narrowband network environments, and thus its performance is inefficient for traffic transport in broadband networks. To remedy this problem, the TCP having an enhanced congestion control algorithm is required for broadband networks. In this paper, we propose an improved TCP congestion control that can sufficiently utilize the large available bandwidth in broadband networks. The proposed algorithm predicts the available bandwidth by using ACK information and RTT variation, and prevents large packet losses by adjusting congestion window size appropriately. Also, it can rapidly utilize the large available bandwidth by enhancing the legacy TCP algorithm in congestion avoidance phase. In order to evaluate the performance of the proposed algorithm, we use the ns-2 simulator. The simulation results show that the proposed algorithm improves not only the utilization of the available bandwidth but also RTT fairness and the fairness between contending TCP flows better than the HSTCP in high bandwidth delay product network environment.