• ETRI Journal
• /
• v.19 no.1
• /
• pp.13-25
• /
• 1997

In this paper, we propose a new queuing model, MMDP/MMDP/1/K, for an asynchronous transfer mode(ATM) multiplexer with multiple quality of service(QoS) variable bit rate (VBR) traffic in broadband-integrated services digital network (B-ISDN). We use the Markov Modulated Deterministic Process(MMDP) to approximate the actual arrival process and another MMDP for service process Using queuing analysis, we derive a formula for the cell loss probability of the ATM multiplexer in terms of the limiting probabilities of a Markov chain. The cell loss probability can be used for connection admission control in ATM multiplexer and the calculation of equivalent bandwidth for arrival traffic, The major advantages of this approach are simplicity in analysis, accuracy of analysis by comparison of simulation, and numerical stability.

• ETRI Journal
• /
• v.22 no.3
• /
• pp.1-9
• /
• 2000

Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.791-794
• /
• 1999

A principle requirement and technical standardization for numbering plan is required to B-lSDN network planning. Especially, internetworking high speed network with other conventional networks like PSTN, PSDN and ISDN is generally considered for integration. This paper describes the numbering plan for operation between internet and ATM. And based on the ITU-U specification, numbering plan is compared between conventional and high speed networks. Additionally, numbering plan for ATM-forum is analyzed.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.361-364
• /
• 2003

The customer premise facilities assume an important role in the telecommunication networks. The present technical standards for domestic customer cabling facilities are established with the multimedia environment reflected, but are insufficient for accommodation of multimedia services of the ultra high-speed information and communication networks In the present paper, the status of international standardization as well as technical standards in the U.S.A., Japan, other countries are reviewed and the domestic technical standard and emblem is investigated and analyzed in order to enhance customer cabling facilities in Korea. The problems with emblem are analyzed, and how to improve customer cabling telecommunication facilities is suggested based on the above.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.344-354
• /
• 2014

Transmission control protocol friendly rate control (TFRC) is designed to mainly provide optimal service for unicast applications, such as multimedia streaming in the best-effort Internet environment. However, high bandwidth networks with large delays present an environment where TFRC may have a problem in utilizing the full bandwidth. TFRC inherits the slow-start mechanism of TCP Reno, but this is a time-consuming process that may require many round-trip-times (RTTs), until an appropriate sending rate is reached. Another disadvantage inherited from TCP Reno is the RTT-unfairness problem, which severely affects the performance of long-RTT flows. In this paper, we suggest enhanced TFRC for high quality video streaming over high bandwidth delay product networks. First, we propose a fast startup scheme that increases the data rate more aggressively than the slow-start, while mitigating the overshooting problem. Second, we propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows that compete for the same narrow link with different RTTs. Finally, we improve the responsiveness of TFRC in the presence of severe congestion. Simulation results have shown that our proposal can achieve a fast startup and provide fairness with competing flows compared to the original TFRC.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.25-32
• /
• 2003

4G mobile communication system requires the throughput of 10-100Mbps. Adaptive modulated OFDM system is promising technique for increasing the throughput. In the pilot symbol assisted high-speed packet transmission system, the data symbol duration is generally considered to be small compared to the coherence time. However, OFDM symbol duration is longer than the symbol duration of a single carrier system, so that the packet duration of the pilot symbol assisted high speed packet transmission system is long. In this case, the change of channel conditions is too fast to be accurately estimated by channel estimator at the receiver in high Doppler frequency, so that many errors occur during demodulation, especially with the data symbols at the end of each packet. In this paper, we consider the BER at various instantaneous $E_b/N_o$ that includes the demodulation errors in high Doppler frequency. When the coherence time is ten times longer than the duration of a single packet, the channel can be closely approximated as an AWGN channel. Otherwise, the approximation breaks down and the above-mentioned errors that occur during demodulation must be taken into consideration. In this paper, we propose the pilot symbol assisted high speed packet transmission system based on adaptive OFDM using a novel lookup table to consider the demodulated errors and evaluate the throughput performance.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.227-230
• /
• 2009

In this paper, the results of field testing of high-speed power line in-home networking in Korea are reported. When multiple networks share a common channel, they can interfere destructively and reduce system capacity. This is major problem in-home power line communications, especially in MDU deployments. The effects of neighboring network interference in power line communications are reported.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2634-2636
• /
• 2002

This paper describers the implementation of cyber apartment internet contents based on HSPLC(high speed power line communication) subscribers networks.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1013-1016
• /
• 1993

This paper describes a new type of neuron model, the inputs of which are interfered with one another. It has a high mapping ability with only single unit. The learning speed is considerably improved compared with the conventional linear type neural networks. The proposed neuron model was successfully applied to the prediction problem of chaotic time series signal.