IEEE/ACM Transactions on Networking (TON)
Bandwidth quantization and states reduction in the broadband ISDN
IEEE/ACM Transactions on Networking (TON)
MPLS: technology and applications
MPLS: technology and applications
SONET
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal Quantization of Periodic Task Requests on Multiple Identical Processors
IEEE Transactions on Parallel and Distributed Systems
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Journal of Computer and System Sciences
Notes on searching in multidimensional monotone arrays
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers
Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers
MPLS and traffic engineering in IP networks
IEEE Communications Magazine
Traffic grooming in WDM networks
IEEE Communications Magazine
The generic framing procedure (GFP): an overview
IEEE Communications Magazine
Generic framing procedure (GFP): the catalyst for efficient data over transport
IEEE Communications Magazine
New transport services for next-generation SONET/SDH systems
IEEE Communications Magazine
Hybrid transport solutions for TDM/data networking services
IEEE Communications Magazine
Grooming of arbitrary traffic in SONET/WDM BLSRs
IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
Optimal pricing and capacity partitioning for tiered access service in virtual networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplify a wide range of core network functions, allowing the providers to scale their operations efficiently. In this work, we study a number of problem variants related to service tier selection. Our contributions include: 1) a faster algorithm for obtaining optimal service tiers; 2) a new formulation and optimal algorithm to optimize jointly the number and magnitude of each service tier; and 3) the concept of "TDM emulation" in which all service tiers are multiples of the same (software-configurable) bandwidth unit, and a suite of algorithms to select jointly the basic unit and service tiers. Our work provides a systematic framework for reasoning about and tackling algorithmically the general problem of service tier selection, and has applications to a number of networking contexts, including access networks (e.g., determining the tiers for ADSL, cable modem networks or PONs) and core networks (e.g., LSP sizing for MPLS networks).