Topological design of a two-level network with ring-star configuration

نویسندگان

  • Chang-ho Lee
  • Hyung-bong Ro
  • Dong-wan Tcha
چکیده

This paper deals with topological design of a hie~rchical two-levef network where the upper-level hub network is of ring type and the lower-level local access networks are of star-type. The problem is modeled as a mixed 01 integer programming, the special structure of which is exploited for the development of a dual-based lower bounding procedure. A heuristic procedure is developed to construct a primal feasible solution from the dual solution obtained by the dual procedure. The performance of our method is well demonstrated by the computational experiments conducted with a variety of test problems ranging up to 20 hub nodes and 50 user nodes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the girth of the annihilating-ideal graph of a commutative ring

The annihilating-ideal graph of a commutative ring $R$ is denoted by $AG(R)$, whose vertices are all nonzero ideals of $R$ with nonzero annihilators and two distinct vertices $I$ and $J$ are adjacent if and only if $IJ=0$. In this article, we completely characterize rings $R$ when $gr(AG(R))neq 3$.

متن کامل

Topological Design Comparison for Multicast Network

Since the multicast connection form is clearly di erent from the point-to-point one, the optimal network topology will also be di erent if many multicast services are provided. The Delta-Star topology has been proposed as an e ective topology for a point-to-point network when reliability is a consideration. It may also be e ective for multicast networks, since it is a combined form of the Ring ...

متن کامل

Double-Star Detection Using Convolutional Neural Network in Atmospheric Turbulence

In this paper, we investigate the usage of machine learning in the detection and recognition of double stars. To do this, numerous images including one star and double stars are simulated. Then, 100 terms of Zernike expansion with random coefficients are considered as aberrations to impose on the aforementioned images. Also, a telescope with a specific aperture is simulated. In this work, two k...

متن کامل

Reliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm

We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 20  شماره 

صفحات  -

تاریخ انتشار 1993