Routing Control Policy Research Articles

An Optimal Flow Admission and Routing Control Policy for Resource Constrained Networks.

Overloaded network devices are becoming an increasing problem especially in resource limited networks with the continuous and rapid increase of wireless devices and the huge volume of data generated. Admission and routing control policy at a network device can be used to balance the goals of maximizing throughput and ensuring sufficient resources for high priority flows. In this paper we formulate the admission and routing control problem of two types of flows where one has a higher priority than the other as a Markov decision problem. We characterize the optimal admission and routing policy, and show that it is a state-dependent threshold type policy. Furthermore, we conduct extensive numerical experiments to gain more insight into the behavior of the optimal policy under different systems’ parameters. While dynamic programming can be used to solve such problems, the large size of the state space makes it untractable and too resource intensive to run on wireless devices. Therefore, we propose a fast heuristic that exploits the structure of the optimal policy. We empirically show that the heuristic performs very well with an average reward deviation of 1.4% from the optimal while being orders of magnitude faster than the optimal policy. We further generalize the heuristic for the general case of a system with n () types of flows.

Simulation Modelling and Analysis of Flexible Manufacturing Systems with flexsim software

This paper deals with a simulation study to investigate how to optimize manufacturing time in Flexible Manufacturing Systems. The combination of flexible machines and flexible operational sequences simulation software are used to obtain a full routing flexibility in FMS. Flexibility in manufacturing systems offers reducing waiting time, decreasing cost, and increasing efficiency. This paper entails an efficient real-time flexible routing strategy, to maximize the system throughput by balancing the workload and minimize the system unbalance. Full routing flexibility provides significant enhancement in the system improvement and gives how a routing control policies influence condition of a system.

A flow and routing control policy for communication networks with multiple competitive users

This paper is concerned with deriving an optimal flow and routing control policy for two-node parallel link communication networks with multiple competing users. The model assumes that each user has a flow demand which needs to be optimally selected and routed on the network links. The flow and routing control policy for each user seeks to maximize the user's total throughput and minimize its expected delay. To derive such a policy, we consider a utility function for each user that combines these two objectives in an additive fashion with preference constants that can be adjusted to reflect the user's own preferences between maximizing throughput and minimizing delay. Additionally, we provide each user with the ability to make these preferences link-dependent to reflect the user's preferences for certain links over others in the network. A condition that depends on the link capacities and preference constants is derived to guarantee the existence and uniqueness of a non-symmetric flow and routing control policy solution which satisfies the Nash equilibrium of non-cooperative game theory. The Nash equilibrium is a desirable solution for such networks because it insures that no user can improve its utility by unilaterally deviating from its Nash control policy. We discuss in detail several interesting properties of this equilibrium and in particular, its relationship to the users’ preference constants. Two illustrative examples are also presented.

Stochastic Networks: Admission and Routing Using Penalty Functions

We propose an admission and routing control policy for a network of service facilities in a stochastic setting in order to maximize a long run average reward. Queueing and reneging before entering the network is allowed; we introduce orbiting as an approximation to the queueing. Once a customer has entered the network, it incurs no more waiting. Our control policy is easy to implement and we prove that it performs well in steady state as long as the capacity request sizes are relatively small compared to the capacity of the service facilities. The policy is a target tracking policy: a linear program provides a target operating point and an exponential penalty function is used to translate the optimal deterministic point into a feasible admission and routing policy. This translation essentially transforms the admission and routing control problem into a problem of load balancing via the construction of fictitious systems. Simulation studies are included to illustrate that our policy also performs well when request sizes are moderate or large with respect to the capacity.

A routing policy description language for the inter‐domain routing protocol

The inter-domain routing protocol (IDRP) is a strategic routing control protocol designed for wide use in OSI and the Internet. In IDRP, it is possible to impose fine route control reflecting local policies regarding the operation and management of networks; however, the configuration becomes extremely complicated with an increased number of policies. In this paper, a language is designed to describe routing control policies and various necessary knowledge configurations. A tool is installed for proper configuration from the policies and knowledge described by the design language. All knowledge necessary for the configuration is described by the “is-a” relation, and an inference engine is established based on the transitive law and succession relation. In addition, descriptions of framepolicies are made possible by using the “if-then” rule. © 1998 Scripta Technica. Electron Comm Jpn Pt 2, 80(6): 58–65, 1997