• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.63-68
• /
• 2019

Emerging applications such as Smart factory, in-car network, wide area power network require strict bounds on the end-to-end network delays. Flow-based scheduler in traditional Integrated Services (IntServ) architecture could be possible solution, yet its complexity prohibits practical implementation. Sub-optimal class-based scheduler cannot provide guaranteed delay since the burst increases rapidly as nodes are passed by. Therefore a leaky-bucket type regulator placed next to the scheduler is being considered widely. This paper proposes a simple server that achieves both fair scheduling and traffic regulation at the same time. The performance of the proposed server is investigated, and it is shown that a few msec delay bound can be achieved even in large scale networks.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.192-206
• /
• 2008

Multihop is the main communication style for wireless sensor networks composed of tiny sensor nodes. Until now, most applications have treated the periodic small sized sensing data. Recently, the burst traffic with the transient and continuous nature is increasingly introduced due to the advent of wireless multimedia sensor networks. Therefore, the efficient communication protocol to support this trend is required. In this paper, we propose a novel PIGAB(Packet Interval Gap based on Adaptive Backoff) protocol to efficiently transmit the burst data in multihop wireless sensor networks. The contention-based PIGAB protocol consists of the PIG(Packet Interval Gap) control algorithm in the source node and the MF(MAC-level Forwarding) algorithm in the relay node. The PIGAB is on basis of the newly proposed AB(Adaptive Backoff), CAB(Collision Avoidance Backoff), and UB(Uniform Backoff). These innovative algorithms and schemes can achieve the performance of network by adjusting the gap of every packet interval, recognizing the packet transmission of the hidden node. Through the simulations and experiments, we identify that the proposed PIGAB protocol considerably has the stable throughput and low latency in transmitting the burst data in multihop wireless sensor networks.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.6
• /
• pp.187-194
• /
• 2020

This paper proposes a website fingerprinting method using ensemble learning over a Tor network that guarantees client anonymity and personal information. We construct a training problem for website fingerprinting from the traffic packets collected in the Tor network, and compare the performance of the website fingerprinting system using tree-based ensemble models. A training feature vector is prepared from the general information, burst, cell sequence length, and cell order that are extracted from the traffic sequence, and the features of each website are represented with a fixed length. For experimental evaluation, we define four learning problems (Wang14, BW, CW_T, CW_H) according to the use of website fingerprinting, and compare the performance with the support vector machine model using CUMUL feature vectors. In the experimental evaluation, the proposed statistical-based training feature representation is superior to the CUMUL feature representation except for the BW case.

• Journal of IKEEE
• /
• v.3 no.1 s.4
• /
• pp.22-28
• /
• 1999

The existing CREG-VP, a technique to compensate the successive cell losses caused by traffic congestion using the FEC method on the Vp, has the merits of the short average encoding decoding time and the compatibility with the ATM standard cell format, but it has the restriction in the number of regenerable cells. In this thesis, we propose a scheme to efficiently regenerate the cell losses even in the burst traffic property by the expansion of the CREG-VP. The proposed scheme improves the detection capability of the lost cells by changing the CRP and the regeneration performance of the successive cells by using the interleaved parity cell. The simulation result shows that the proposed method produces much improvements compared with the existing ones in the cell loss rate reduction factor.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.337-352
• /
• 2005

In this paper, a fuzzy logic implementation of the random early detection (RED) mechanism [1] is presented. The main objective of the proposed fuzzy controller is to reduce the loss probability of the RED mechanism without any change in channel utilization. Based on previous studies, it is clear that the performance of RED algorithm is extremely related to the traffic load as well as to its parameters setting. Using fuzzy logic capabilities, we try to dynamically tune the loss probability of the RED gateway. To achieve this goal, a two-input-single-output fuzzy controller is used. To achieve a low packet loss probability, the proposed fuzzy controller is responsible to control the $max_{p}$ parameter of the RED gateway. The inputs of the proposed fuzzy controller are 1) the difference between average queue size and a target point, and 2) the difference between the estimated value of incoming data rate and the target link capacity. To evaluate the performance of the proposed fuzzy mechanism, several trials with file transfer protocol (FTP) and burst traffic were performed. In this study, the ns-2 simulator [2] has been used to generate the experimental data. All simulation results indicate that the proposed fuzzy mechanism out performs remarkably both the traditional RED and Adaptive RED (ARED) mechanisms [3]-[5].

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1242-1250
• /
• 2015

It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high-rate wireless personal area network (HR-WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable-service interval-based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR-WPAN compared to existing schemes.

• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.62-69
• /
• 2005

This paper presents a queuing analysis model of a PC-based software router supporting IPv6-IPv4 translation for residential gateway. The proposed models are M/G/1/K or MMPP-2/G/1/K by arrival process of the software PC router. M/G/1/K is a model of normal traffic and MMPP-2/G/1/K is a model of burst traffic. In M/G/1/K, the arriving process is assumed to be a Poisson process, which is independent and identically distributed. In MMPP-2/G/1/K, the arriving process is assumed to be two-state Markov Modulated Poisson Process (MMPP) which is changed from one state to another state with intensity. The service time distribution is general distribution and the service discipline of the server is processor sharing. Also, the total number of packets that can be processed at one time is limited to K. We obtain performance metrics of PC-based software router for residential gateway such as system sojourn time blocking probability and throughput based on the proposed model. Compared to other models, our model is simpler and it is easier to estimate model parameters. Validation results show that the model estimates the performance of the target system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1719-1729
• /
• 1994

In this paper, an adaptive CAC(Connection Admission Control) method is proposed. The adaptive CAC uses traffic estimates derived from both traffic parameter specified by user and cell flow measurements. Traffic estimation using user-specified parameters is performed at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. Traffic estimation using cell flow measurement is carried out when the number of connected calls does not change during a measurement reflection period-renewal period. The most import ant thing for the traffic estimation using cell flow measurement is the determination of the length of a renewal period to trace a real traffic flow with an allowable time lag and the measurement reflection ratio(MRR) both to reduce the portion of overestimation and to avoid underestimation of real traffic flow. To solve these problems, the adaptive CAC updates renewal period and MRR adaptively according to the number of connections and the elapsed time after last connection or release respectively. Performance analysis for the proposed method is evaluated in several aspects for the cases of both homogeneous and heterogeneous bursty traffic. Numerical examples show the adaptive CAC method has the better performance compared with conventional CAC method based on burst model from the both utilization and QOS point of view.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.5
• /
• pp.63-68
• /
• 1998

광대역 정보통신망(B-ISDN)에 적합한 직접 제공법의 스트리밍모드 비연결형 서버 는 단일 셀의 전송시간 동안 셀의 송·수신 및 룩업(lookup)을 수행해야 한다는 시간적인 제약을 받기 때문에 버스트 트래픽(Burst Traffic)이 발생했을 경우 셀 손실이 많다는 단점 을 가지고 있다. 따라서 본 논문에서는 ATM 망의 스트리밍 모드 비연결형 서버가 고속으 로 데이터를 처리하여 셀 손실을 줄일 수 있도록 하기 위해 DBLCAM을 제안하였으며, 입 력 VPI(Virtual Path Identifier)/VCI(Virtual Channel Identifier)에 대한 연결 번호를 출력하 는 기능의 포워딩 테이블 VPC맵을 제안된 DBLCAM과 이중 포트 SRAM을 이용하여 설계 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.778-780
• /
• 2001

ATM(Asynchronous Transfer Mode) 망은 사용자의 요구에 의해 대역폭을 할당한 수 있으므로 전송에 필요한 대역폭이 수시로 변화하는 MPEG 비디오를 전송하는데 적합하다. 그러나 MPEG 트래픽(traffic)은 셀(cell) 발생량의 변화가 심한 군집성 (burst)이 큰 트래픽 이기에 전송 품질을 유지하면서 동시에 망의 대역폭을 효율적으로 사용하는 전송을 구현하기가 매우 힘들다. 본 연구에서는 이러한 상반되는 두 가지의 목적을 수행하기 위하여 새로운 대역폭 할당 기법을 제안하였다. 사용자에게 최소한의 품질을 보장하면서 망에 대역폭의 여유가 있는 경우 고품질의 서비스가 가능토록 하는 방안으로 ATM 망의 CBR(Constant Bit Rate) 서비스와 VBR(Variable Bit Rate) 서비스를 복합적으로 사용하는 방법을 제안하였다. 이의 구현을 위하여 2 계층 구조의 MPEG 부호화기를 설계, 구현하였고 모의 실험을 통하여 기존의 단일 계층 CBR 서비스에 비하여 품질과 망의 효율성에 있어 충분히 우수함을 확인하여 그 효용성을 증명하였다.