A new route selection approach using scaling techniques: an application to hierarchical QoS-based routing

Saltouros, M.P.; Markaki, Maria E.; Taskaris, A.; Theologou, M.; Venieris, I.S.

doi:10.1109/lcn.2000.891118

“…Via Eqs. (26), (28), and (30), we get the end-to-end delay, delay variance, and cell loss probability under RRS of Eq. (33) as shown in Fig.…”

Section: Network-wise Performance For a Mesh Network With Probabilistmentioning

confidence: 99%

Traffic splitting in a network: split traffic models and applications

Ferng

¹

2004

Computer Communications

View full text Add to dashboard Cite

The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the emerging multimedia applications. However, problems, such as network congestion caused by overloaded traffic get worse day by day. Thus, how to properly control the system while maintaining the quality of service (QoS) for users becomes an important and challenging issue. To reach the goal of QoS guarantee, load sharing or traffic balancing is one of important techniques to improve the whole network performance. In this paper, we focus on the probabilistic routing policy and analyze split traffic models under such a probabilistic routing policy with input traffic models of the batch Markovian arrival process (BMAP) and discrete-time BMAP (D-BMAP) which can be employed to characterize the multimedia traffic in current and future networks. We successfully show that the split traffic on each routing path from an original BMAP (D-BMAP) input is still a BMAP (D-BMAP). The detailed traffic structure is also acquired. Applying traffic splitting along with the output process characterization, we propose a network-wise performance evaluation method suitable for mesh networks with a probabilistic routing algorithm to get the end-to-end delay, delay variance, and cell loss probability. With numerical experiments, we show that (i) the probabilistic routing policy with a random routing matrix performs well for systems; (ii) the proposed method of network-wise performance analysis has good accuracy. q

show abstract

“…Via Eqs. (26), (28), and (30), we get the end-to-end delay, delay variance, and cell loss probability under RRS of Eq. (33) as shown in Fig.…”

Section: Network-wise Performance For a Mesh Network With Probabilistmentioning

confidence: 99%

“…Saltouros et al also applied the probabilistic routing policy to the hierarchical routing in an ATM network in Ref. [28], where a routing cost function achieving the minimum number of hops is used to assign a path selection probability. To consider the load sharing of packet-switched networks, a weighted fair routing policy was proposed by Leung and Li in Ref.…”

Section: Introductionmentioning

confidence: 99%

Traffic splitting in a network: split traffic models and applications

Ferng

¹

,

Peng

²

2004

Computer Communications

2

0

View full text Add to dashboard Cite

The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the emerging multimedia applications. However, problems, such as network congestion caused by overloaded traffic get worse day by day. Thus, how to properly control the system while maintaining the quality of service (QoS) for users becomes an important and challenging issue. To reach the goal of QoS guarantee, load sharing or traffic balancing is one of important techniques to improve the whole network performance. In this paper, we focus on the probabilistic routing policy and analyze split traffic models under such a probabilistic routing policy with input traffic models of the batch Markovian arrival process (BMAP) and discrete-time BMAP (D-BMAP) which can be employed to characterize the multimedia traffic in current and future networks. We successfully show that the split traffic on each routing path from an original BMAP (D-BMAP) input is still a BMAP (D-BMAP). The detailed traffic structure is also acquired. Applying traffic splitting along with the output process characterization, we propose a network-wise performance evaluation method suitable for mesh networks with a probabilistic routing algorithm to get the end-to-end delay, delay variance, and cell loss probability. With numerical experiments, we show that (i) the probabilistic routing policy with a random routing matrix performs well for systems; (ii) the proposed method of network-wise performance analysis has good accuracy. q

show abstract