Hongbin Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hongbin Luo has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Lemin Li
University of Electronic Science and Technology of China
5 shared publications - Hongfang Yu
School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China
3 shared publications - Sheng Wang
University of Electronic Science and Technology of China
2 shared publications - Cai Lu1 shared publication
- Gang Hu
University of Electronic Science and Technology of China
1 shared publication Gbin Luo
1 shared publication
Latest Publications
- 13 September 2007
- Published by Springer Nature in Photonic Network Communications
- Vol. 14 (3) , 361-368
Insights for segment protection in survivable WDM mesh networks with SRLG constraints
- 13 September 2007
- Published by Springer Nature in Photonic Network Communications
- Vol. 14 (3) , 361-368
Insights for segment protection in survivable WDM mesh networks with SRLG constraints
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 297-302
An Approximation Algorithm for Provisioning of Survivable Multicast Sessions in WDM Networks
It has been widely recognized in the literature that it is imperative to protect light-tree based multicast sessions against single link failures since a single fiber failure can disrupt the information dissemination to several destination nodes. In this paper, we address the problem of routing survivable multicast sessions (RSMS) in wavelength-division multiplexing (WDM) mesh networks. We consider the dynamic network environment, where multicast sessions arrive dynamically one after another. Our objective is to be able to consume as least cost (e.g., wavelengths) as possible for one-at-a-time arrivals and no priori knowledge of future arrivals. We present an approximation algorithm that outperforms previously proposed algorithms for the RSMS problem such as optimal path-pair-based shared disjoint paths (OPPSDP). To the best of our knowledge, this is the first approximation algorithm proposed for the RSMS problem. We prove that the cost of the solution obtained by the HCBA algorithm is at most 4 times that of the optimal solution. We show by simulation that our algorithm performs very close to the optimal solution obtained by solving a mathematical formulation for the RSMS problem. We also show that, compared with the OPPSDP algorithm, our algorithm can significantly reduce the average cost and the blocking probability.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 297-302
An Approximation Algorithm for Provisioning of Survivable Multicast Sessions in WDM Networks
It has been widely recognized in the literature that it is imperative to protect light-tree based multicast sessions against single link failures since a single fiber failure can disrupt the information dissemination to several destination nodes. In this paper, we address the problem of routing survivable multicast sessions (RSMS) in wavelength-division multiplexing (WDM) mesh networks. We consider the dynamic network environment, where multicast sessions arrive dynamically one after another. Our objective is to be able to consume as least cost (e.g., wavelengths) as possible for one-at-a-time arrivals and no priori knowledge of future arrivals. We present an approximation algorithm that outperforms previously proposed algorithms for the RSMS problem such as optimal path-pair-based shared disjoint paths (OPPSDP). To the best of our knowledge, this is the first approximation algorithm proposed for the RSMS problem. We prove that the cost of the solution obtained by the HCBA algorithm is at most 4 times that of the optimal solution. We show by simulation that our algorithm performs very close to the optimal solution obtained by solving a mathematical formulation for the RSMS problem. We also show that, compared with the OPPSDP algorithm, our algorithm can significantly reduce the average cost and the blocking probability.
- Open Access
- 9 June 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (3) , 329-336
A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks
- 9 June 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (3) , 329-336
Open AccessA Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1918-1922
A Novel Algorithm for Constructing Light-Trees in Mesh WDM Networks
It has been recognized that light-trees should be as balanced as possible in order to guarantee an adequate signal quality and to scale to large destination sets, if power losses are taken into account when routing connections in mesh WDM networks. In this paper we study the problem of constructing such balanced light-trees. We propose a novel algorithm, called extended shortest path heuristic algorithm (ESPH) and is an extended version of the well known shortest path heuristic (SPH) algorithm, for the problem. The ESPH algorithm aims to minimize the difference between the optimal signal quality and the worst signal quality in the process of constructing light-trees. Simulations on a typical mesh network are conducted to verify the performance of the ESPH algorithm. Results demonstrate that the light-trees constructed by the ESPH algorithm are more balanced than those constructed by the only existing algorithm, called BLT (balanced light-tree algorithm) for the same problem, with a little more cost. Thus light-trees constructed by the ESPH algorithm can provide better signal quality and are more scalable than these constructed by the BLT algorithm
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1918-1922
A Novel Algorithm for Constructing Light-Trees in Mesh WDM Networks
It has been recognized that light-trees should be as balanced as possible in order to guarantee an adequate signal quality and to scale to large destination sets, if power losses are taken into account when routing connections in mesh WDM networks. In this paper we study the problem of constructing such balanced light-trees. We propose a novel algorithm, called extended shortest path heuristic algorithm (ESPH) and is an extended version of the well known shortest path heuristic (SPH) algorithm, for the problem. The ESPH algorithm aims to minimize the difference between the optimal signal quality and the worst signal quality in the process of constructing light-trees. Simulations on a typical mesh network are conducted to verify the performance of the ESPH algorithm. Results demonstrate that the light-trees constructed by the ESPH algorithm are more balanced than those constructed by the only existing algorithm, called BLT (balanced light-tree algorithm) for the same problem, with a little more cost. Thus light-trees constructed by the ESPH algorithm can provide better signal quality and are more scalable than these constructed by the BLT algorithm
- 1 January 2006
- Published by Springer Nature in Photonic Network Communications
- Vol. 11 (1) , 87-97
Burstification Queue Management in Optical Burst Switching Networks
- 1 January 2006
- Published by Springer Nature in Photonic Network Communications
- Vol. 11 (1) , 87-97
Burstification Queue Management in Optical Burst Switching Networks
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15503607) , 835-840
On Protecting Dynamic Multicast Sessions in Survivable Mesh WDM Networks
The advances in wavelength-division multiplexing (WDM) technology are expected to facilitate bandwidth-intensive multicast applications. A single fiber cut on such a network, however, can disrupt the transmission of information to several destination nodes on a "light-tree"- based multicast session. Thus it is imperative to protect multicast sessions. In this article we propose a novel protection scheme called multicast protection through spanning paths (MPSP) for efficient multicast protection. Here, a spanning path is a path from a leaf node to any other leaf node of a multicast tree. The key idea of MPSP is to derive a backup path for each spanning path and then appropriately select part of these backup paths to protect the primary multicast tree such that the total bandwidth allocated to the primary multicast session and its protection paths (or trees, etc.) for all the multicast sessions is minimized. Simulation results are used to demonstrate the good performance of the proposed protection scheme in reducing the spare capacity for protection. Compared with existing schemes, the decrease in average cost can be quite high (e.g., decrease about 20%) and the blocking probability can be reduced approximately 15%.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15503607) , 835-840
On Protecting Dynamic Multicast Sessions in Survivable Mesh WDM Networks
The advances in wavelength-division multiplexing (WDM) technology are expected to facilitate bandwidth-intensive multicast applications. A single fiber cut on such a network, however, can disrupt the transmission of information to several destination nodes on a "light-tree"- based multicast session. Thus it is imperative to protect multicast sessions. In this article we propose a novel protection scheme called multicast protection through spanning paths (MPSP) for efficient multicast protection. Here, a spanning path is a path from a leaf node to any other leaf node of a multicast tree. The key idea of MPSP is to derive a backup path for each spanning path and then appropriately select part of these backup paths to protect the primary multicast tree such that the total bandwidth allocated to the primary multicast session and its protection paths (or trees, etc.) for all the multicast sessions is minimized. Simulation results are used to demonstrate the good performance of the proposed protection scheme in reducing the spare capacity for protection. Compared with existing schemes, the decrease in average cost can be quite high (e.g., decrease about 20%) and the blocking probability can be reduced approximately 15%.