• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2822-2831
• /
• 1997

A B-ISDN network based on ATM must support several kinds of transport services with different traffic characteristics and service requirements. There is neither link-by-link flow control nor error control in the ATM layer. For different services, different flow/error controls could be performed at the AAL layer or at a higher Iayer(e.g. transport layer). In traditional data networks, the window now control mechanism combined with error control was used prevalently. But, the window flow control mechanism might be useless in ATM networks because the propagation delay is too large compared with the transmission rate. In this paper, we propose a simple flow control mechanism, called RCT(Rate Control for end-to-end Transport), for end-to-end data transport. The RCT shows acceptable performance when the average overload period is bounded by a certain time.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.375-384
• /
• 2002

In the current Internet, the QoS of interactive applications is hardly guaranteed because of variable bandwidth, packet loss and delay. Moreover, VoIP which is becoming an important part of the information infra-structure in these days, is susceptible to network packet loss and end-to-end delay. Therefore, it needs error control mechanisms in network level or application level. The FEC-based error control mechanisms are used for interactive audio application such as VoIP. The FEC sends a main information along with redundant information to recover the lost packets and adjusts redundant information depending on network conditions to reduce the bandwidth overhead. However, because most of the error control mechanisms do not consider end-to-end delay but packet loss rate, their performances are poor. In this paper, we propose a new error control algorithm, SCCRP, considering packet loss rate as well as end-to-end delay. Through experiments, we confirm that the SCCRP has a lower packet loss rate and a lower end-to-end delay after reconstruction.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.39-46
• /
• 2004

In this paper, we carry out a performance study related to the Broadband Network. For this network, it has been proposed to use the leaky bucket as a way of controlling congestion within the network. On the top of leaky bucket type rate based congestion control scheme for high speed networks, a user will typically operate an error control scheme for retransmitting lost and erroneous packets. We propose a performance model in order to study the interaction between a user's error control scheme and the leaky bucket congestion control scheme for high speed networks. Simulation results show that parameters such as the window size and the token generation rate in the leaky bucket are key factors affecting the end-to-end delay.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.39-46
• /
• 2005

As the multimedia application traffic takes more portion in the internet traffic, it is necessary to control the network congestion through the congestion control protocol. In addition, the QoS-enabled networks such as DiffServ become an indispensable technology when running the multimedia applications. However, the previously proposed end-to-end congestion control algorithms take the round trip time to react the network congestion. Thus, as the RTT becomes larger, the reaction against the congestion gets delayed further, while the network congestion gets worse. In addition the performance of end-to-end congestion control algorithm is degraded if the QoS-enabled network runs the congestion control mechanism in the network level without any coordination between them. In this paper, we propose the early rate adaptation protocol for the DiffServ network which effectively linke the congestion control algorithm at the host and the congestion mechanism in the network together. By taking advantage of early congestion notification from the network it is possible to react the network congestion more quickly and effectively.

• Journal of the Semiconductor & Display Technology
• /
• v.16 no.2
• /
• pp.79-84
• /
• 2017

This paper outlines the Taguchi optimization methodology, which is applied to optimize cutting parameters in end milling when machining STS304 with TiAlN coated SKH59 tool under up and down end milling conditions. The end milling parameters evaluated are depth of cut, spindle speed and feed rate. An orthogonal array, signal-to-noise (S/N) ratio and analysis of variance (ANOVA) are employed to analyze the effect of these end milling parameters. The Taguchi design is an efficient and effective experimental method in which a response variable can be optimized, given various control and noise factors, using fewer resources than a factorial design. An orthogonal array of $L_9(33)$ was used. The most important input parameter for cutting force, however, is the feed rate, and depending on the cutter rotation direction. Finally, confirmation tests verified that the Taguchi design was successful in optimizing end milling parameters for cutting force.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.476-479
• /
• 2008

Wireless Sensor Network typically incorporates various real time applications that must meet timing constraints under severe resource limitations. Due to the high data rate and burst traffic for that type of applications, occurrence of congestion is very common. Ensuring the end-to-end deadline under congested scenario is quite challenging. In this paper we propose a hop-by-hop rate control algorithm which avoids the congestion as well as ensures that the real time traffic will meet the end-to-end deadline by guaranteeing the meeting of local deadline at intermediate hop. Finally, simulation has demonstrated the effectiveness of our approach.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2715-2720
• /
• 2009

Supporting Quality of Service (QoS) for multimedia services in heterogeneous mobile networks is a part of key issue for Three Generation Evolution (3GE) development. A QoS management structure needs to guarantee the QoS of moving users based on an end-to-end negotiation to support the seamless service when MT is moving between the heterogeneous networks. We propose an end-to-end negotiation method based on SLA(Service Level Agreement). For this aim, the SLA control and algorithm for supporting MT's QoS is considered. Simulation is focused on the average delay and packet loss rate, and the results show that our proposed method provides mobile terminals with the optimal performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.747-752
• /
• 2004

Researches about scheduling of the distributed real-time systems have been proposed. However, they have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. So this paper proposes a new scheduling method for distributed real-time systems consisting of sporadic and periodic tasks with precedence relations and sporadic and periodic messages, guaranteeing end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic (RM) scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.