The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Topology optimization of P2P overlays has become an increasingly important issue in recent years. P2P systems today have an increased number of legal applications, but they still fail to meet two important requirements crucial for many such applications and for Internet providers: making efficient use of Wide-Area network resources and providing a fast response to queries by reducing routing stretch...
This paper considers problems of logical traffic configuring and alignment. Channel reservation policy differentiation is proposed, according to calculated workload for current net structure.
Ring topologies are peer to peer network structures that organize the nodes in a ring. Each node knows its direct neighbors and a few other nodes but has no global view of the network. In such a network it is complicated to measure or estimate the number of participating nodes. We provide a lightweight, distributed algorithm to estimate the size of the node population. We also show how correct the...
The goal of WDM network reconfiguration is to accommodate more traffic demands, as well as to optimize network operations such as cost minimization or utilization maximization. This tutorial reviews the WDM network reconfiguration strategies and triggering methods, followed by an overview of WDN network reconfiguration optimization and topology migration methods.
For simplified network operations, demands are often routed on shortest paths, e.g., with physical length as metric. We propose a new controlled shortest path routing concept for multiperiod planned networks, formulated as optimization model. This routing concept minimizes the network costs (capital expenditures) under the constraint of using shortest path routing within the lit fiber network. Within...
For the multi-constrained routing problem, there are several constrained parameters such as the bandwidth, delay, packet loss rate, delay jitter, the QoS parameters influence each other. It has been proved as a NP-Complete problem, traditional linear method often have some difficulties in solving this problem. The application of ant colony algorithm or genetic algorithm often has a slow convergence...
In packet-switched computer networks, one of several challenging issues is how to determine an optimal path that satisfies a set of constraints while maintaining high utilization of network resources. This paper proposes an improved particle swarm optimization utilizing Iterative Chaotic Map with Infinite Collapses (ICMIC) perturbations (ICMICPSO) for shortest path computation in computer networks...
In this paper, a practical routing protocol that maximizes the guaranteed node traffic loads in reliable networks is designed and analyzed. The derived node traffic loads can be routed for every traffic pattern, and regardless of the possible single node or link failures. First, it is described how load balanced shortest path routing (LB-SPR) can be optimized to maximize the value of the guaranteed...
In this work, we analyze the design of green routing algorithms and evaluate the achievable energy savings that such mechanisms could allow in several realistic network scenarios. We formulate the problem as a minimum energy routing optimization, which we numerically solve considering a core-network scenario, which can be seen as a worst-case for energy saving performance (as nodes cannot be switched...
When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. An optimal load balancing is very important, because it increases the system capacity and improves the overall ring performance. An important optimisation problem in this context is the Weighted Ring Arc Loading Problem (WRALP). It consists of the design, in a communication...
Energy consumption of communication networks is an important contributor to the ICT sector's greenhouse gas emission footprint. This research project focuses on power consumption reduction of communication networks by dynamically adapting network configuration to traffic demands. This is promising as networks are often under utilised over long periods. In the context of this work, dynamic topologies...
Aiming at constructing a delay and delay variation bounded Steiner tree in the real-time streaming media communication, we discuss in this paper a multicast routing algorithm based on searching a directed graph (MRASDH).In the construction of the multicast tree, there always exist some nodes and links in the network topology that do not affect the outcome of the tree constructed. Therefore, based...
We consider the problem of efficiently “emptying” a wireless sensor network that has accumulated a large amount of data at its nodes and seeks to relay them to designated gateways so as to maximize a concave function of achievable transmission rates. Transmissions are subject to physical communication constraints, interference constraints, and fairness constraints. We adopt a framework where transmissions...
In order to achieve high performance, graph coloring algorithms are used to schedule the time slots in IEEE802.15.4 compliant wireless sensor network. These algorithms tint the links with different color and use the number of color to determine the length of superframe, and then assign the color to corresponding time slots of superframe. In this paper, the impacts of the assignment on network throughput...
With fixed number of available channels in the traditional wired networks and wireless ad hoc network, routing protocols are paying more attention on the establishment of network topology and the optimization of routing path selection. Although there are multi-channel multi-interface nodes in the wireless ad hoc networks, the set of each node's available channels is fixed, or even the same. With a...
Wireless mesh networks are dynamically self-organized and self-configured, with the nodes in the network automatically establishing and maintaining mesh connectivity among them. Wireless mesh networks consist of three types of nodes: clients, routers and gateways. Wireless Mesh Network planning consists of determining the amount of routers needed to meet the demands for Internet access. It is a complicated...
Dynamic topologies and constrained recourses are two main characters of satellite networks. These characters require a specialized and efficient routing algorithm. In this paper, a QoS routing algorithm based on PEC multi objective optimization method is proposed to find paths that satisfy all user QoS requirements efficiently. A new routing scheme is also developed to reduce the computing load in...
Lifetime of multicast connection in a wireless ad-hoc network is constrained by routing topology as well as mobility, interference, noise and battery capacity. In order to optimize the multicast lifetime, a series of routing algorithms and cognitive network models with directional antennas have been proposed. However, these methods can only reach a sub-optimal level. In this paper, we propose an additional...
Network load balancing is the ability to aggregate two or more wide area network (WAN) connections in order to achieve greater reliability and overall throughput. This paper discusses traffic technology and flow optimization in optical network. Performance optimization of networks is actually a control problem. Traffic engineering should provide sufficient control in an adaptive feedback control system...
Network lifetime (NL) is a critical metric in the design of energy-constrained wireless sensor networks (WSNs). In this paper, we investigate a joint optimal design of the physical, medium access control (MAC) and routing layers to maximize NL of a multiple-sources and single-sink (MSSS) WSN with energy constraints. The problem of NL maximization (NLM) can be formulated as a mixed integer-convex optimization...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.