2008 IEEE International Conference on Communications 2008
DOI: 10.1109/icc.2008.975
|View full text |Cite
|
Sign up to set email alerts
|

CaDAR: An Efficient Routing Algorithm for Wireless-Optical Broadband Access Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(22 citation statements)
references
References 16 publications
0
22
0
Order By: Relevance
“…A dynamic reconfiguration algorithm in WDM PONs is proposed in [9] for the better bandwidth utilization. Delay-Aware Routing Algorithm (DARA) [10] and Capacity and Delay Aware Routing Algorithm (CaDAR) [11] have been proposed to address the routing issue in the FiWi network. Moreover, a centralized integrated routing algorithm is proposed in [12] to achieve the load balance at ONUs and to maximize the network throughput.…”
Section: Related Workmentioning
confidence: 99%
“…A dynamic reconfiguration algorithm in WDM PONs is proposed in [9] for the better bandwidth utilization. Delay-Aware Routing Algorithm (DARA) [10] and Capacity and Delay Aware Routing Algorithm (CaDAR) [11] have been proposed to address the routing issue in the FiWi network. Moreover, a centralized integrated routing algorithm is proposed in [12] to achieve the load balance at ONUs and to maximize the network throughput.…”
Section: Related Workmentioning
confidence: 99%
“…So it's possible for us to find an alternative path P 2 in the wireless subnetwork with relaxed path delay no more than the delay bound and meanwhile with smaller maximal link delay compared with P 1 by utilizing the delay gap. Since the time frame length in the TDMA schedule in [2] and the average wireless lilnk delay in [4] have the same measure metric as ms and the delay gap is at most one time frame, it's practicable to find the alternative path. In particular, we define the Interference Aware and Delay Bounded Routing (IADBR) problem as finding the path with its path delay no more than the delay bound and meanwhile with the minimal maximal link delay.…”
Section: Figure 1 Architecture Of a Woan Networkmentioning
confidence: 99%
“…In WOAN, various routing algorithms have been proposed in [1] [3] [4] focusing on the traffic to the Internet. Considering traffic aggregated at the wireless mesh router a destinated to the Internet, suppose that it goes through the shortest delay path in the wireless subnetwork to arrive at a ONU (gateway).…”
Section: Figure 1 Architecture Of a Woan Networkmentioning
confidence: 99%
“…In this paper work is done on reducing energy consumption not only at optical part but also at the wireless end of the FiWi networks. The proposed energy saving algorithm, referred to as Green FiWi (GFiWi) switches maximum number of nodes into sleep mode where the Capacity and Delay Aware Routing algorithm [14] is exploited in order to route the traffic through least delay path. Figure 1 shows the general architecture of a FiWi network consisting of a large number of nodes in the wireless front end, due to which majority of the nodes remain idle most of the time particularly when the traffic is low in the network [15].…”
Section: Introductionmentioning
confidence: 99%