• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.342-350
• /
• 2001

The Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency, and delayed routing convergence. At the extreme, high levels of routing instability can lead to the loss of internal connectivity in wide-area networks. In this paper, we investigate the variation of domain degree and domain count of the inter-domain network over time by using linear regression model in order to analyze the topology variation of inter-domain network. We Also propose an efficient policy management model to reduce the instability in the inter-domain routing system. The proposed model can be used to identify whether a routing policy is adequate to reduce convergence time that is required to return to a normal state when BGP routing instability happens. Experimental analysis shows that the proposed model can be used to set up routing policy in domains for the purpose of minimizing the effects and the propagation of BGP routing instability.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.93-99
• /
• 2011

In this paper, we propose a policy-gradient routing scheme under Reinforcement Learning that can be used adaptive QoS routing. A policy-gradient RL routing can provide fast learning of network environments as using optimal policy adapted average estimate rewards gradient values. This technique shows that fast of learning network environments results in high success rate of routing. For prove it, we simulate and compare with three different schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2379-2397
• /
• 2017

Content distribution technology, which routes content to the cache servers, is considered as an effective method to reduce the response time of the user requests. However, due to the exponential increases of content traffic, traditional content routing methods suffer from high delay and consequent inefficient delivery. In this paper, a content selection policy is proposed, which combines the histories of cache hit and cache hit rate to collaboratively determine the content popularity. Specifically, the CGM policy promotes the probability of possible superior paths considering the storage cost and transmission cost of content network. Then, the content routing table is updated with the proportion of the distribution on the paths. Extensive simulation results show that our proposed scheme improves the content routing and outperforms existing routing schemes in terms of Internet traffic and access latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.938-945
• /
• 2004

This paper describes the problems of the existing two multi-layer routing policies(policy 1 and policy 2) and suggests new multi-layer routing policy(policy 3) which is established the packet LSP by inquiry on packet LSP lambda routing tables for GMPLS based optical If Network. All policies of multi-layer routing schemes first try to allocate a newly requested electrical path to an existing optical path that directly connects the source and destination nodes. U such a path is not available, all policies employ different procedures. Policy 1 tries to find available existing optical paths with two or more hops that connect the source and destination nodes and policy 2 tries to establish a new one-hop optical path between source and destination nodes. Policy 3 tries to establish a new one-hop optical path by inquiry on information of the packet LSP lambda routing tables between source and destination nodes. The performances of the three multi-routing policies are evaluated by computer simulation. Simulation results show that policy 3 is the excellent of routing time and traffic acceptance capabilities compare to existing two polices if p is large, where p is the number of packet-switching-capable ports p.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.1-12
• /
• 2009

A routing policy based on BGP community routing permits to select a specific route for particular network by making use of user-defined routing policies. Especially, community based routing policy is recently getting a great concern to enhance overall performance in the global research networks which are generally inter-connected large number of different characterized networks. In this paper, we analyze the community routing which has been applied in existing global research networks in the network performance point of view, and catch hold of problems caused by the routing performance in a new global research network. Then, we suggest an effective community routing policy model along with an interconnection architecture of research networks, in order to make correct some wrong routings and resolve an asymmetric routing problem, for a new global research network. Our work is expected to be utilized as an enabling base technology to improve the network performance of future global research networks as well as commercial networks.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.301-311
• /
• 2013

This paper proposes a policy-based quality of service (QoS) management framework for adaptive routing decisions. We present an approach considering interior gateway protocol (IGP) for path discovery mechanisms and QoS-aware policies for configuring the network elements. The integration of the aforementioned modules into this policy-based network management (PBNM) system is demonstrated by conducting experiments in a real environment, the hellenic public administration network SYZEFXIS. These experiments combine different traffic conditioning mechanisms through event detectors, consider IP service level agreement mechanisms that interoperate with the PBNM system and analyze the enforcement of IGP and QoS policies. Finally, validation and measurement tools are used to prove the efficiency of this framework. It is shown that this architecture offers significantly increased performance and learning capabilities, while the PBNM system achieves adaptive QoS routing through automated configuration considering the avoidance of suboptimal routing issues or under-performance conditions of the network entities.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1597-1600
• /
• 2001

In-Service-Monitoring을 통하여 네트웍 계층에서 성능저하와 전달되어지는 QOS의 영향을 감시하여 Pro-Active 매니지먼트가 가능하다. 그 결과로서 SLA 보증을 위반하기 전에 성능저하를 조기 발견하여 행동을 취한 수 있게 한다. 본 논문에서는 사용자의 요구조건을 만족하기 위한 네트웍의 구성과 SLA 측정의 제약조건들을 고려하고 Policy Based Routing이 적용되는 네트웍에서 Technology-Specific Parameter인 IP Packet Loss Ratio, IP 패킷전송지연, 패킷지터, 가용도등의 SLA Parameter를 측정하였다.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.175-187
• /
• 2004

We consider the simultaneous selection of part routes for multiple part types in Flexible Manufacturing Systems (FMSs). Using an optimization framework we investigate two alternative route assignment policies. The one, called routing mix policy in the literature, specifies the optimal proportion of each part type to be produced along its alternative routes, assuming that the proportions can be kept during execution. The other one, which we propose and call pallet allocation policy, partitions the pallets assigned to each part type among the routes. The optimization framework used is a nonlinear programming superimposed on a closed queueing network model of an FMS which produces multiple part types with distinct repeated visits to certain workstations. The objective is to maximize the weighted throughput. Our study shows that the simultaneous use of multiple routes leads to reduced bottleneck utilization, improved workload balance, and a significant increase in the FMS's weighted throughput, without any additional capital investments. Based on numerical work, we also conjecture that pallet allocation policy is more robust than routing mix policy, operationally easier to implement, and may yield higher revenues.

• Journal of the Korea Society for Simulation
• /
• v.8 no.3
• /
• pp.67-76
• /
• 1999

The study of the optimization of operating policy of AGV system, which is used in many factory automation environments has been proceeded by many researchers. The major operating policy of AGV system consists of routing and scheduling policy. AGV routing is composed with collision avoidance and minimal cost path find algorithm. To allocate jobs to the AGV system, AGV scheduling has to include AGV selection rules, parking rules, and recharging rules. Also in these rules, the key time parameters such as processing time of the device, loading/unloading time and charging time should be considered. In this research, we compare and analyze several operating policies of multiple loop-multiple AGV system by making a computer model and simulating it to present an appropriate operating policy.