GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference 2009
DOI: 10.1109/glocom.2009.5425570
|View full text |Cite
|
Sign up to set email alerts
|

Graphical Probabilistic Routing Model for OBS Networks with Realistic Traffic Scenario

Abstract: Burst contention is a well-known challenging problem in Optical Burst Switching (OBS) networks. Contention resolution approaches are always reactive and attempt to minimize the BLR based on local information available at the core node. On the other hand, a proactive approach that avoids burst losses before they occur is desirable. To reduce the probability of burst contention, a more robust routing algorithm than the shortest path is needed. This paper proposes a new routing mechanism for JET-based OBS network… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0
2

Year Published

2011
2011
2021
2021

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 8 publications
0
5
0
2
Order By: Relevance
“…In [59], Graphic Probabilistic Routing Model (GPRM) which is based on Bayesian Network (BN) is presented to select less utilized links in an Optical Burst Switching (OBS) network to reduce Burst Loss Ratio (BLR) without affecting the end-to-end delay. A BN model is exploited at each node in the network, which determines the next hop according to a routing table updated by the BN.…”
Section: Supervised Learning-based Routingmentioning
confidence: 99%
See 1 more Smart Citation
“…In [59], Graphic Probabilistic Routing Model (GPRM) which is based on Bayesian Network (BN) is presented to select less utilized links in an Optical Burst Switching (OBS) network to reduce Burst Loss Ratio (BLR) without affecting the end-to-end delay. A BN model is exploited at each node in the network, which determines the next hop according to a routing table updated by the BN.…”
Section: Supervised Learning-based Routingmentioning
confidence: 99%
“…Heuristic-based route planning will suffer high computational complexity when facing large scale topology.To overcome the drawbacks of simple SPF routing and heuristic-based routing, ML techniques have been employed. Some works model the routing allocation as classification and regression tasks, which use supervised learning to obtain the rules of routes generation from the historical route dataset[59] [60][61]. Other works model the routing problem as decision-making tasks, in which the RL is employed to generate optimal routing assignment [62][63]…”
mentioning
confidence: 99%
“…Very few studies exist on the application of machine learning to classify OBS nodes. In [9,10], authors studied the application of ML in OBS networks. In [6], authors classified the nature of data burst loss in the OBS network into two categories, i.e., loss due to contention and loss due to congestion.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This routing table is used when the BHP attempts (in the electronic domain) to reserve the ressource for the data burst. GPRM is composed of four evidences and one decision node for each possible next hop [4]. A lookup to the routing table is done according to evidences in order to successively get the best next hop in terms of probability of success to reach the destination.…”
Section: Graphical Probabilistic Routing Model For Obs Networkmentioning
confidence: 99%