• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.43-51
• /
• 2002

In this paper, we study the new packet dropping scheme using an active queue management algorithm. Active queue management mechanisms differ from the traditional drop tail mechanism in that in a drop tail queue packets are dropped when the buffer overflows, while in active queue management mechanisms, packets may be dropped early before congestion occurs, However, it still incurs high packet loss ratio when the buffer size is not large enough, By detecting congestion and notifying only a randomly selected fraction of connection, RED causes to the global synchronization and fairness problem. And also, it is the biggest problem that the network traffic characteristics need to be known in order to find the optimum average queue length, We propose a new efficient packet dropping method based on the active queue management for congestion control. The proposed scheme uses the per-flow rate and fair share rate estimates. To this end, we present the estimation algorithm to compute the flow arrival rate and the link fair rate, We shows the proposed method improves the network performance because the traffic generated can not cause rapid fluctuations in queue lengths which result in packet loss

• Journal of Internet of Things and Convergence
• /
• v.6 no.3
• /
• pp.1-6
• /
• 2020

This paper aims to integrate the previous models about mean object transfer latency in one framework and analyze the result through the computational experience. The analytical object transfer latency model assumes the multiple packet losses and the Internet of Things(IoT) environment including multi-hop wireless network, where fast re-transmission is not possible due to small window. The model also considers the initial congestion window size and the multiple packet loss in one congestion window. Performance evaluation shows that the lower and upper bounds of the mean object transfer latency are almost the same when both transfer object size and packet loss rate are small. However, as packet loss rate increases, the size of the initial congestion window and the round-trip time affect the upper and lower bounds of the mean object transfer latency.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.141-155
• /
• 2002

A medium access control protocol is proposed for integrated voice and data services in the packet CDMA network with a small coverage. Uplink channels are composed of time slots and multiple spreading codes for each slot. This protocol gives higher access priority to the delay-sensitive voice traffic than to the data traffic. During a talkspurt, voice terminals reserve a spreading code to transmit multiple voice packets. On the other hand, whenever generating a data packet, data terminals transmit a packet based on the status information of spreading codes in the current slot, which is received from base station. In this protocol, voice packet does not come into collision with data packet. Therefore, this protocol can increase the maximum number of voice terminals.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.5
• /
• pp.807-816
• /
• 2021

With the technology of the 4th industrial revolution, network traffic is increasing due to an increase in supply, an increase in demand, and an increase in the complexity of traffic patterns. SDN, a concept in which H/W and S/W are separated in order to efficiently manage such massive traffic, is attracting attention as a next-generation network. A lot of research is being conducted on the merits of applying flexible policies by avoiding the problem of rigid vendor dependency by using the SDN controller implemented with S/W Opensource. Therefore, in this paper, we propose an efficient load balancing technique by grouping through the packet structure of the network layer using the control layer and infrastructure layer of SDN and analyzing the packet delay and reception rate.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.331-333
• /
• 2004

본 논문에서는 SIP(Session initiation Protocol) 기반의 VoIP(Voice over Internet Protocol) 시스템에 효율적인 call-control을 위해 필요한 헤더와 파라미터를 추가한 Extension SIP를 제안하였다. 또한 이 제시된 Extension SIP에 따르는 SIP Proxy Server와 User Agent(User Agent Client, User Agent Server)를 리눅스 시스템에서 C언어를 통해 구현하였고, 이 구현된 Extension SIP 시스템을 통해 기존의 SIP 시스템과 cail-control을 위한 packet traffic을 비교.분석 함으로써 제안한 Extension SIP의 효율성 을 증명하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.417-424
• /
• 2003

In this paper, we introduce and analyze a feedback control model of TCP/AQM dynamics. Then, we propose the Pro-active Queue Management (PAQM) mechanism, which can provide proactive congestion avoidance and control using an adaptive congestion indicator and a control function for wide range of traffic environments. The PAQM stabilizes the queue length around a desired level while giving smooth and low packet loss rates independent of the traffic load level under a wide range of traffic environment. The PAQM outperforms other AQM algorithms such as Random Early Detection (RED) [1] and PI-controller [2]

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.1
• /
• pp.25-39
• /
• 1986

In this paper, we analyze the performance, particularly the flow control mechanism, of the CCITT X.25 protocol in a packet-switched network. In this analysis, we consider the link and packet layers separately, and investigate the performance in three measures; normalized channel throughput, mean transmission time, and transmission efficiency. Each of these measures is formulated in terms of given protocol parameters such as windos size, $T_1$ and $T_2$ values, message length, and so forth. We model the service procedure of the inpur traffic based on the flow control mechanism of the X.25 protocol, and investigate the mechanism of the sliding window flow control with the piggybacked acknowlodgment scheme using a discrete-time Markov chain model. With this model, we study the effect of variation of the protoccol parameters on the performance of the X.25 protocol. From the numerical results of this analysis one can select the optimal valuse of the protocol parameters for different channel environments. it has been found that to maintain the trasnmission capacity satisfactorily, the window size must be greater than or equal to 7 in a high-speed channel. The time-out value, $T_1$, must carefully be selected in a noisy channel. In a normal condition, it should be in the order of ls. The value of $T_2$ has some effect on the transmission efficiency, but is not critical.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.154-161
• /
• 2010

In wireless sensor networks, due to the many-to-one convergence of upstream traffic, congestion more probably appears. The existing congestion control protocols avoid congestion by controlling incoming traffic, but the duty-cycle operation of MAC(Medium Access Control) layer has not considered. In this paper, we propose DCA(Duty-cycle Based Congestion Avoidance), an energy efficient congestion control scheme using duty-cycle adjustment for wireless sensor networks. The DCA scheme uses both a resource control approach by increasing the packet reception rate of the receiving node and a traffic control approach by decreasing the packet transmission rate of the sending node for the congestion avoidance. Our results show that the DCA operates energy efficiently and achieves reliability by its congestion control scheme in duty-cycled wireless sensor networks.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.403-408
• /
• 2010

The sensor nodes can be installed in the environment in which the temperature change is considerable, such as desert, urban, and data center. Particularly, because the output power becomes less than the targeted power if a temperature is increasing, link quality is degraded and packet losses are occurred. In order to compensate the temperature changes, existing schemes detect the change of the link quality between nodes and control transmission power through a series of feedback process. However, these approaches can cause heavy overhead by additional control packets. In this paper, we propose the T2PC(Temperature-aware Transmission Power Control) to keep up the link quality despite temperature variation. At each node, T2PC compensates the attenuated link quality by controlling the transmission power based on the local temperature measurement. In addition, the packet reception ratio can be improved with less control packets than ones required in existing transmission power control methods based on the feedback control.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.762-777
• /
• 2014

With the increasing usage of cloud applications such as MapReduce and social networking, the amount of data traffic in data center networks continues to grow. Moreover, these appli-cations follow the incast traffic pattern, where a large burst of traffic sent by a number of senders, accumulates simultaneously at the shallow-buffered data center switches. This causes severe packet losses. The currently deployed TCP is custom-tailored for the wide-area Internet. This causes cloud applications to suffer long completion times towing to the packet losses, and hence, results in a poor quality of service. An Explicit Congestion Notification (ECN)-based approach is an attractive solution that conservatively adjusts to the network congestion in advance. This legacy approach, however, lacks scalability in terms of the number of flows. In this paper, we reveal the primary cause of the scalability issue through analysis, and propose a new congestion-control algorithm called FaST. FaST employs a novel, virtual congestion window to conduct fine-grained congestion control that results in improved scalability. Fur-thermore, FaST is easy to deploy since it requires only a few software modifications at the server-side. Through ns-3 simulations, we show that FaST improves the scalability of data center networks compared with the existing approaches.