• ETRI Journal
• /
• v.28 no.6
• /
• pp.777-786
• /
• 2006

Since the introduction of competition in the telecommunication market due to the growth of the interconnection between heterogeneous networks, particularly fixed and mobile networks, the interconnection charge based on traffic-sensitive (TS) and non-traffic-sensitive (NTS) costs has become more important. Although there have been many studies of the public switched telephone network (PSTN), previous studies of TS and NTS costs in mobile networks are very few. In this paper, as a pilot study, we propose three criteria and a procedure for the classification of TS and NTS costs based on mobile systems. The three criteria are the following: function type, investment requirement, and main exhaust driver. Moreover, for a CDMA mobile system, strongly TS, strongly NTS, and mixed components are classified by the proposed criteria and procedure. The proposed criteria, procedure, and classification can provide a systematic and useful guideline to decide the scope of mobile facilities and to determine the terminating cost on mobile networks from fixed networks.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.6
• /
• pp.23-32
• /
• 1996

This paper proposes a new buffer management scheme to service delay-sensitive traffic and loss-sensitive traffic fairly in ATM networks. The proposed scheme uses tow buffers for delay-sensitive traffic and loss-sensitive traffic. To satisfy the average delay time of delay-sensitive traffic, cells in real-time buffer are served first. When congestion occurs in nonreal-time buffer, low loss priority cell in real-time buffer can be pushed out by high loss priority cell in nonreal-time buffer can be transferred to real-time buffer considering threshold value in real-time buffer. Using computer simulation, the existing methods and proposed scheme are compared and analyzed with respect to cell loss rate and average delay time. Simulation results show that the proposed scheme have superior performance to conventional schemes.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.3-11
• /
• 2000

This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. TBPJ scheme shows also better performance than that of HOL scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.667-676
• /
• 1995

In ATM traffic multiplexing, the cell clumping and the cell dispersion are occured due to the cell delay variance(CDV) which changes the traffic characteristics. These cell variances increase the burstiness of t.he cell streams and make the network congested. The function of the traffic shaping is necessary to transmit the input streams into the networks or into the traffic policing schemes with some intevals. Most of the existing studies regard the input traffics as the traffic with the identical characteristics. In this study, the traffic shaping is processed by considering the traffic characteristICS with t.he loss-sensitive traffic and the delay-sensitive traffic. The traffic shaping model and the traffic shaping algorithm which considers the" characteristics of input streams have been presented. The traffic effect On t.he CDV size is also studied. The proposed scheme is compared to Virtual Scheduling Algorithm(VSA) and the efficiency of the proposed scheme is evaluated. According to the simulation results, t.he mean delay is decreased about 12% in delay-sensitive traffic and the traffic burstiness is decreased about 11 % in loss-sensitive traffic.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.806-817
• /
• 2016

Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.41-44
• /
• 2000

Because of internet's growth, today's network has a serious bandwidth problem. WDM(Wavelength Division Multiplexing) is a solution of this problem. In the WDM networks, QoS(Quality of Service) is as important as bandwidth. And today's voice over IP technology makes a lot of delay-sensitive internet traffic. De]ay-sensitive internet traffic is growing up, so more QoS is needed. We proposed effective solution to assign QoS.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.591-595
• /
• 1998

This paper proposes a new concept of optimal shortest path algorithm which reduce average vehicle wating time and improve average vehicle speed, Electro sensitive traffic system can extend the traffic cycle when three are many vehicles on the road or it can reduce the traffic cycle when there are small vehicles on the road. But electro sensitive traffic light system doesn't control that kind of function when the average vehicle speed is 10km -20km. Therefore, in this paper to reduce vehicle waiting time we developed design of traffic cycle software tool that can arrive destinination as soon as possible using optimal shortest pass algorithm. Computer simulation result proved 10%-32% reducing average vehicle wating time and average vehicle speed which can select shortest route using built in G.P.S. vehicle is better than not being able to select shortest route function.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.330-337
• /
• 2000

This paper proposes a new concept of coordinating green this which controls 10 traffic intersection systems. For instance, if we have a baseballs game at 8 pm today, traffic volume toward the baseball game at 8 pm today, traffic volume toward the baseball game will be incr eased 1 hour or 1 hour 30 minutes before the baseball game. at that time we can not pred ict optimal green time Even though there have smart elctrosensitive traffic light system. Therefore, in this paper to improve average vehicle speed and reduce average vehicle waiting time, we created optimal green time using fuzzy rules and neural network. Computer simulation results proved reducing average vehicle waiting time proposed coordinating green time better than electro-sensitive traffic light system. Therefore, in this paper to improvevehicle speed and reduce average vehicle waiting time, we created optiual green time fuzzy rules and neural network. Computer simulation results proved reducing average vehicle waiting time which proposed coordinating green time better than electro-sensitive traffic light system dosen't consider coordinating green time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2184-2196
• /
• 1998

Admission control is one of the most important congestion control mechanism to be executed at the call set up phase by regulating traffic into a network in a preventive way. An efficient QOS evaluation or bandwidth estimation method is required for call admission to be decided in real time. In this paper, we spropose a computtionally simple approximation method of estimating cell loss probability and mean cell delay for admission control of both delay sensitive and loss sensitive calls. Mixed input queueing system, where a new call combines with the existing traffic, is used as a queueing model for QOS estimation. Also traffic parameters are suggested to characterize both a new call and existing traffic. Aggregate traffic is approximated by a renewal process with these traffic parameters and then mean delay and cell loss probability are detemined using appropriate approximation formulas. The accuracy of this approximation approach is examined by comparing their results with exact analysis or simulation results of vrious mixed unput queueing systems. Based on this QOS estimation method, call admission control scheme which is traffic independent and computable in yeal time are proposed.