TDM Emulation in Packet-Switched Networks

Abstract

Abstract-Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). In this work, we study the problem of designing a tiered-service network that allocates bandwidth in multiples of a basic bandwidth unit. Such a packet-switched network can enjoy many of the benefits, in terms of control and management, of a TDM network, but without the associated data plane rigidities.

On Optimal Sizing of Tiered Network Services

“…We now present a solution approach for the STO-P problem with the objective function (6) that is based on dynamic programming; the STO-P problem with the alternative objective function (8) can be solved in a similar manner. As in the previous subsection, we define Φ(n, k) as the maximum value of the aggregate service provider surplus in (6) when the number of users is n and the number of service tiers is k ≤ n. We can obtain Φ(n, k) using the following recursion:…”

“…where D j is the set of demands mapped to service tier s j . This problem is identical to the STO-P problem, except that in the objective function (12) U (x) is used whenever P (x) is used in (6). Hence, STO-S can be solved in time O(N 2 ) with the dynamic programming algorithm in (9)-(11).…”

On Optimal Sizing of Tiered Network Services

“…This problem is identical to the STO-P problem, except that in the objective function (12) U (x) is used whenever P (x) is used in (6). Hence, STO-S can be solved in time O(N 2 ) with the dynamic programming algorithm in (9)-(11).…”

“…In [5] we developed a systematic framework for tiered-service networks by adopting the network operator's perspective. We have also demonstrated the benefits of tiered service for traffic engineering [6] and packet scheduling for QoS [7].…”