Enhanced Optimal and Heuristic Solutions of the Routing Problem in Light-Trail Networks

Ayad, A.S.; Elsayed, Khaled A.; Ahmed, Sheeraz

doi:10.1007/s11107-007-0080-3

Cited by 12 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…D 2 ATD_DBA uses S lk avg and buf lk avg as thresholds to categorize the four cases for node i (line [16][17][18][19][20][21][22][23][24][25][26][27][28] If the first condition holds, it means that the amount of buffered traffic of node i is larger than the mean size of buffered traffic of the whole light-trail. The other condition implies that node i accumulates traffic of the class min_type more than the mean volume of the same class in the whole light-trail.…”

Section: Proposed Dba Algorithm In Light-trail Networkmentioning

confidence: 99%

“…In addition to architecture design and MAC protocol proposals [3][4][5][6][7][8]17,24], there are other interesting issues like the routing problem and DBA problem [21]. The routing problem is an extensively investigated one in light-trails, e.g., the static routing problem [2,3,23,26,30], the dynamic routing problem [14,19,[28][29][30]. On the contrary, the DBA problem catches the attention later and relevant work includes DBA for burst traffic [11] and DBA for constant traffic [1].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient resource management scheme in light-trail networks

Hsu

2016

Photon Netw Commun

View full text Add to dashboard Cite

Light-trail, a framework proposed in the past few years, is generalized from the concept of lightpath, and its distinguishing features include bandwidth sharing and efficient bandwidth utilization. Performance of light-trail networks depends on the routing algorithm and the dynamic bandwidth allocation (DBA) scheme, and the former issue has been discussed extensively. In this work, we aim at the design of an efficient DBA scheme, named Demand and Delay-latency Aware with Two-round Deliberation (D 2 ATD), to allocate bandwidth more accurately and efficiently in light-trail networks. In addition to DBA issue, D 2 ATD includes a light-trail setup/release mechanism as well. As expected, the simulation results reveal superiority of D 2 ATD in both blocking performance and delay performance. Although D 2 ATD pays This paper is an extension of our previous work published in Proc. Int. Conf. on Network-Based Information Systems (NBiS), 2010. The following is the list of the major differences between the previous paper and the current submission: (1) The current submission gives a more detailed survey of previous work and much more figures, tables, and relevant discussions.(2) The current submission refines and makes elaborate explanation of the proposed scheme and formulates light-trail setup/release operations in the algorithmic pseudo code form.(3) The current submission assesses the proposed scheme under four scenarios which are combinations of different settings of packet sizes and the ratio among three service types. Discussions in our NBiS paper are based on one scenario only. (4) The NBiS work merely evaluates performance gain resulting from the proposed DBA algorithm while the current submission discusses the overall effect brought by the proposed DBA algorithm and the proposed light-trail setup/release mechanism in addition. The current submission includes more references relevant to light-trails as compared with our NBiS paper.B Ching-Fang Hsu a price of control overhead for performance gain, it is still reasonable since the amount of control messages does not exceed the capacity of the control channel. It verifies that D 2 ATD can properly employ the control channel to achieve excellent performance.

show abstract

Section: Proposed Dba Algorithm In Light-trail Networkmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An efficient resource management scheme in light-trail networks

Hsu

2016

Photon Netw Commun

View full text Add to dashboard Cite

show abstract

“…The NP-hard light-trail scheduling problem with arbitrary bandwidth requirements on ring networks and general networks has generally been solved using heuristics and evaluated experimentally [10,11,12,13,14,15] without any bound on the performance.…”

Section: Previous Workmentioning

confidence: 99%

Fragmented coloring of proper interval and split graphs

Diwan

Pal

Ranade

2015

Discrete Applied Mathematics

View full text Add to dashboard Cite

“…Several objectives are mentioned in the seminal paper [10] -to minimize total number of light-trails used, to minimize queuing delay, to maximize network utilization etc. Most of the work in the literature seems to solve the problem by minimizing total number of light-trails used [11,12,13,14]. Though the paper [12] suggests that minimizing total number of light-trails also minimizes total number of wavelengths, it may not be always true.…”

Section: Previous Workmentioning

confidence: 99%

Scheduling light-trails on WDM rings

Pal

Ranade

2012

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

a b s t r a c tWe consider the problem of scheduling communication on optical WDM (wavelength division multiplexing) networks using the light-trails technology. We seek to design scheduling algorithms such that the given transmission requests can be scheduled using a minimum number of wavelengths (optical channels). We provide algorithms and close lower bounds for two versions of the problem on an n processor linear array/ring network. In the stationary version, the pattern of transmissions (given) is assumed to not change over time. For this, a simple lower bound is c, the congestion or the maximum total traffic required to pass through any link. We give an algorithm that schedules the transmissions using O(c + log n) wavelengths. We also show a pattern for which Ω(c + log n/ log log n) wavelengths are needed. In the on-line version, the transmissions arrive and depart dynamically, and must be scheduled without upsetting the previously scheduled transmissions. For this case we give an on-line algorithm which has competitive ratio Θ(log n). We show that this is optimal in the sense that every on-line algorithm must have competitive ratio Ω(log n). We also give an algorithm that appears to do well in simulations (for the classes of traffic we consider), but which has competitive ratio between Ω(log 2 n/ log log n) and O(log 2 n). We present detailed simulations of both our algorithms.

show abstract

Enhanced Optimal and Heuristic Solutions of the Routing Problem in Light-Trail Networks

Cited by 12 publications

References 8 publications

An efficient resource management scheme in light-trail networks

An efficient resource management scheme in light-trail networks

Fragmented coloring of proper interval and split graphs

Scheduling light-trails on WDM rings

Contact Info

Product

Resources

About