• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.571-580
• /
• 2002

In this paper, we relatively differentiate maximum delay for each Assured Service subclass in Differentiated Services by allocating bandwidth to each subclass differently. To maximize the throughput for the In-profile traffic and the link utilization, we propose a Cofiguration method of RIO and the admission control criterion based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. Simulation results show that the proposed method can calculate the capacity to guarantee the QoS for the Assured Service and maximize the throughput for the In-profile traffic and the link utilization by applying the RIO parameter values set through the proposed configuration method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1153-1160
• /
• 2021

This paper proposes a routing algorithm that determines the optimal path using deep reinforcement learning in software-defined networks. The deep reinforcement learning model for learning is based on DQN, the inputs are the current network state, source, and destination nodes, and the output returns a list of routes from source to destination. The routing task is defined as a discrete control problem, and the quality of service parameters for routing consider delay, bandwidth, and loss rate. The routing agent classifies the appropriate service class according to the user's quality of service profile, and converts the service class that can be provided for each link from the current network state collected from the SDN. Based on this converted information, it learns to select a route that satisfies the required service level from the source to the destination. The simulation results indicated that if the proposed algorithm proceeds with a certain episode, the correct path is selected and the learning is successfully performed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.25-30
• /
• 2005

We propose and design a fully conversed Ethernet and TDM transport system to guarantee qualify of service for Ethernet packet. Developed convergence system can support not only L2 VPN service and premium multimedia service based on MPLS protocol but also TDM leased line service, simultaneously. Developed convergence system has the advantage of providing high reliability that realizes high-quality and real time communications due to assign QoS profile and guarantee bandwidth per channel consist of VCGs without affect adjacent channels. Evaluation for proposed system was successfully performed within the ling network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.300-301
• /
• 2016

This paper proposes customized recommendation algorithm to improve the QoS(quality of service) of sport for all sports content uses to user profile and team grade. The proposed recommendation module is based on user profile information, and it recommends suitable team contents to user with Euclidean distance algorithm and preference weights between teams.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.86-100
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.314-324
• /
• 2004

Recently, high-speed internet subscribers have grown continuously, and reached up to 10 millions. But existing network management that is responsible only for user access is confronted with many difficulties, since user access network(xDSL, Cable, B-WILL, and so on) has diversified and value added wired/wireless contents service has developed. In this paper propose the Agent based Inter Networking platform as object-oriented hierarchical system that can provide various service such as access QoS(Quality of Service), customized application service and security service according to user on demand. This system has divided into two parts(user agent and agent management system ＆ local and central management systems). Management system periodically receive status information such as bandwidth, download speed, delay, current service, and so on, and process them, then build a policy based on processed information. According to personal user profile that is generated by this policy, the customized service can be provided for users. And This system adopt the object-oriented modeling in case that system migration and integration, and implement a system that is robust and stable for security through hierarchical server system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.711-721
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as fur UDP sources. In this paper, to improve TCP fairness of the REDP marker, we combine a dropper with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays In demotion region without incoming demoted in-profile packets. It performs a dropping in the demotion at a domain boundary only if there is no prior demotion. The concatenate dropping at multiple domains is avoided to manifest the effect of a dropping at a domain boundary on TCP fairness. We experiment with the REDP marker with the combined dropper using ns2 simulator for TCP sources. The simulation results show that the REDP marker with the combined dropper improves TCP fairness in demoting and promoting packets by generating fair demoted in-profile traffic compared to the REDP marker. The effectiveness of the selected drop probability is also investigated with showing its impact on the performance of the REDP marker with the combined dropper.

• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.740-753
• /
• 2010

Performance of TCP can be severely degraded in WLP-based Mobile IP wireless networks where packet loss not related to network congestion occurs frequently during WLP-based inter-subnetwork handoff by user mobility. To resolve such a problem in the networks using WLP-based Mobile IP, the packet buffering method recovering seamlessly the packets dropped due to user mobility has been proposed. The packet buffering method at a bridge station recovers those packets dropped during handoff by forwarding buffered packets at the old bridge station to the WLP device. But, when the WLP device moves to a congested bridge station in a new WLP foreign subnetwork, those buffered packets forwarded by the old bridge station are dropped and TCP transmission performance of a WLP device in the congested bridge station degrades due to increased congestion by those forwarded burst packets. In this paper, a PBM(Packet Bridge Marker) is proposed for preventing buffered out-of-profile(OUT) packets from reducing the throughput of in-profile(IN) packets of an Assured Service WLP device. From this operation, the packet losses of buffered OUT packets are avoided and the throughput of IN and Total packets of an AS WLP device are increased.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.5
• /
• pp.401-415
• /
• 2005

Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the resource weighted load distribution policy is proposed for a fair load balance and a more scalable performance in cluster-based transcoding servers. Our proposed policy is based on the resource weighted table and number of maximum supported users, which are pre-computed for each pre-defined grade. We implement the proposed policy on cluster-based transcoding servers and evaluate its fair load distribution and scalable performance with the number of transcoding servers.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.595-612
• /
• 2002

One of the most important issues in guaranteeing the high degree of QoS on mobile computing is how to reduce hand-off drops caused by lack of available bandwidth in a new cell. Each cell can request bandwidth reservation to its adjacent cells for hand-off calls. This reserved bandwidth can be used only for hand-offs, not for new calls. It is also important to determine how much of bandwidth should be reserved for hand-off calls because reserving too much would increase the probability of a new call being blocked. Therefore, it is essential to develop a new mechanism to provide QoS guarantee on a mobile computing environment by reserving an appropriate amount of bandwidth and call admission control. In this paper. bandwidth reservation and call admission control mechanisms are proposed to guarantee a consistent QoS for multimedia traffics on a mobile computing environment. For an appropriate bandwidth reservation, we propose an adaptive bandwidth reservation mechanism based on an MPP and a 2-tier cell structure. The former is used to predict a next move of the client while the latter to apply our mechanism only to the client with a high hand-off probability. We also propose a call admission control that performs call admission test only on PNC(Predicted Next Cell) of a client and its current cell. In order to minimize a waste of bandwidth caused by an erroneous prediction of client's location, we utilize a common pool and QoS adaptation scheme. In order evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT2, FR-CAT2, and AR-CAT2.