Systems analysis of a quorum sensing network: Design constraints imposed by the functional requirements, network topology and kinetic constants

Biosystems ◽  
2006 ◽  
Vol 83 (2-3) ◽  
pp. 178-187 ◽  
Author(s):  
A.B. Goryachev ◽  
D.J. Toh ◽  
T. Lee
Author(s):  
Yuri Ariyanto ◽  
Budi Harijanto ◽  
Yan Watequlis S.

A virtual laboratory with a network emulator environment using NetKit is one of series of basic network laboratories on basic computer network competencies where students are given practical trial opportunities at low costs and little effort in their implementation. Teaching computer network subjects to be easily understood by students needs an instructional media as a tool in delivering material. This media uses computer virtualization technology, i.e. creating a virtual laboratory, as a means of students in conducting experiments from the material that has been obtained. In virtual laboratories it is possible to implement network topology designs based on actual network topologies. This implementation is used as a testing tool before the network topology is implemented on the actual network. Therefore, errors can be identified first without disturbing the system that is already running. For testing, the students are given training using a basic network design consisting of the implementation of routing tests, firewalls, ftp server implementation and web server. This paper is aimed at describing ways to develop a virtual laboratory with a network emulator environment using NetKit. Moreover, several exercises on network topology implementation that are applied directly to the real world with NetKit are introduced, such as describing laboratory settings, describing the main parts of the lab, illustrating lab instructions, and reporting lab feeds.


Author(s):  
DIRK REICHELT ◽  
FRANZ ROTHLAUF

For the reliable communication network design (RCND) problem unreliable links are available, each bearing several options which have different levels of reliability and varying costs. The goal is to find the most cost-effective communication network design that satisfies a predefined overall reliability constraint. This paper presents two new evolutionary algorithm (EA) approaches to solving the RCND problem: LaBORNet and BaBORNet. LaBORNet uses an encoding that represents the network topology as well as the used link options while repairing infeasible solutions using an additional repair heuristic (CURE). BaBORNet encodes only the network topology and determines the link options by using the repair heuristic CURE as a local search method. The experimental results show that the new EA approaches using repair heuristics outperform existing EA approaches from the literature using penalties for infeasible solutions. They also find better solutions for existing problems from the literature, as well as for new and larger test problems.


2013 ◽  
Vol 2013 ◽  
pp. 1-16 ◽  
Author(s):  
Rosario G. Garroppo ◽  
Stefano Giordano ◽  
Gianfranco Nencioni ◽  
Maria Grazia Scutellà

The paper deeply analyzes a novel network-wide power management problem, called Power-Aware Routing and Network Design with Bundled Links (PARND-BL), which is able to take into account both the relationship between the power consumption and the traffic throughput of the nodes and to power off both the chassis and even the single Physical Interface Card (PIC) composing each link. The solutions of the PARND-BL model have been analyzed by taking into account different aspects associated with the actual applicability in real network scenarios: (i) the time for obtaining the solution, (ii) the deployed network topology and the resulting topology provided by the solution, (iii) the power behavior of the network elements, (iv) the traffic load, (v) the QoS requirement, and (vi) the number of paths to route each traffic demand. Among the most interesting and novel results, our analysis shows that the strategy of minimizing the number of powered-on network elements through the traffic consolidation does not always produce power savings, and the solution of this kind of problems, in some cases, can lead to spliting a single traffic demand into a high number of paths.


2020 ◽  
Vol 51 (2) ◽  
pp. 1-5
Author(s):  
farajolah maleki ◽  
zahra mahdavi ◽  
Saeed Hemati

2012 ◽  
Vol 2012 ◽  
pp. 1-10
Author(s):  
Md. Noor-E-Alam ◽  
Ahmed Zaky Kasem ◽  
John Doucette

p-cycle networks have attracted a considerable interest in the network survivability literature in recent years. However, most of the existing work assumes a known network topology upon which to applyp-cycle restoration. In the present work, we develop an incremental topology optimization ILP forp-cycle network design, where a known topology can be amended with new fibre links selected from a set of eligible spans. The ILP proves to be relatively easy to solve for small test case instances but becomes computationally intensive on larger networks. We then follow with a relaxation-based decomposition approach to overcome this challenge. The decomposition approach significantly reduces computational complexity of the problem, allowing the ILP to be solved in reasonable time with no statistically significant impact on solution optimality.


Water ◽  
2021 ◽  
Vol 13 (18) ◽  
pp. 2491
Author(s):  
Juan Saldarriaga ◽  
Jesús Zambrano ◽  
Juana Herrán ◽  
Pedro L. Iglesias-Rey

This paper proposes a methodology for the layout selection of an urban drainage system as an extension to the methodology for an optimal sewer network design proposed by Duque, Duque, Aguilar, & Saldarriaga. The layout selection approach proposed in this paper uses an objective function that takes into account all input data in the problem, such as: land topography, street network topology, and inflow to each manhole. Once the layout is selected, the network is optimally designed using dynamic programming. The problem of layout selection is solved as a mixed-integer programming problem and is divided into two steps. The first step tries to define an initial layout using the network topology and land topography as a criterion. This allows for an initial hydraulic design and an approximation of the sewer network’s construction costs. The second step uses the data obtained in the previous process to establish an approximation of the construction costs of each arc that can be part of the layout. This is in order to minimize the objective function of the layout selection problem so that the hydraulic design cost is also minimized. The methodology was successfully tested on three case studies: the Chicó sewer network proposed by Duque et al. and two sewer network benchmarks from the literature.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Hong Yang ◽  
Xiong Guo ◽  
Chi Zhang ◽  
Mengliang Li

In recent years, the Content-Centric Networking (CCN) has attracted much attention from the global Internet experts; in particular, it has demonstrated the outstanding effect on the application in the field of Internet of Things (IoT). At present, the routing technique of ICN is subjected to the dynamic change of network environment with the development of mobile Internet. Therefore, this paper proposes an Intelligent CCN routing strategy based on Bacterial Quorum pattern (ICBQ). The ICBQ tries to simulate the behaviors of bacteria, including quorum sensing and adaptive chemotaxis. Meanwhile, the quorum sensing can obtain the parameter information on bandwidth, delay, and error rate to facilitate the subsequent forwarding of packets. The adaptive chemotaxis can select the optimal interface to forward the packets through the information measurement. The simulation is driven based on the real Netflix dataset over the GTS network topology, and the experimental results show that the proposed ICBQ has better performance in terms of routing success rate, routing delay, load balance, and energy efficiency.


Sign in / Sign up

Export Citation Format

Share Document