In this paper, we propose a rank table based routing method to solve congestion and traffic balancing problem in multi-sink zigbee networks. Each node has a rank table to cache path costs and next hop addresses between itself and all the sinks. All the sinks broadcast heartbeat packets containing their load level information as path costs periodically. Each router adds its own load level to the...

This paper proposed and evaluates a QOS routing policy in packets topology and irregular traffic of communications network called K-shortest Widest paths Q-Routing. The technique used for the evaluation signals of reinforcement is Q-learning. Compared to standard Q-Routing, the exploration of paths is limited to K best non loop paths in term of hops number (number of routers in a path) leading ...

ln this paper, we propose a fast restoration mechanism for virtual path-based ATM networks. Given an ATM network topology, the capacity of each physical link, and the primary virtual path (VP) layout at system initialization, the proposed mechanism pre-assigns to each primary VP one backup VP such that (PI) the failure of a single node/link does not lead to the failure of both the primary and b...

The Distributed Version Storage Server (DVSS) provides an underlying storage mechsniim for a CAD-oriented data model. DVSS supports such project management features as version histories. alternate data versions, and multi-reader multi-writer access control in a heterogeneous network of workstations and fileservers. Each design object is managed as a rooted directed acyclic graph @AG) of version...

In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the network that are responsible for congestion The traffic in the network is routed through the paths that have no or least number of critical links. This avoids congestion in the critical links and increases the perform...

In the next generation Internet, the network should not only be considered as a communication medium, but also as an endless source of services available to the end-systems. These services (i.e. Overlay Applications) would be composed of multiple cooperative distributed software elements that dynamically build an ad hoc communication mesh (i.e. an Overlay Association). In this paper we propose ...

the task of balancing of assembly lines is well-known in mass production system but this problem is np-hard even for the simple straight line. therefore, utilizing heuristic methods for these problems is totally unquestionable. furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

An important problem in multifiber WDM networks is to decide how many fibers per link are required to guarantee high network performance. The fiber requirement may depend on many factors, e.g., the network topology, traffic patterns, the number of wavelengths per fiber, and the routing algorithm employed in the network. We study the fiber requirement under dynamic traffic in different topologie...