scholarly journals Improved Model of Load Balancing in the Infocommunication Network

2020 ◽  
pp. 56-67
Author(s):  
Oleksandr Lemeshko ◽  
Anastasiia Kruhlova ◽  
Anna Zhuravlova ◽  
Valentyn Lemeshko

The paper proposes an improved mathematical model of load balancing in the infocommunication network (ICN), corresponding to the Traffic Engineering (TE) concept principles. The model mathematically formalizes the case of ICN construction when each access network is switched simultaneously to not one but to several border routers to increase fault tolerance. Therefore, it is proposed to improve the load balancing level in the ICN according to the TE criterion by ensuring the distribution of traffic at the access level between several border routers that create a default virtual gateway. The proposed mathematical model is based on the conditions of implementation of single or multipath routing; load balancing at the access level; flow conservation at the access level and the network itself; overload prevention of communication links, which act as conditions for load balancing in ICN. Within the proposed model, the load balancing task in ICN is formulated as an optimization problem of mixed-integer linear programming. The results of the study confirmed the effectiveness of the proposed solution. Ensuring coordinated load balancing at both access and core network levels, in general, has increased network performance by 25.45% compared to a solution based on multipath routing, but without access level balancing, and 2.76 times compared to the model in which load balancing in the ICN was absent. Within the available load for each of the compared models, the use of the proposed solution allowed to reduce the upper bound of the network links utilization by an average from 20% to 60%. Lowering the upper bound of the network links utilization positively affects the quantitative values of the main Quality of Service indicators – the average end-to-end delay, jitter, and packet loss probability.

2019 ◽  
Vol 8 (4) ◽  
pp. 12773-12778

In the communication networks, one of the major problems in the quality of service is congestion. Indeed, the phenomenon of congestion is due to the fact that many packets emitted follow the same paths. As a result, the increase the bandwidth offered can solve the problem only in the short term. In order to solve this problem, several solutions have been proposed, such as multipath routing algorithms, which distribute traffic between a source and a destination on several different paths, while taking into account the level of saturation of the intermediaries nodes, composing the different paths with a objective to avoid cluttered paths. Its purpose is to shed the excessive burden save a knot on its neighbors to improve performance and to exploit efficiently. In this paper we have analysis the load balancing in Multipath routing to achieve better network performance. We have study and reviewed the different load balancing algorithm in multipath network and based on review we have proposed a new load balancing algorithm in the multipath network. We have modified the packet of RREP and RREQ packet to transmit and receive the route information to compute the load of every path and we added a new field in RREP packet Buffer size to store the current node and their neighbor information to find the alternate route if network load in increase we have compare the performance of proposed protocol with the LB-AOMDV, SMR & AOMDV multipath routing protocols. NS2 is used for simulation


Author(s):  
Dao Ngoc Lam ◽  
Le Huu Lap ◽  
Le Nhat Thang

Broadband  Internet  traffic  is transported over the  next generation  core internetworks, which are composed of several IP/MPLS/GE network sections and transport  multi-services. In practice, IP packet delay is normally  measured  in  each  separated  network  section but  not  over  a  whole  internetwork.  It  is  proved  in  the paper  that  packet  delay  distribution  of  Internet  traffic component  in  core  network  sections  can  be approximately  expressed  as  a  shifted  gamma distribution.  Moreover  a  new  explicit  mathematical model  based  on  shifted  gamma  distribution  has  also been proposed to compose delay distribution of Internet traffic  packet  transported  over  a  core  internetwork from  component  ones  in  each  network  section.  It  is resulted from this model that Internet packet delay over an  internetwork  inherits  distribution  properties  from that  over  component  networks.  Other  properties  and parameters  relationship  of  the  model  such  as  additive property of shape and location parameters, the relation between  distribution  lower  moments  and  parameters, the dependence  of distribution  on parameters variation are also exposed in the paper. The proposed model of IP packet  delay  distributions  has  a  certain  scientific significance  and  plays  an  important  role  in  practical performance analysis, network  planning, designing and traffic engineering for improving the quality of service


2021 ◽  
Vol 3 (3) ◽  
Author(s):  
Amirreza Hooshyar Telegraphi ◽  
Akif Asil Bulgak

AbstractDue to the stringent awareness toward the preservation and resuscitation of natural resources and the potential economic benefits, designing sustainable manufacturing enterprises has become a critical issue in recent years. This presents different challenges in coordinating the activities inside the manufacturing systems with the entire closed-loop supply chain. In this paper, a mixed-integer mathematical model for designing a hybrid-manufacturing-remanufacturing system in a closed-loop supply chain is presented. Noteworthy, the operational planning of a cellular hybrid manufacturing-remanufacturing system is coordinated with the tactical planning of a closed-loop supply chain. To improve the flexibility and reliability in the cellular hybrid manufacturing-remanufacturing system, alternative process routings and contingency process routings are considered. The mathematical model in this paper, to the best of our knowledge, is the first integrated model in the design of hybrid cellular manufacturing systems which considers main and contingency process routings as well as reliability of the manufacturing system.


Author(s):  
Konstantinos Poularakis ◽  
Leandros Tassiulas

A significant portion of today's network traffic is due to recurring downloads of a few popular contents. It has been observed that replicating the latter in caches installed at network edges—close to users—can drastically reduce network bandwidth usage and improve content access delay. Such caching architectures are gaining increasing interest in recent years as a way of dealing with the explosive traffic growth, fuelled further by the downward slope in storage space price. In this work, we provide an overview of caching with a particular emphasis on emerging network architectures that enable caching at the radio access network. In this context, novel challenges arise due to the broadcast nature of the wireless medium, which allows simultaneously serving multiple users tuned into a multicast stream, and the mobility of the users who may be frequently handed off from one cell tower to another. Existing results indicate that caching at the wireless edge has a great potential in removing bottlenecks on the wired backbone networks. Taking into consideration the schedule of multicast service and mobility profiles is crucial to extract maximum benefit in network performance.


2016 ◽  
Vol 10 (10) ◽  
pp. 133
Author(s):  
Mohammad Ali Nasiri Khalili ◽  
Mostafa Kafaei Razavi ◽  
Morteza Kafaee Razavi

Items supplies planning of a logistic system is one of the major issue in operations research. In this article the aim is to determine how much of each item per month from each supplier logistics system requirements must be provided. To do this, a novel multi objective mixed integer programming mathematical model is offered for the first time. Since in logistics system, delivery on time is very important, the first objective is minimization of time in delivery on time costs (including lack and maintenance costs) and the cost of purchasing logistics system. The second objective function is minimization of the transportation supplier costs. Solving the mathematical model shows how to use the Multiple Objective Decision Making (MODM) can provide the ensuring policy and transportation logistics needed items. This model is solved with CPLEX and computational results show the effectiveness of the proposed model.


1974 ◽  
Vol 14 (01) ◽  
pp. 44-54 ◽  
Author(s):  
Gary W. Rosenwald ◽  
Don W. Green

Abstract This paper presents a mathematical modeling procedure for determining the optimum locations of procedure for determining the optimum locations of wells in an underground reservoir. It is assumed that there is a specified production-demand vs time relationship for the reservoir under study. Several possible sites for new wells are also designated. possible sites for new wells are also designated. The well optimization technique will then select, from among those wellsites available, the locations of a specified number of wells and determine the proper sequencing of flow rates from Those wells so proper sequencing of flow rates from Those wells so that the difference between the production-demand curve and the flow curve actually attained is minimized. The method uses a branch-and-bound mixed-integer program (BBMIP) in conjunction with a mathematical reservoir model. The calculation with the BBMIP is dependent upon the application of superposition to the results from the mathematical reservoir model.This technique is applied to two different types of reservoirs. In the first, it is used for locating wells in a hypothetical groundwater system, which is described by a linear mathematical model. The second application of the method is to a nonlinear problem, a gas storage reservoir. A single-phase problem, a gas storage reservoir. A single-phase gas reservoir mathematical model is used for this purpose. Because of the nonlinearity of gas flow, purpose. Because of the nonlinearity of gas flow, superposition is not strictly applicable and the technique is only approximate. Introduction For many years, members of the petroleum industry and those concerned with groundwater hydrology have been developing mathematical reservoir modeling techniques. Through multiple runs of a reservoir simulator, various production schemes or development possibilities may be evaluated and their relative merits may be considered; i.e., reservoir simulators can be used to "optimize" reservoir development and production. Formal optimization techniques offer potential savings in the time and costs of making reservoir calculations compared with the generally used trial-and-error approach and, under proper conditions, can assure that the calculations will lead to a true optimum.This work is an extension of the application of models to the optimization of reservoir development. Given a reservoir, a designated production demand for the reservoir, and a number of possible sites for wells, the problem is to determine which of those sites would be the best locations for a specified number of new wells so that the production-demand curve is met as closely as possible. Normally, fewer wells are to be drilled than there are sites available. Thus, the question is, given n possible locations, at which of those locations should n wells be drilled, where n is less than n? A second problem, that of determining the optimum relative problem, that of determining the optimum relative flow rates of present and future wells is also considered. The problem is attacked through the simultaneous use of a reservoir simulator and a mixed-integer programming technique.There have been several reported studies concerned with be use of mathematical models to select new wells in gas storage or producing fields. Generally, the approach has been to use a trial-and-error method in which different well locations are assumed. A mathematical model is applied to simulate reservoir behavior under the different postulated conditions, and then the alternatives are postulated conditions, and then the alternatives are compared. Methods that evaluate every potential site have also been considered.Henderson et al. used a trial-and-error procedure with a mathematical model to locate new wells in an existing gas storage reservoir. At the same time they searched for the operational stratagem that would yield the desired withdrawal rates. In the reservoir that they studied, they found that the best results were obtained by locating new wells in the low-deliverability parts of the reservoir, attempting to maximize the distance between wells, and turning the wells on in groups, with the low-delivery wells turned on first.Coats suggested a multiple trial method for determining well locations for a producing field. SPEJ P. 44


2017 ◽  
Vol 23 ◽  
pp. 32-36
Author(s):  
Sæmundur E. Þorsteinsson

General deployment of optical fibre technology commenced in the eighties. Its introduction revolutionised the telecommunications arena and has become the foundation of most telecommunication systems in use today. Optical fibres connect continents and countries, are used in core and access networks and for backhauling of mobile communication systems. The internet would barely exist without optical fibres and globalisation would hardly have seen the dawn of light. Three submarine optical cables connect Iceland to the outside world; Farice and Danice connect Iceland to Europe and Greenland Connect to America via Greenland. The optical ring around Iceland constitutes the Icelandic core network. The ring passes by nearly all villages and towns and fibre deployment in the access network has reached an advanced state. Fibre deployment in rural areas has already begun and will presumably be finished in a few years. Iceland plays a leading role in fibre deployment. In this paper, fibre utilisation in Iceland will be described, both in core and access networks. Three different architectures for fibre deployment in the access network will be described. Competition on fibre networks will also be discussed.


VLSI Design ◽  
2007 ◽  
Vol 2007 ◽  
pp. 1-11 ◽  
Author(s):  
Srinivasan Murali ◽  
David Atienza ◽  
Luca Benini ◽  
Giovanni De Micheli

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today's NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in the network is reduced significantly, which translates to improved network performance or reduced network bandwidth requirements and power consumption. Multiple paths can also be utilized to achieve spatial redundancy, which helps in achieving tolerance against faults or errors in the NoC. A major problem with multipath routing is that packets can reach the destination in an out-of-order fashion, while many applications require in-order packet delivery. In this work, we present a multipath routing strategy that guarantees in-order packet delivery for NoCs. It is based on the idea of routing packets on partially nonintersecting paths and rebuilding packet order at path reconvergent nodes. We present a design methodology that uses the routing strategy to optimally spread the traffic in the NoC to minimize the network bandwidth needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large reduction in network bandwidth requirements (36.86% on average) and power consumption (30.51% on average) compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area). Hence, it is practical to be used in the on-chip domain.


Sign in / Sign up

Export Citation Format

Share Document