ATM is a connection oriented network while IP is based on a connectionless protocol. Connecting the two networks requires protocol conversion. When IP packets arrive at the interconnection between the two networks, si...
详细信息
ISBN:
(纸本)0819429910
ATM is a connection oriented network while IP is based on a connectionless protocol. Connecting the two networks requires protocol conversion. When IP packets arrive at the interconnection between the two networks, signalling is used to open a switched virtual circuit on the ATM side. In this paper, we look at the management of the ATM connection with a view to reducing the cost of the connection. We develop and compare the cost functions of three connections management policies: the Delayed Vacation Policy, the control Operating Policy and the Permanent Virtual Circuit. Furthermore, we have developed the coditions under which the control Operating Policy (COP) will be more cost effective than the other two policies. We conclude that there always exists some condition under which the COP will be better than the other two polcies.
Cell Loss Ratio estimation is a crucial technology in call admission control and traffic engineering in ATM networks. Cell arrival process and analytical approach had been investigated in recent year. However, an effe...
详细信息
ISBN:
(纸本)0819429910
Cell Loss Ratio estimation is a crucial technology in call admission control and traffic engineering in ATM networks. Cell arrival process and analytical approach had been investigated in recent year. However, an effective and practicable CLR estimator is still a challenge. Based on the analysis of cell loss problem, an improved simple traffic model and a new algorithm are presented in this paper, to estimate CLR of ATM network multiplexed with heterogeneous traffic classes services rapidly. Traffic model is constructed with standard parameters, so it is easy to use in practical situations. The new algorithm runs quickly enough to respond the call real-time. Simulation results show that accuracy, complexity and robustness of algorithm are ideal to be utilized in real network.
ln this paper, we introduce a novel explicit rate algorithm to support available bit rate service in asynchronous transfer mode (ATM) networks. Our algorithm is based on observing the maximum bandwidth usage of differ...
详细信息
ISBN:
(纸本)0819429910
ln this paper, we introduce a novel explicit rate algorithm to support available bit rate service in asynchronous transfer mode (ATM) networks. Our algorithm is based on observing the maximum bandwidth usage of different connections and incorporating both rate and queue length information to achieve a stable operation. Zero steady state queue length is achieved. We separate congestion control and fairness issues in our design and estimate the number of locally bottlenecked active connections. This number is used to normalize control and to redistribute spate bandwidth during transient and does not affect the steady state fair rate used by each connections. As such, our algorithm is relatively insensitive to the accuracy of this number. The issue of supporting both UBR and ABR is addressed. The performance of our algorithm is evaluated through simulations.
In many ATM switches, only a limited number of delay priority queues are available at each link. In order to support all five service categories defined in ATM Forum, the UBR and ABR service classes may have to be ass...
详细信息
ISBN:
(纸本)0819429910
In many ATM switches, only a limited number of delay priority queues are available at each link. In order to support all five service categories defined in ATM Forum, the UBR and ABR service classes may have to be assigned to the same priority queue. In this paper we address the problem of controlling the resource sharing between UBR and ABR when both share the same FIFO queue in an ATM switch. We achieve the desired bandwidth sharing between these two classes by controlling the amount of buffer each class can occupy. In particular, we use the EPD threshold to control UBR by dropping UBR cells when this threshold is exceeded. We show that the control algorithm proposed in this paper achieves a tight control of the resource allocation between UBR and ABR.
This paper presents an in-depth survey on network bandwidth allocation policies and discuss design methodologies oi distributed rate calculation algorithms in packet-switched networks. In particular, we discuss two ra...
详细信息
ISBN:
(纸本)0819429910
This paper presents an in-depth survey on network bandwidth allocation policies and discuss design methodologies oi distributed rate calculation algorithms in packet-switched networks. In particular, we discuss two rate allocation policies: the generalized mace-min (GMM) and the generic weight-proportional mac-min (WPMM) policies, both of which generalize the classical max-min rate allocation policy. For the design of distributed algorithms to achieve these two rate allocation policies, we focus on rate-based distributed flow control where special control packets are employed to achieve the information exchange between a source and the network. We categorize two broad classes of distributed rate calculation algorithms in the literature using live algorithms as illustrations. We compare the design tradeoffs between these two classes of algorithms in terms of performance objectives and implementation complexities and discuss important extensions within each class of algorithms.
In this paper, we study the multicast routing problem in broadband networks. The multicast routing problem, also known as the Steiner tree problem, has been well studied in the literature. However, less attention has ...
详细信息
ISBN:
(纸本)0819429910
In this paper, we study the multicast routing problem in broadband networks. The multicast routing problem, also known as the Steiner tree problem, has been well studied in the literature. However, less attention has been made for the definition of link costs and evaluating the performance of multicast routing algorithm from the network revenue point of view. Therefore, in this paper, we examined three approaches for defining link costs, namely, the Markov Decision Process-based (MDP), the Competitive On-Line (COL) routing-based and the Linear-based approaches. Two heuristic multicast algorithms, TMR and MSPF, were developed for investigating the performance of these approaches. We proposed a new performance metric, referred to as the fractional reward loss, to evaluate the multicast routing algorithm. performance of the multicast algorithms under different link cost functions was evaluated via simulations on a 20-node random graph. Our simulation results indicated that the way of defining link costs affects the performance of the multicast routing algorithms significantly and the best performance is yielded when using the MDP-based link costs.
When a distributed MPEG player system is transmitting MPEG video streams over an open network, like the internet, the system usually has no control on the network traffic. In this paper, we define the quality of servi...
详细信息
ISBN:
(纸本)081869209X
When a distributed MPEG player system is transmitting MPEG video streams over an open network, like the internet, the system usually has no control on the network traffic. In this paper, we define the quality of service (QoS) for video transmissions in an adaptive mechanism, and we propose a priority feedback mechanism with QoS control (PFB-QoS) for a distributed MPEG player system. With the feedback signal coming from each client and our pre-defined priority mapping functions, the current status and priority of each client can be obtained With such information the video server will adapt to the dynamic changes in the network and make efforts to maintain the eos requirement for each client under the current network constraints. From our preliminary experiments, we find that when a video sewer is sewing multiple clients where every client can demand a different QoS, the use of a priority feedback mechanism can effectively maintain the committed quality of service.
In this paper we discuss issues of rate controlling many-to-many multicast connections. In particular, we present an end to end rate control algorithm for (multipoint-to-multipoint) multicast ABR service in ATM networ...
详细信息
ISBN:
(纸本)0819429910
In this paper we discuss issues of rate controlling many-to-many multicast connections. In particular, we present an end to end rate control algorithm for (multipoint-to-multipoint) multicast ABR service in ATM networks. The algorithm is the extension of the SP-MRCA point-to-multipoint congestion control algorithm proposed in 1. The goal is to control the various multicast members input rates in order to achieve high bandwidth utilization without overflowing any queue along a multicast tree. We show that a multipoint-to-multipoint multicast connection can be viewed as a superposition of one-to-many multicast connections, and compute the multicast input rate for each multicast member separately. The algorithm proposed, called SP-MMRCA, inherits many of the properties of the point-to-multipoint SP-MRCA.
A Multimedia Instruction on Demand (MID) serves the purpose of providing an environment for lecture design, lecture annotation, and lecture review over networks. In order to support real-time multimedia interactive pl...
详细信息
A Multimedia Instruction on Demand (MID) serves the purpose of providing an environment for lecture design, lecture annotation, and lecture review over networks. In order to support real-time multimedia interactive playback for such an application, the underlying networks are required to provide network resource management mechanism to enforce the reservation policy. In our design, the MID server and MID gateway consist of the following mechanisms, namely, resource management agent, admission control agent, packet classifier, and packet scheduler. We make use of the framework of the ReSerVation Protocol (RSVP) to devise and implement a network resource management mechanism, which control end-to-end packet delays and bandwidth allocation for the designed Multimedia Instruction on Demand (MID) system. In the present paper, our contributions are as follows: (1) a network resource management scheme is designed to support real-time multimedia over the internet and (2) an experimental test bed is established to measure the system performance. The developed scheme is currently being implemented in the Multimedia Information networking (MINE) laboratory at Tamkang University.
In telecommunication networks, the correlated nature of teletraffic patterns can have significant impact on queueing measures such as queue length, blocking and delay. There is, however, not yet a good general analyti...
详细信息
ISBN:
(纸本)0819429910
In telecommunication networks, the correlated nature of teletraffic patterns can have significant impact on queueing measures such as queue length, blocking and delay. There is, however, not yet a good general analytical description which can easily incorporate the correlation effect of the traffic, while at the same time maintaining the ease of modeling. The authors have shown elsewhere, that the covariance structures of the generalized Interrupted Poisson Process (GIPP) and the generalized Interrupted Bernoulli Process(GIBP) have an invariance property which makes them reasonably general, yet algebraically manageable, models for representing correlated network traffic. The GIPP and GIBP have a surprisingly rich sets of parameters, yet these invariance properties enable us to easily incorporate the covariance function as well as the interarrival time distribution into the model to better matchobservations. In this pager, we show an application of GIPP and GIBP for matching an analytical model to observed or experimental data.
暂无评论