Dynamic load balancing in WDM packet networks with and without wavelength constraints

Narula-Tam, Aradhana; Modiano, Eytan

doi:10.1109/49.887917

Cited by 81 publications

(32 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, heuristics can be designed to make incremental changes in an already established topology as opposed to a complete reconfiguration of a topology. Narula-Tam [23] et al described a simple algorithm based on branch exchange techniques.…”

Section: Variablesmentioning

confidence: 99%

Topology Reconfiguration with Successive Approximations

Baskaran

Llorca

Milner

et al. 2007

MILCOM 2007 - IEEE Military Communications Conference

View full text Add to dashboard Cite

Topology control consists of computing new topologies to dynamically optimize the network under changing traffic conditions and then carrying out the reconfiguration process to achieve the target topology. This thesis considers the process of topology reconfiguration and use the packet drops that happen during this process as a cost metric for this process. It is shown that by implementing the topology reconfiguration as a series of smaller steps (successive approximation), the number of packets that are dropped during the reconfiguration are reduced. Using this knowledge, the topology computation algorithm can be refined to also minimize the reconfiguration cost along with the typical objective of minimizing congestion.

show abstract

Section: Variablesmentioning

confidence: 99%

Topology Reconfiguration with Successive Approximations

Baskaran

Llorca

Milner

et al. 2007

MILCOM 2007 - IEEE Military Communications Conference

View full text Add to dashboard Cite

show abstract

“…The former implies load balancing: balancing the traffic load among different logical links using proper logical topology formation and routing schemes; while the latter implies congestion-aware capacity planning: providing higher effective capacity for more congested logical links using proper logical topology formation, interface assignment, and channel allocation schemes. Load balancing is shown to be a proper objective for joint topology control and routing algorithms in optical networks [28]. Congestion aware capacity planning is also proposed for cross-layer congestion control designs in wireless ad-hoc [29] and mesh networks [22].…”

Section: E Feasible Region and The Objective Functionmentioning

confidence: 99%

Joint logical topology design, interface assignment, channel allocation, and routing for multi-channel wireless mesh networks

Mohsenian-Rad

Wong

2007

IEEE Trans. Wireless Commun.

111

View full text Add to dashboard Cite

show abstract

“…To generate dynamic traffic we followed a model similar to that described in [9]. Given two positive integers N and ∆, we consider a sequence of N∆+1 traffic matrices (T 0 , T 1 , .…”

Section: Dynamic Trafficmentioning

confidence: 99%

“…The routing problem has its origin at the beginning of networking research (see [9] for a review of previous approaches to the problem). In particular adaptive routing, which incorporates network state information into the routing decision, is considered in [8] in the context of all-optical networks, while previous work on state-dependent routing with trunk reservation in traditional telecommunications networks is considered in [7].…”

Section: Introductionmentioning

confidence: 99%

“…In [4] "branch exchange" sequences are considered in order to reach an optimal logical configuration in small steps, upper and lower bounds for minimum congestion routing are studied in [13], where variable depth local search and simulated annealing strategies are also proposed. Strategies based on small changes at regular intervals are proposed in [9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Load Balancing in WDM Networks through Adaptive Routing Table Changes

Brunato

Battiti

Salvadori

2002

NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. In this paper we develop a Load Balancing algorithm for IP-based Optical Networks. The considered networks are based on a routing protocol where the next hop at a given node depends only on the destination of the communication. Our algorithm (RSNE -Reverse Subtree Neighborhood Exploration) performs at each iteration a basic change of a single entry in a routing table in order to minimize the disruption of the network. We study the performance of our algorithm in realistic networks under static and dynamic traffic scenarios. Simulation results show a rapid reduction of the congestion for static networks and a performance of the incremental scheme while tracking a changing traffic matrix comparable to the complete reoptimization of the traffic.

show abstract

Dynamic load balancing in WDM packet networks with and without wavelength constraints

Cited by 81 publications

References 12 publications

Topology Reconfiguration with Successive Approximations

Topology Reconfiguration with Successive Approximations

Joint logical topology design, interface assignment, channel allocation, and routing for multi-channel wireless mesh networks

Load Balancing in WDM Networks through Adaptive Routing Table Changes

Contact Info

Product

Resources

About