Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak — 2010

International Journal of Applied Mathematics and Computer Science

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of anycasting is...

Ant algorithm for flow assignment in connection-oriented networks

Krzysztof Walkowiak — 2005

International Journal of Applied Mathematics and Computer Science

This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use...

The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks

Krzysztof Walkowiak — 2002

International Journal of Applied Mathematics and Computer Science

Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination...

Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

Michal PrzewozniczekKrzysztof Walkowiak — 2006

International Journal of Applied Mathematics and Computer Science

The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main novelty of...

Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems

Grzegorz ChmajKrzysztof WalkowiakMichał TarnawskiMichał Kucharzak — 2012

International Journal of Applied Mathematics and Computer Science

Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational projects....

Page 1

Download Results (CSV)