The provisioning of Quality of Service (QoS) is one of the most important challenges in the investigations over the networking science era. Scheduling algorithms which determine how packets select for servicing,highly affect on the performance of networks especially in providing QoS. However, the nature of Internet traffic, especially real-time multimedia applications, is bursty and one way to control the QoS isreduction of the burstiness of the arrival flows by traffic shapers. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions (flows). However, due to increasing delay in shapers, the server cannot provide an acceptable QoS to some bursty and delay-sensitive traffic flows such as real-time video (IPTV).Therefore, when the QoS of the bursty traffic should be provided, some other parameters should be involved. A main idea in this dissertationis that besides thearrival rate, sessions are isolated by the burstiness of the arrival traffic and the scheduling algorithmattempt to differentiate sessions according to service rate and burst service .Due to assess the performance of a scheduler under bursty traffic flows, a new scheduling framework including a new index for evaluating burst service is presented in this study. Then, this study introduces and evaluates a new fluid-flow scheduling algorithm (R) that not only uses arrival rates, but also considers burstiness of the arrival traffic flows. R enhances the Generalized Processor Sharing (GPS) algorithm which is the best algorithm in term of service fair index (SFI). In the followingof the study, a packet scheduling algorithm (BSCFQ) which attempts to provide a balance between bursty and non-bursty (smooth) traffic flowsis introduced. BSCFQ is an improvement of a well-known packet scheduling algorithm, which is called Self-Clock Fair Queueing (SCFQ). In the presented algorithm, BSCFQ,the capability of the SCFQ is increased to compensatea limited value of the missed or postponed service for each session. BSCFQ is also evaluated by calculating the fairness index; delay bound and the new criterion which has been defined in the framework. Improvementof the SCFQ does not necessitate any additional computation as regards the implement algorithm. The relation between the scheduling algorithms and bursty traffic has beenstudied in another viewpoint. The scheduling algorithms may increase the burstiness of the arrival traffic flows. Some study is proposed to smooth the output traffic flows in the scheduler. A review on the Round-Robin family scheduling algorithm has been done and a new scheduling algorithm (GDB_DRR) in this family is presented. In GDB_DRR, at firsta group of sessions is selected by a smooth scheduling algorithmcalled DB_WFQ then a session is chosen by DRR algorithm.The simulation results indicate that the reduction of burstiness in DB_WFQ is similar to one of the smooth output scheduling algorithm called SRR + . The advantage of GDB_DRR vs. SRR + is its lower complexity and its capability to support the scheduling of variable length packet. As a result in this study, the interaction between scheduling algorithm is considered. At first, the effect of bursty traffic on scheduling algorithm is evaluated. Then the effect of scheduling algorithm on burstiness of a flow is studied. According to this viewpoint, three new scheduling algorithms have been proposed. Keywords: Quality of Service, Scheduling Algorithm, Bursty Traffic, Network Calculus