R. H. Hwang, J. F. Kurose, and D. Towsley, "MDP routing in ATM networks using the virtual path concept," in Proc. IEEE Infocom, 1994, pp. 1509--1517.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....into congestion. Over the years, researchers have learned that the simple least loaded routing (LLR) with trunk reservation can provide significant throughput gain over fixed routing while other more elaborate approaches (e.g. Markov decision process) can only provide marginal throughput gain [17], 18] This is probably the reason LLR was chosen as the basis of RTNR in the AT T Network. In dynamic routing, a routing decision must be made at callarrival time based on the network information available at that time. However, a decision once made is final. One method to increase the ....

R. H. Hwang, J. F. Kurose, and D. Towsley, "MDP routing in ATM networks using the virtual path concept," in Proc. IEEE Infocom, 1994, pp. 1509--1517.

.... When two traffic flows with different QOS requirements (i.e. different Cell Loss Probabilities) arrive to a node and, these share the same destination node, as far as local decisions are concerned, two possible and simple approaches to virtual traffic management can be taken [1] 2] 3] [4], 5] In an INTEGRATION APPROACH 3 (Sharing) all the traffic from different connections are multiplexed onto one VP. While sharing the available bandwidth and buffers. The capacity allocated to the VP should be large enough to satisfy all the individual QOS. Arriving cells from all source types ....

R.H. Hwang, J.E. Kurose and D. Towsley. "MDP Routing in ATM Networks Using the Virtual Path Concept".INFOCOM'94. pp. 1509-1517

....and two links (called alternative routes) are then used. For a fullyconnected network with N nodes, each pair of nodes has one direct route and N Gamma 2 two link alternative routes. A number of such routing schemes were designed for telephone networks [5, 4, 1, 6] and recently for ATM networks [16, 8, 11, 12, 9, 10]. We consider a network that supports S 2 classes of connections (or virtual circuits) A virtual circuit (VC) of class s requires the reservation of a certain amount of bandwidth b s that is enough to ensure a given quality of service (QOS) This bandwidth can be thought of either as the peak ....

R-H. Hwang, J. Kurose, and D. Towsley. MDP Routing in ATM Networks Using Virtual Path Concept. In Proc. IEEE INFOCOM, pages 1509--1517, Toronto, Ontario, Canada, June 1994.

....maintain a route to the landmark, but the landmark may not have a route to these nodes. In the viewserver hierarchy, a viewserver maintains (in its view) routes to the nodes in its precinct. A number of VC routing schemes have also been designed for networks that use the Virtual Path (VP) concept [17, 16]. This VP concept has been proposed to achieve scaling and simplify network management and control. Typically, a VP is installed between two nodes over a sequence of physical links. Resources are statically allocated to the VP so that queueing occurs only at the first physical link. Separate ....

....in small VC setup times. In addition, the view maintained at a node would contain only those nodes at which VPs originate. In general, it is not clear how to install VPs [9] Also, the static allocation of resources to VPs can result in resource under utilization and higher blocking probabilities [17]. One approach to solve this problem is to install fewer VPs and thus use longer paths (i.e. consisting of more than two VPs) Another approach is to dynamically allocate resources to VPs [21, 5] It is not clear, however, how these allocations could be varied effectively without causing massive ....

R-H. Hwang, J. Kurose, and D. Towsley. MDP Routing in ATM Networks Using Virtual Path Concept. In Proc. IEEE INFOCOM, pages 1509--1517, Toronto, Ontario, Canada, June 1994.

....of the agreement between Telecom Italia and Fondazione Ugo Bordoni V. Eramo, I. Martino, U. Mocci, C. Scoglio TBPE: a Routing Algorithm based on QoS Estimation and Forecast can be mathematically described by a Markovian Decision Process (MDP) and the routing algorithm is called MDP routing [Hwa2]. The MDP routing is described in section 3 under simplified assumptions, such as the link decomposition and the link occupation aggregate state variable, which reduce the dimensions of the problem, making it solvable and feasible. This method requires a high network monitoring rate, since ....

....of the MDP algorithm To illustrate the MDP routing algorithm we consider k (k = 1, 2, D) traffic classes, with class k described by l k , k , r k , where l k is the Poisson arrival rate, 1 k is the mean holding time, r k is the call bandwidth requirement. The MDP routing algorithm [Hwa2] is described by the flow diagram on figure 1a. A call between the nodes (m, n) belonging to the traffic class k, is accommodated on the single link direct route if there is enough bandwidth and if the cost of the link (m, n) involved by the call, C k (s m,n ) depending on the state s m,n , is ....

R.H. Hwang, J.F. Kurose and D. Towsley, "MDP Routing in ATM Networks Using Virtual Path Concept", IEEE Infocom, Toronto, June 12-16, 1994.

.... transmission network, b) Example of the associated 6 node ATM traffic network(fl switching node, 2 cross connect node) ing have been addressed to some extent for ATM high speed networks [13] 23] dynamic call routing in the presence of static virtual path has also been presented [16] [19], 28] 30] however, these and the references listed earlier do not address the two level routing dynamism for dynamically reconfigurable broadband networks that we are considering here nor do they address network dimensioning for such networks when multiple traffic classes are offered. 2. ....

R.-H. Hwang, J. Kurose and D. Towsley, "MDP Routing in ATM Networks Using Virtual Path Concept," Proceedings of IEEE INFOCOM'94 , pp. 1509--1517, June 1994.

.... use of available resources while providing probabilistic guarantees of quality of service (QoS) Use of virtual path as an effective transport technique, and for routing and resource management for ATM networks has recently gained considerable attention [1] 2] 9] 10] 11] 13] 21] [25], 27] 32] 38] 40] By grouping virtual circuits into a virtual path, an ATM based network can be better managed. This can result in reduction of call set up time if there exists a virtual path (with enough capacity) between an origin and a destination since there is no need for extra ....

R.-H. Hwang, J. F. Kurose and D. Towsley, "MDP Routing in ATM Networks Using Virtual Path Concept," Proceedings of IEEE INFOCOM'94, pp. 1509-1517, June 1994.

....admission described in Section 4. The required bandwidths R j c are computed using equation (9) if the computed value is not integer, it is rounded to the smallest integer greater than this value. We assume adequate buffer space. A number of routing schemes recently proposed for ATM networks [25,28,29,26,27] have been designed for networks that use the Virtual Path (VP) concept. This VP concept has been proposed to simplify network management and control. Typically, a VP is installed between two nodes over a sequence of physical links. Resources are statically allocated to the VP so that queueing ....

R-H. Hwang, J. Kurose, and D. Towsley. MDP Routing in ATM Networks Using Virtual Path Concept. In Proc. IEEE INFOCOM , pages 1509--1517, Toronto, Ontario, Canada, June 1994.

....routes) and two links (called alternative routes) are then used. For a fullyconnected network with N nodes, each pair of nodes has one direct route and N Gamma 2 two link alternative routes. A number of such routing schemes were designed for telephone networks [3] and recently for ATM networks [10, 4, 6, 5]. I. Matta was partially supported by NU RSDF grant 377090. We consider a network that supports S 2 classes of connections (or virtual circuits) A virtual circuit (VC) of class s requires the reservation of a certain amount of bandwidth b s that is enough to ensure a given quality of service ....

R.-H. Hwang, J. Kurose, and D. Towsley. MDP routing in ATM networks using virtual path concept. In IEEE INFOCOM, pages 1509--1517, Toronto, Ontario, Canada, June 1994.

....two links (called alternative routes) are then used. For a fullyconnected network with N nodes, each pair of nodes has one direct route and N Gamma 2 two link alternative routes. A number of such routing schemes were designed for telephone networks [11, 10, 3, 12] and recently for ATM networks [31, 15, 18, 19, 16, 17]. 3.1 SIMULATION MODEL AND SETUP We consider a fully connected logical VP network, which could be carved out over an arbitrary underlying physical topology. We assume all VP links have the same total bandwidth. The network is used by a number of VC classes. A class s VC requires the reservation ....

R-H. Hwang, J. Kurose, and D. Towsley. MDP Routing in ATM Networks Using Virtual Path Concept. In Proc. IEEE INFOCOM, pages 1509--1517, Toronto, Ontario, Canada, June 1994.

....and used to estimate the cost of a path to the VC s destination. The route selection algorithm then favors short paths with minimum cost. See [17, 22] for an evaluation of several schemes. A number of VC routing schemes have also been designed for networks using the Virtual Path (VP) concept [15, 14]. This VP concept has been proposed to simplify network management and control by having separate (logically) fully connected subnetworks, typically one for each service class. In each VP subnetwork, simple routing schemes that only consider one hop and two hop paths are used. However, the ....

....(logically) fully connected subnetworks, typically one for each service class. In each VP subnetwork, simple routing schemes that only consider one hop and two hop paths are used. However, the advantage of using VPs can be offset by a decrease in statistical multiplexing gains of the subnetworks [15]. In this work, we are interested in general network topologies, where the shortest paths can be of arbitrary hop length and the overhead of routing protocols is of much concern. All the above VC routing schemes are based on the link state approach. VC routing schemes based on the path vector ....

R-H. Hwang, J. Kurose, and D. Towsley. MDP Routing in ATM Networks Using Virtual Path Concept. In Proc. IEEE INFOCOM, pages 1509--1517, Toronto, Ontario, Canada, June 1994.

....are restricted to homogeneous traffic classes. That is, only a single traffic class is supported in each VP network. In [8] Least Loaded Routing (LLR) based algorithms for VP networks supporting homogeneous traffic classes with one quality of service (QoS) requirement are proposed. In Page 2 [10][11] the study is extended to the case in which each VP can support two QoS requirements and Markov Decision Process (MDP) based routing algorithms are also developed. In [17] the application of LLR algorithm for multi rate traffic class with different QoS requirements in circuit switched ....

....have less stringent QoS requirements than calls using 2 link alternative routes. In order for a node to support multiple QoS requirements, e and e 2, dedicated buffers are allocated (K 1 and K 2 ) to each class of QoS, as shown in Fig. 2. This separate buffers approach is also adopted in [7][10]. In [16] it shows that the traffic characteristics of a call are not changed as it passes through a VP along its route under certain situations. We shall make the same assumption in this paper. The effective bandwidth method [5] is used to find the bandwidth required to support the calls. For ....

[Article contains additional citation context not shown here]

R. H. Hwang, J. F. Kurose and D. Towsley, "MDP Routing in ATM Networks Using the Virtual Path Concept", Proceedings IEEE Infocom 94, pp.1509-1517. Page 16

....whether sufficient spare resources are available to admit the call through a given route. In turn, routing algorithms rely on suitable link metrics [21] to establish possible routing options. Our focus herein, is on suitable metrics, rather than the routing algorithms; for work on routing see [3, 22, 23] and references therein. 2.1 Traffic Descriptor and QoS Requirements The proposed traffic descriptor for a traffic stream is its effective bandwidth. It depends on both the statistical nature of the stream of cells and the nature of the required QoS constraint. Consider a buffered link with ....

R.-H. Hwang, J.F. Kurose, and D. Towsley. MDP routing in ATM networks using the virtual path concept. IEEE INFOCOM Proc., pages pp. 1509--1517, 1994.

....information expressed in terms of link utilizations and delays. Section 5 contains results for two networks. In the first network, routing schemes consider one link and two link paths when routing incoming connections. Such schemes are often proposed for virtual path based ATM networks (e.g. [8]) The second network has the NSFNET backbone topology and routing schemes consider shortest paths of arbitrary length. Such schemes are often proposed for the Internet (e.g. 3] Section 6 concludes the paper. 2. Network Model We consider networks of arbitrary topology supporting real time ....

R.-H. Hwang, J. Kurose, and D. Towsley. MDP routing in ATM networks using virtual path concept. In IEEE INFOCOM, pages 1509--1517, Toronto, Ontario, Canada, June 1994.

....two links (called alternative routes) are then used. For a fully connected network with N nodes, each pair of nodes has one direct route and N Gamma 2 two link alternative routes. A number of such routing schemes were designed for telephone networks [13, 12, 3, 14] and recently for ATM networks [32, 17, 20, 21, 18, 19]. 3.1 Simulation Model and Setup We consider a fully connected logical VP network, which could be carved out over an arbitrary underlying physical topology. We assume all VP links have the same total bandwidth. The network is used by a number of VC classes. A class s VC requires the reservation ....

R-H. Hwang, J. Kurose, and D. Towsley. MDP Routing in ATM Networks Using Virtual Path Concept. In Proc. IEEE INFOCOM, pages 1509--1517, Toronto, Ontario, Canada, June 1994.

No context found.

R.-H. Hwang, J. F. Kurose, and D. Towsley. "MDP routing in ATM Networks Using Virtual Path Concept". Proc. IEEE Infocom '94, pages 1509--1517, June 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC