메뉴 건너뛰기




Volumn 3, Issue , 2004, Pages 2034-2039

A weighted fair queuing scheduling algorithm with (m,k)-firm guarantee

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; INTERNET; PACKET SWITCHING; QUALITY OF SERVICE; ROUTERS;

EID: 20544441663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (16)
  • 2
    • 4444377390 scopus 로고    scopus 로고
    • Evolution of the internet QoS and support for soft real-time applications
    • A.E. Mohamed, "Evolution of the Internet QoS and Support for Soft Real-Time Applications", Proceedings of the IEEE , vol. 91, 2003, pp.1086-1104
    • (2003) Proceedings of the IEEE , vol.91 , pp. 1086-1104
    • Mohamed, A.E.1
  • 3
    • 0032663989 scopus 로고    scopus 로고
    • Overload management in real-time control applications using (m,k)-firm guarantee
    • JUNE
    • P. Ramanathan, "Overload Management in Real-Time Control Applications Using (m,k)-Firm guarantee", IEEE Transactions on Parallel and Distributed Systems, vol. 10, no.6, JUNE 1999,. pp. 549-559
    • (1999) IEEE Transactions on Parallel and Distributed Systems , vol.10 , Issue.6 , pp. 549-559
    • Ramanathan, P.1
  • 4
    • 84938157299 scopus 로고
    • A dynamic priority assignment technique for streams with (m,k)-firm deadlines
    • Dec
    • M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m,k)-Firm Deadlines," IEEE Transactions on Computers, vol. 44, no.12, Dec, 1995, pp.1443-1451
    • (1995) IEEE Transactions on Computers , vol.44 , Issue.12 , pp. 1443-1451
    • Hamdaoui, M.1    Ramanathan, P.2
  • 5
    • 0141632308 scopus 로고    scopus 로고
    • Sanjay Jha, Norwood, MA: Artech House
    • S. Jha and M. Hassan, Engineering Internet QoS, Sanjay Jha, Norwood, MA: Artech House, 2002, pp.20-30
    • (2002) Engineering Internet QoS , pp. 20-30
    • Jha, S.1    Hassan, M.2
  • 6
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control - The single nodecase
    • June
    • A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control - The single nodecase," ACM/IEEE Transaction on Networking, vol. 1, no.3, June 1993, pp.344-357
    • (1993) ACM/IEEE Transaction on Networking , vol.1 , Issue.3 , pp. 344-357
    • Parekh, A.1    Gallager, R.2
  • 8
    • 0029778714 scopus 로고    scopus 로고
    • Hardware-efficient fairqueueing architectures for high-speed networks
    • J. Rexford, A. Greenberg, and F. Bonomi, "Hardware-efficient fairqueueing architectures for high-speed networks," INFOCOM'96, vol. 2, 1996,pp.24-28.
    • (1996) INFOCOM'96 , vol.2 , pp. 24-28
    • Rexford, J.1    Greenberg, A.2    Bonomi, F.3
  • 9
    • 0031250147 scopus 로고    scopus 로고
    • Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks
    • Oct.
    • P. Goyal, H. Vin, and H. Cheng, "Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks," IEEE/ACM Transaction on Networking, vol. 5, no.5, Oct. 1997, pp. 690-704.
    • (1997) IEEE/ACM Transaction on Networking , vol.5 , Issue.5 , pp. 690-704
    • Goyal, P.1    Vin, H.2    Cheng, H.3
  • 10
    • 0036157851 scopus 로고    scopus 로고
    • Integrating priority with share in the priority- Based weighted fair queueing scheduler for real- Time networks
    • Jan-March
    • S Wang, Y Wang, K Lin, "Integrating Priority with Share in the priority- Based Weighted Fair Queueing Scheduler for Real- Time Networks, " Journal of RTS , vol. 22, no. 1-2, Jan-March, 2002, pp 119-149
    • (2002) Journal of RTS , vol.22 , Issue.1-2 , pp. 119-149
    • Wang, S.1    Wang, Y.2    Lin, K.3
  • 12
    • 0026000660 scopus 로고
    • A calculus for network delay, I. Network elements in isolation
    • Jan.
    • Cruz, R. L., "A calculus for network delay, I. Network elements in isolation" IEEE Transactions on IT, vol.37, no.1, Jan. 1991, pp. 114-131.
    • (1991) IEEE Transactions on IT , vol.37 , Issue.1 , pp. 114-131
    • Cruz, R.L.1
  • 14
    • 0031338915 scopus 로고    scopus 로고
    • DBP-M: A technique for meeting the end-to-end (m,k)-firm guarantee requirements in point-to-point networks
    • Nov
    • W. Lindsay and P. Ramanathan. "DBP-M: A technique for meeting the end-to-end (m,k)-firm guarantee requirements in point-to-point networks," Proceedings of Conference on Local Computer Networks, Nov, 1997, pp. 294-303.
    • (1997) Proceedings of Conference on Local Computer Networks , pp. 294-303
    • Lindsay, W.1    Ramanathan, P.2
  • 15
    • 0029487571 scopus 로고
    • Skip-over: Algorithms and complexity for overloaded systems that allow skips
    • G. Koren and D. Shasha. "Skip-over: Algorithms and complexity for overloaded systems that allow skips," Proceedings of Real-Time Systems Symposium, 1995, pp. 110-117.
    • (1995) Proceedings of Real-time Systems Symposium , pp. 110-117
    • Koren, G.1    Shasha, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.