This paper proposes a method for scheduling and buffer management in differentiated services networks which is based on JoBS algorithm. JoBS differentiates traffic classes base on delay and loss rate. Furthermore, it supports both relative and absolute constraints. Nowadays with the expansion of Internet traffic and its diversified service requests, the focus is on requirement of new traffic us...

The Differentiated Services framework allows to provide scalable network Quality of Service by aggregate scheduling. Services, like a Premium class, can be defined to offer a bounded end-to-end delay. For such services, the methodology of Network Calculus has been applied successfully in Integrated Services networks to derive upper bounds on the delay of individual flows. Recent extensions allo...

We address the problem of delay-constrained streaming ofmultimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, according to their sending time. However, the streaming server usually cannot have a perfect knowledge of the channel bandwidth, and important pa...

Smart antenna (or multi-beam antenna) systems can support simultaneous transmissions (or receptions) of multiple packets in different beams using the same channel. However, network performance is highly dependent on transmission scheduling. This study develops two transmission-scheduling schemes for use with smart antenna systems to improve network throughput and reduce transmission delay. The ...

A novel algorithm, called JoBS (Joint Buffer Management and Scheduling), is presented for loss and delay differentiation of traffic classes in a packet network. JoBS has two unique capabilities: (1) JoBS makes scheduling and buffer management decisions in a single step, and (2) JoBS supports both relative and absolute QoS requirements of classes. The JoBS algorithm is presented in terms of the ...

This paper presents a complete closed-form timedomain analysis of the blocking probability of time-driven switching (TDS) for the single node case. In this work blocking is defined as the occurrence in which transmission resources are available in both inlet and outlet, but there is no schedule. The main constraints for finding a schedule are: (i) the load and (ii) the maximum scheduling delay ...

Duty cycling improves energy efficiency but also introduces significant end-to-end delivery delay in wireless sensor networks. Several schemes have been proposed to reduce the delay, but throughput is limited by the scheduling performance. TATD-MAC introduced in this paper improves the throughput by improving the channel utilization with a traffic-adaptive time slot scheduling method. The propo...

We study the problem of QoS guarantee for di erentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traÆc. We propose to employ an EDF scheduler co...

In this paper we present a dynamic bandwidth allocation algorithm for Ethernet Passive Optical Networks (EPON), which makes use of the Multipoint Control Protocol (MPCP) with threshold reporting and with interand intra-ONU priority scheduling. Three varieties of this algorithm are compared under both symmetric and asymmetric traffic conditions, by means of a detailed simulation program, regardi...