In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses are cyclic shifts of one another. The node degrees of basic CNs are independent of system size, but can vary from a small constant (e.g., 3) to as large as required, thus providing flexibility and effective tradeoff be...

This paper addresses the deadlock avoidance problems in manufacturing systems with sequence and route flexibility. It is shown that for a large class of such systems, through one-step look ahead, an optimal deadlock avoidance policy can be obtained. For a general system the authors present a system reduction method by which the system is reduced and the reduced system has an optimal deadlock av...

Message scheduling or call request scheduling is the process of finding optimal routing for a set of circuit connection requests through a communications network. Each request has a single source with one or more destinations. Furthermore, different requests may have different source and different destination nodes. Finding optimal routing for a set of requests is called the Point to Multipoint...

In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

Abstract. A strategic placement of mesh points (MPs) in a Wireless Mesh Network (WMN) is essential to maximize the throughput of the network. In this paper, we address the problem of MPs placement for throughput optimization in WMN with consideration of routing protocols. Specifically, we formulate the routing paths among the MPs and mesh routers (MRs), calculate the aggregated traffic at the M...

The problem of minimum cost extension of an existing communication network, over a given time period [0,T], is stated and formulated. A two phase solution method is then described, in which: a) an optimal long-range configuration is sought, assuming static routing all over the period [0,T]; b) the optimal dynamic routing problem is solved by relaxing the fixed routing assumption, and taking int...

Designing a network able to route a set of non-simultaneous demand vectors is an important problem arising in telecommunications. The problem can be seen a two-stage robust program where the recourse function consists in choosing the routing for each demand vector. Allowing the routing to change arbitrarily as the demand varies yields a very difficult optimization problem so that different subs...

We present in this paper a new approach to the three or four layer channel routing problem. Since two layer channel routing has been well studied, there are several two layer routers which can produce optimal or near optimal solution for almost all the practical problems. We develop a general technique which transforms a two layer routing solution systematically into a three layer routing solut...

In recent years, commercial “Multihoming Route Control” devices are used by multihomed stub networks to optimize the routing of their Internet traffic. Previous studies have shown that “Multihoming Route Control” can improve the Internet communication performance of the multihomed stub networks significantly. In this work, we study “Multihoming Route Control” among a group of multihomed stub ne...