Performance and testbed study of topology reconfiguration in IP over optical networks

Liu, K.H.; Liu, Changdong; Pastor, Jorge; Roy, Abhay; Wei, Jingyu

doi:10.1109/tcomm.2002.803972

Cited by 27 publications

(20 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Initial investigations on virtual topology reconfiguration consider solely the case of one-time adaptations. In such cases, a change in traffic is known and procedures adapt the existing VTD to this change, without considering periodic (multi-hour) traffic trends [8], [11]- [14]. In all these works, a common objective is to minimize the number of lightpath reconfigurations in the VTD so as to reduce disruptions in the traffic connections.…”

Section: Related Workmentioning

confidence: 99%

“…A solution in TS consists of T virtual topology designs, one for each time slot t = 1, …, T. Each one of these VTDs is computed by the single time slot MILP formulation (14). This formulation receives as input a single traffic matrix and a set of upper bounds on the number of transceivers at each node.…”

Section: A Solution Computationmentioning

confidence: 99%

“…The objective function and the set of constraints are described in (14), for the problem associated with a time slot t = 1, ..., T:…”

Section: A Solution Computationmentioning

confidence: 99%

“…The heuristic iteratively solves smaller MILP formulations (14) limiting the number of transceivers for independent time intervals in order to jump between neighboring solutions, and, thus, explore the solution space in a directed manner.…”

Section: B Solution Space Explorationmentioning

confidence: 99%

“…After solving (14), without limiting the number of transceivers, for each time slot t = {1...T} to create an initial solution, Tabu Search iterations are run alternating between limiting the total number of transmitters and the total number of receivers until the maximal number of iterations without improvement of the best solution is met. Upon termination, the incumbent (i.e., best visited) solution is deemed the final result.…”

Section: B Solution Space Explorationmentioning

confidence: 99%

See 4 more Smart Citations

Heuristic Approaches for Periodic Reconfiguration of Lightpath-based Networks under Multi-hour Traffic

Aparicio-Pardo¹,

Garcia-Manrubia²,

Skorin-Kapov³

et al. 2012

JNW

View full text Add to dashboard Cite

Abstract-Periodic lightpath reconfiguration of virtual topologies in transparent optical networks has been recently investigated as a mechanism to more efficiently adapt the network to predictable periodic traffic variations along a day or week. Scheduling periodic reconfigurations involves tuning a trade-off between a lower network cost obtained through better resource allocation, and undesired traffic disruptions that these reconfigurations may cause. This paper presents and compares two algorithms for planning a reconfigurable virtual topology suitable for exploring this trade-off. The first is based on a Lagrangean Relaxation of the planning problem, and the second is based on a Tabu Search meta-heuristic. The merits of both algorithms are assessed for moderate network sizes through comparison with analytical lower bounds and exact solutions obtained by a MILP formulation.Index Terms-virtual topology design, network planning, multi-hour traffic, Lagrangean Relaxation, Tabu Search.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: A Solution Computationmentioning

confidence: 99%

“…The objective function and the set of constraints are described in (14), for the problem associated with a time slot t = 1, ..., T:…”

Section: A Solution Computationmentioning

confidence: 99%

Section: B Solution Space Explorationmentioning

confidence: 99%

Section: B Solution Space Explorationmentioning

confidence: 99%

See 3 more Smart Citations

Heuristic Approaches for Periodic Reconfiguration of Lightpath-based Networks under Multi-hour Traffic

Aparicio-Pardo¹,

Garcia-Manrubia²,

Skorin-Kapov³

et al. 2012

JNW

View full text Add to dashboard Cite

show abstract

Dynamic packet allocation scheme for an all‐to‐all transmission schedule in WDM networks

Wen

Huang

Tsai

et al. 2006

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYIn wavelength division multiplexing broadcast-and-select star networks, the all-to-all transmission schedule is suitable for the uniform traffic pattern. The system performance is seriously degraded for the non-uniform traffic patterns. Based on the demand assignment control, a dynamic packet allocation algorithm is proposed for the all-to-all transmission schedule. The algorithm decomposes the traffic matrix into a transmission matrix, and a residual matrix with a simple procedure. The transmission matrix is with most entries to approach the uniform traffic matrix. Within the transmission matrix, the idle time slots could be shared with the heavy-load input nodes to increase the packet transmission. The simulation results show that the system with applying the algorithm could efficiently promote the performance on throughput, packet delay and buffer size for non-uniform traffic patterns.

show abstract

A new MAP‐based channel estimation technique for multiple input multiple output diversity schemes

Hoteit

Shayan

Elhakeem

2006

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYThis paper presents a channel estimation technique amenable to space-time coding (STC). An array of transmission antennas operates in band-limited channels with intersymbol interference. The effectiveness of STC schemes requires the development of practical and high-performance algorithms for channel estimation. The channel parameters, to be estimated at the reception antennas, are the attenuations and delays incurred by the signals transversal along the different propagation paths. The estimation technique is based on an iterative procedure derived through the maximum a posteriori probability (MAP) approach. Unlike classic estimation techniques, we iterate on the different probabilities of different coefficients rather than the coefficient values themselves. Two practical approaches are proposed, which are simplified versions of the general approach to implement the derived expressions required to estimate the actual channel coefficients. The performance of the two proposed algorithms has been assessed by simulation. Combined analysis/simulation results are presented and compared against those of conventional channel estimation techniques. Simulation results show that the required performance can be achieved with fewer number of iterations compared to conventional techniques.

show abstract

Performance and testbed study of topology reconfiguration in IP over optical networks

Cited by 27 publications

References 28 publications

Heuristic Approaches for Periodic Reconfiguration of Lightpath-based Networks under Multi-hour Traffic

Heuristic Approaches for Periodic Reconfiguration of Lightpath-based Networks under Multi-hour Traffic

Dynamic packet allocation scheme for an all‐to‐all transmission schedule in WDM networks

A new MAP‐based channel estimation technique for multiple input multiple output diversity schemes

Contact Info

Product

Resources

About