Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks

The pervasiveness of the Internet and its applications lead to the potential increment of the users’ demands for more services with economical prices. The diversity of Internet traffic requires some classification and prioritisation since some traffic deserve much attention with less delay and loss...

Full description

Saved in:

Bibliographic Details
Main Author:	Miaji, Yaser Shamsulhak A
Format:	Thesis
Language:	eng eng
Published:	2011
Subjects:	TK5101-6720 Telecommunication
Online Access:	https://etd.uum.edu.my/2980/1/Yaser_Shamsulhak_A_Miaji.pdf https://etd.uum.edu.my/2980/2/1.Yaser_Shamsulhak_A_Miaji.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uum-etd.2980
record_format	uketd_dc
institution	Universiti Utara Malaysia
collection	UUM ETD
language	eng eng
advisor	Hassan, Suhaidi
topic	TK5101-6720 Telecommunication
spellingShingle	TK5101-6720 Telecommunication Miaji, Yaser Shamsulhak A Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks
description	The pervasiveness of the Internet and its applications lead to the potential increment of the users’ demands for more services with economical prices. The diversity of Internet traffic requires some classification and prioritisation since some traffic deserve much attention with less delay and loss compared to others. Current scheduling mechanisms are exposed to the trade-off between three major properties namely fairness, complexity and protection. Therefore, the question remains about how to improve the fairness and protection with less complex implementation. This research is designed to enhance scheduling mechanism by providing sustainability to the fairness and protection properties with simplicity in implementation; and hence higher service quality particularly for real-time applications. Extra elements are applied to the main fairness equation to improve the fairness property. This research adopts the restricted charge policy which imposes the protection of normal user. In terms of the complexity property, genetic algorithm has an advantage in holding the fitness score of the queue in separate storage space which potentially minimises the complexity of the algorithm. The integrity between conceptual, analytical and experimental approach verifies the efficiency of the proposed mechanism. The proposed mechanism is validated by using the emulation and the validation experiments involve real router flow data. The results of the evaluation showed fair bandwidth distribution similar to the popular Weighted Fair Queuing (WFQ) mechanism. Furthermore, better protection was exhibited in the results compared with the WFQ and two other scheduling mechanisms. The complexity of the proposed mechanism reached O(log(n)) which is considered as potentially low. Furthermore, this mechanism is limited to the wired networks and hence future works could improve the mechanism to be adopted in mobile ad-hoc networks or any other wireless networks. Moreover, more improvements could be applied to the proposed mechanism to enhance its deployment in the virtual circuits switching network such as the asynchronous transfer mode networks.
format	Thesis
qualification_name	Ph.D.
qualification_level	Doctorate
author	Miaji, Yaser Shamsulhak A
author_facet	Miaji, Yaser Shamsulhak A
author_sort	Miaji, Yaser Shamsulhak A
title	Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks
title_short	Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks
title_full	Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks
title_fullStr	Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks
title_full_unstemmed	Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks
title_sort	just queuing: policy-based scheduling mechanism for packet switching networks
granting_institution	Universiti Utara Malaysia
granting_department	Awang Had Salleh Graduate School of Arts & Sciences
publishDate	2011
url	https://etd.uum.edu.my/2980/1/Yaser_Shamsulhak_A_Miaji.pdf https://etd.uum.edu.my/2980/2/1.Yaser_Shamsulhak_A_Miaji.pdf
_version_	1747827476352991232
spelling	my-uum-etd.29802016-04-27T06:38:01Z Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks 2011 Miaji, Yaser Shamsulhak A Hassan, Suhaidi Awang Had Salleh Graduate School of Arts & Sciences Awang Had Salleh Graduate School of Sciences TK5101-6720 Telecommunication The pervasiveness of the Internet and its applications lead to the potential increment of the users’ demands for more services with economical prices. The diversity of Internet traffic requires some classification and prioritisation since some traffic deserve much attention with less delay and loss compared to others. Current scheduling mechanisms are exposed to the trade-off between three major properties namely fairness, complexity and protection. Therefore, the question remains about how to improve the fairness and protection with less complex implementation. This research is designed to enhance scheduling mechanism by providing sustainability to the fairness and protection properties with simplicity in implementation; and hence higher service quality particularly for real-time applications. Extra elements are applied to the main fairness equation to improve the fairness property. This research adopts the restricted charge policy which imposes the protection of normal user. In terms of the complexity property, genetic algorithm has an advantage in holding the fitness score of the queue in separate storage space which potentially minimises the complexity of the algorithm. The integrity between conceptual, analytical and experimental approach verifies the efficiency of the proposed mechanism. The proposed mechanism is validated by using the emulation and the validation experiments involve real router flow data. The results of the evaluation showed fair bandwidth distribution similar to the popular Weighted Fair Queuing (WFQ) mechanism. Furthermore, better protection was exhibited in the results compared with the WFQ and two other scheduling mechanisms. The complexity of the proposed mechanism reached O(log(n)) which is considered as potentially low. Furthermore, this mechanism is limited to the wired networks and hence future works could improve the mechanism to be adopted in mobile ad-hoc networks or any other wireless networks. Moreover, more improvements could be applied to the proposed mechanism to enhance its deployment in the virtual circuits switching network such as the asynchronous transfer mode networks. 2011 Thesis https://etd.uum.edu.my/2980/ https://etd.uum.edu.my/2980/1/Yaser_Shamsulhak_A_Miaji.pdf application/pdf eng validuser https://etd.uum.edu.my/2980/2/1.Yaser_Shamsulhak_A_Miaji.pdf application/pdf eng public Ph.D. doctoral Universiti Utara Malaysia [1] S. Zoric and M. Bolic, "Fairness of scheduling algorithms for real-time traffic in DiffServ based networks," in MELECON 2010 - 2010 15th IEEE Mediterranean Electrotechnical Conference, Malta., 2010, pp. 1591-1596. [2] H. J. Chao and B. Liu, High performance switches and routers: Wiley-Interscience, 2007. [3] T. Minagawa and T. Ikegami, "Double WFQ QoS scheduling based on flow number in diffserve network," in International Conference on Advanced Communication Technology (ICACT), , Gangwon-Do, South Korea, 2010, pp. 1365-1370. [4] E. Garcia-Palacios and S. Walsh, "Exploiting multiuser diversity using traffic knowledge: Next generation wireless schedulers," in Internation Symposium in Wireless Communication Systems (ISWCS), , York, UK, 2010, pp. 706-710. [5] J. Bates, C. Gallon, M. Bocci, S. Walker, and T. Taylor, Converged Multimedia Networks: John Wiley & Sons, 2006. [6] I. O. S. Cisco, Quality of Service Solutions Configuration Guide: Cisco Systems, Inc, 2008. [7] J. F. Kurose, Computer networking: a top-down approach featuring the Internet: Pearson education, 2005. [8] N. S. Walton, "Proportional fairness and its relationship with multi-class Queuing networks," The Annals of Applied Probability, vol. 19, pp. 2301-2333, 2009. [9] A. Riza, "Improving QoS in WLAN using dynamic weigted fair scheduling," in Faculty of Computer Science and Information Technology. vol. Degree of Master of Computer Science Kuala Lumpur: University of Malaya, 2008, p. 155. [10] M. Yasin, M. A. Wahla, and F. Kausar, "Analysis of Download Accelerator Plus (DAP) for Forensic Artefacts," in 2009 Fifth International Conference on IT Security Incident Management and IT Forensics, 2009, pp. 142-152. [11] H. Halabian and H. Saidi, "FPFQ: A Low Complexity Fair Queuing Algorithm for Broadband Networks," 2008, pp. 1-6. [12] C. Guo, "G-3: An O (1) time complexity packet scheduler that provides bounded end-to-end delay," 2007. [13] I. O. S. Cisco, Cisco WAN and Application Optimisation Solution Guide: Cisco Systems, Inc, 2008. [14] L. Kleinrock, "Time-shared Systems: a theoretical treatment," Journal of the ACM (JACM), vol. 14, pp. 242-261, 1967. [15] L. Kleinrock and A. Nilsson, "On Optimal Scheduling Algorithms for Time-Shared Systems," Journal of the ACM (JACM), vol. 28, pp. 477-486, 1981. [16] E. L. Hahne and R. G. Gallager, "Round Robin Scheduling for Fair Flow Control in Data Communication Networks," in Electrical Engineering and Computer Science. vol. Ph.D: Rice Universtiy, 1986, p. 244. [17] A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair Queuing algorithm," Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 1-12, 1989. 212 [18] L. Zhang, "Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks," ACM Transactions on Computer Systems, vol. 9, pp. 101-124, 1991. [19] J. Nagle, "Congestion Control in IP/TCP Internetworks," ACM SIGCOMM Computer Communication Review, 1984. [20] S. Floyd, "Link-sharing and resource management models for packet networks," IEEE/ACM Transactions on Networking (TON), vol. 3, pp. 365-386, 1995. [21] C. Soanes and S. Hawker, Compact Oxford English Dictionary of Current English: Oxford University Press, 2008. [22] F. Gebali, Analysis of computer and communication networks: Springer Verlag, 2008. [23] D. Lowe, Networking for dummies 8th edition: John Wiley & Sons 2007. [24] M. Marchese, QoS over heterogeneous networks: Wiley, Chichester, 2007. [25] J. Nagle, "RFC-896: Congestion Control in IP/TCP Internetworks," Request For Comments, 1984. [26] Z. Li, R. Yuan, and X. Guan, "Accurate classification of the internet traffic based on the SVM method," in ICC 2007, 2007, pp. 1373-1378. [27] D. Zagar and S. Rimac-Drlje, "Applications classification and QoS requirements," in Information Technology Interfaces IT1 2002, Cavtat, Croatia, 2002, pp. 517-522. [28] A. W. Moore, Zuev, D., "Internet traffic classification using bayesian analysis techniques," in SIGMETRICS’05, 2005, pp. 50-60. [29] S. Chimmanee and K. Wipusitwarakun, "Application Routing Load Balancing (ARLB) to Support QoS for VoIP Application over a VPNs Environment," in International Symposium on Network Computing and Applications (NCA’01) 2001, p. 94. [30] A. K. Jena, A. Popescu, and A. A. Nilsson, Modelling and Evaluation of Internet Applications: Karlskrona, 2002. [31] Y. Liu and W. Gong, "On fluid Queuing systems with strict priority," in IEEE Transactions on Automatic Control, 2003, pp. 2079-2088. [32] Q. He, "Analysing The Characteristics of VoIP Traffic," in Computer Science. vol. Master of science Saskatchewan, Canada: University of Saskatchewan, 2007, p. 95. [33] T. Soetens and O. Elloumi, "A relative bandwidth differentiated service for TCP micro-flows," in International Symposium on Cluster Computing and the Grid (CCGrid’01), Brisbane, Australia 2001, p. 602. [34] T. S. E. Ng, D. C. Stephens, I. Stoica, and H. Zhang, "Supporting best-effort traffic with fair service curve," in 1999 ACM SIGMETRICS international conference on Measurement and modelling of computer systems 1999, pp. 218-219. [35] D. Abendroth, M. E. Eckel, and U. Killat, "Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair Queuing schedulers," AEUE-International Journal of Electronics and Communications, vol. 60, pp. 404-407, 2006. [36] J. Nagle, "RFC 970: On packet switches with infinite storage," Request For Comments, 1985. [37] K. Downs, S. Spanier, M. Ford, T. Stevenson, and H. K. Lew, Internetworking technologies handbook: Cisco Press, 1998. 213 [38] A. K. Parekh and R. G. Gallager, "A generalised processor sharing approach to flow control in integrated services networks: the single-node case," IEEE/ACM Transactions on Networking (TON), vol. 1, pp. 344-357, 1993. [39] F. Cottet, J. Delacroix, Z. Mammeri, and C. Kaiser, Scheduling in real-time systems: Wiley, 2002. [40] A. Konstantinou, "Flow Control Techniques for Real-Time Media Applications in Best-Effort Networks Using Fluid Models." vol. MASTER OF SCIENCE: Texas A&M University, 2004, p. 187. [41] D. Ferrari, "Client Requirements for Real-Time Communication Services;RFC-1193," Internet Request for Comments, 1990. [42] B. Briscoe, "Internet: Fairer is faster," Networks Research Centre 2008. [43] Y. Liu, W. Gong, and P. Shenoy, "On the impact of concurrent downloads," in 33nd conference on Winter simulation 2001, p. 1305. [44] J. Eriksson, M. Faloutsos, and S. Krishnamurthy, "Justice: Flexible and Enforceable Per-Source Bandwidth Allocation," Lecture Notes in Computer Science, vol. 3462, pp. 1206-1218, 2005. [45] J. Nagle, "On Packet Switches with Infinite Storage," Communications, IEEE Transactions on [legacy, pre-1988], vol. 35, pp. 435-438, 1987. [46] Z. Li, "Improving perceived speech quality for wireless VoIP by cross-layer designs," in School of Computing, Communication and Electronics. vol. Master of Research in Network System Engineering: University of Plymouth, 2003, p. 75. [47] H. Zhang, "Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks," Proceedings-IEEE, vol. 83, pp. 1374-1374, 1995. [48] D. Ferrari and D. C. Verma, "A scheme for real-time channel establishment in wide-area networks," Selected Areas in Communications, IEEE Journal on, vol. 8, pp. 368-379, 1990. [49] D. C. Verma, H. Zhang, and D. Ferrari, "Delay jitter control for real-time communication in a packetswitching network," 1991, pp. 35-43. [50] H. M. Chaskar and U. Madhow, "Fair scheduling with tunable latency: a round-robin approach," IEEE/ACM Transactions on Networking vol. 11, pp. 592-601, 2003. [51] C. Wang, K. Long, X. Gong, and S. Cheng, "SWFQ: a simple weighted fair Queuing scheduling algorithm forhigh-speed packet switched network," Communications, vol. 8, 2001. [52] S. J. Golestani and M. Bellcore, "A self-clocked fair Queuing scheme for broadband applications," in INFOCOM’94. Networking for Global Communications, 1994, pp. 636-646. [53] I. Stoica, S. Shenker, and H. Zhang, "Core-stateless fair Queuing: achieving approximately fair bandwidth allocations in high speed networks," ACM SIGCOMM Computer Communication Review, pp. 118-130, 1998. [54] K. Yamakoshi, K. Nakai, E. Oki, and N. Yamanaka, "Dynamic deficit round-robin scheduling scheme for variable-lengthpackets," Electronics Letters, vol. 38, pp. 148-149, 2002. [55] S. S. Kanhere, H. Sethu, and A. B. Parekh, "Fair and efficient packet scheduling using elastic round robin," IEEE Transactions on Parallel and Distributed Systems, vol. 13, pp. 324-336, 2002. [56] A. Banchs, "User fair queuing: fair allocation of bandwidth for users," 2002, pp. 1668-1677. 214 [57] G. Chandrasekaran, "Performance Evaluation of Scheduling Mechanisms for Broadband Networks," in Departament fo Electrical Engineering and Computer. vol. Master: University of Kansa, 2001, p. 123. [58] "Understanding and Configuring MDRR and WRED on the Cisco 12000 Series Internet Routers," Cisco Systems, 2007. [59] J. C. R. Bennett and H. Zhang, "Why WFQ Is Not Good Enough for Integrated Services Networks," in NOSSDAV, 1996, p. 524—532. [60] M. E. Markaki, M. P. Saltouros, and I. S. Venieris, "Proportional packet loss differentiation and buffer management for differentiated services in the Internet," in 25th Annual IEEE Conference on Local Computer Networks 2000, pp. 306–313. [61] D. C. Stephens and J. Zhang, "Implementing scheduling algorithms in high-speed networks," Selected Areas in Communications, IEEE Journal on, vol. 17, pp. 1145-1158, 1999. [62] H. Shi, "Packet scheduling strategies for emerging service models in the internet." vol. PhD: Drexel University, 2003, p. 152. [63] H. Shi and H. Sethu, "An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness," in Workshop on End-to-end Service Differentiation, 2003, pp. 443-450. [64] D. D. Clark, S. Shenker, and L. Zhang, "Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism," ACM SIGCOMM Computer Communication Review, vol. 22, pp. 14-26, 1992. [65] J. Xiaohui, L. Jiandong, and G. Feng, "Two simple implementation algorithms of WFQ and their performanceanalysis," in ICII 2001, 2001. [66] R. Braden, D. Clark, and S. Shenker, "RFC1633: Integrated Services in the Internet Architecture: an Overview," RFC Editor, United States, 1994. [67] A. G. Greenberg and N. Madras, "How fair is fair queuing," Journal of the ACM (JACM), vol. 39, pp. 568-598, 1992. [68] J. C. R. Bennett, H. Zhang, and F. Syst, "WF 2 Q: worst-case fair weighted fair Queuing," in IEEE INFOCOM, 1996. [69] J. F. Lee, M. C. Chen, and Y. Sun, "WF2Q-M: Worst-case fair weighted fair Queuing with maximum rate control," Computer Networks, vol. 51, pp. 1403-1420, 2007. [70] J. C. R. Bennett and H. Zhang, "Hierarchical packet fair Queuing algorithms," Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 143-156, 1996. [71] C. Knightly, "Coordinated network scheduling: A framework for end-to-end services," IEEE/ACM Transactions on Networking (TON), vol. 10, pp. 776 - 789 2000. [72] H. Shi and H. Sethu, "Greedy fair Queuing: A goal-oriented strategy for fair real-time packet scheduling," in 24th IEEE Real-Time Systems Symposium, 2003, pp. 345-356. [73] L. Ashkenazi, "Controlling Burstiness in Fair Queuing Scheduling," in Faculty of Exct Sciences. vol. master Tel-Aviv: Tel-Avi university, 2004, p. 48. [74] S. Ju and M. Najar, "A novel hierarchical packet fair scheduling model," in ICCT 2003, 2003. [75] N. Alborz and L. Trajkovic, "Implementation of VirtualClock scheduling algorithm in OPNET," Proceedings of OPNETWORK 2001, 2001. 215 [76] G. G. Xie and S. S. Lam, "Delay guarantee of virtual clock server," IEEE/ACM Transactions on Networking (TON), vol. 3, p. 689, 1995. [77] S. Suri, G. Varghese, and G. Chandranmenon, "Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness," In Proceedings of INFOCOM&# 039; 97, 1997. [78] S. J. Golestani, "A stop-and-go Queuing framework for congestion management," ACM SIGCOMM Computer Communication Review, vol. 20, pp. 8-18, 1990. [79] S. J. Golestani, B. C. Res, and N. J. Morristown, "Congestion-free transmission of real-time traffic in packetnetworks," in IEEE INFOCOM’90, 1990, pp. 527-536. [80] M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, "Weighted round-robin cell multiplexing in a general-purpose ATMswitch chip," IEEE Journal on Selected Areas in Communications, vol. 9, pp. 1265-1279, 1991. [81] M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round-robin," IEEE/ACM Transactions on networking, vol. 4, pp. 375-385, 1996. [82] P. Southerington, "The Smoothed Round-Robin Scheduler," 2005. [83] G. Chuanxiong, "SRR: An O (1) time complexity packet scheduler for flows in multi-service packet networks," in 2001 conference on Applications, technologies, architectures, and protocols for computer communications 2001, pp. 211-222. [84] W. D. Qi, M. Dong, Q. G. Shen, and H. Chen, "How smooth is smoothed round robin," Proceedings of ZCCl2003, pp. 421-428, 2003. [85] S. Ramabhadran and J. Pasquale, "Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay," in 2003 conference on Applications, technologies, architectures, and protocols for computer communications 2003, pp. 239-250. [86] S. Jiwasurat, G. Kesidis, and D. J. Miller, "Hierarchical shaped deficit round-robin scheduling," in IEEE Global Telecommunications Conference, 2005. [87] J. R. Davin and A. T. Heybey, "A simulation study of fair Queuing and policy enforcement," IEEE/ACM Transactions on Networking (TON), vol. 20, pp. 23 - 29, 1990. [88] P. Goyal, H. M. Vin, and H. Chen, "Start-time fair Queuing: a scheduling algorithm for integrated services packet switching networks," Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 157-168, 1996. [89] D. Stiliadis and A. Varma, "Latency-rate servers: a general model for analysis of traffic scheduling algorithms," IEEE/ACM Transactions on Networking (ToN), vol. 6, pp. 611-624, 1998. [90] D. Stiliadis and A. Varma, "Efficient fair Queuing algorithms for packet-switched networks," IEEE/ACM Transactions on Networking (TON), vol. 6, pp. 175-185, 1998. [91] D. Stiliadis and A. Varma, "Design and analysis of frame-based fair Queuing: a new traffic scheduling algorithm for packet-switched networks," ACM SIGMETRICS Performance Evaluation Review, vol. 24, pp. 104-115, 1996. [92] N. Ciulli and S. Giordano, "Analysis and simulation of WF2Q+ based schedulers: comparisons, compliance with theoretical bounds and influence on end-to-end delay jitter," Computer Networks, vol. 37, pp. 579-599, 2001. 216 [93] D. Y. Kwak, N. S. Ko, B. Kim, and H. S. Park, "ANew Starting Potential Fair Queuing Algorithm with O (1) Virtual Time Computation Complexity," ETRI journal, vol. 25, 2003. [94] D. Y. Kwak, N. S. Ko, and H. S. Park, "Mean starting potential fair queuing for high-speed packet networks," in IEEE Global Telecommunications Conference, 2003. [95] C. Couch, Urban renewal: theory and practice: Macmillan Education, 1990. [96] H. C. Tijms and J. Wiley, A first course in stochastic models: Wiley Online Library, 2003. [97] R. B. Cooper, Introduction to Queuing theory: North-Holland, 1981. [98] L. Kleinrock, Queuing systems, volume 1: theory: John Wiley & Sons, 1975. [99] H. G. Blocker and E. H. Smith, John Rawls’ theory of social justice: an introduction: Ohio Univ Pr, 1980. [100] J. Rawls, A theory of justice: Oxford University Press, 1999. [101] S. Kubler, E. Rondeau, and J. P. Georges, "Dependability of switched network architectures for Networked Control Systems," in Mechatronics (ICM), 2011 IEEE International Conference on, pp. 761-766. [102] K. Nara, A. Shiose, M. Kitagawa, and T. Ishihara, "Implementation of genetic algorithm for distribution systems loss minimum re-configuration," Power Systems, IEEE Transactions on, vol. 7, pp. 1044-1051, 1992. [103] R. S. Rao, S. V. L. Narasimham, and M. Ramalingaraju, "Optimisation of distribution network configuration for loss reduction using artificial bee colony algorithm," International Journal of Electrical Power and Energy Systems Engineering, vol. 1, pp. 116-122, 2008. [104] A. M. Alberti, "Modelling and simulation of a LFVC scheduler," in Simulation Symposium, 2005. Proceedings. 38th Annual, 2005, pp. 277-284. [105] M. Hosaagrahara, "A generalised framework for achieving max-min fairness: theory and applications." vol. PhD: Drexel University, 2006, p. 134. [106] Z. Cao and E. W. Zegura, "Utility max-min: an application-oriented bandwidth allocationscheme," 1999. [107] R. Denda, A. Banchs, and W. Effelsberg, "The fairness challenge in computer networks," 2000, pp. 208-220. [108] L. Kleinrock and R. R. Muntz, "Processor Sharing Queuing Models of Mixed Scheduling Disciplines for Time Shared System," J. ACM, vol. 19, pp. 464-482, 1972. [109] L. Kleinrock, Queuing Systems: Volume 2: Computer Applications: John Wiley & Sons New York, 1976. [110] J. Jaffe, "Bottleneck flow control," Communications, IEEE Transactions on [legacy, pre-1988], vol. 29, pp. 954-962, 1981. [111] D. P. Bertsekas, R. Gallager, and T. Nemetz, Data networks: Prentice-hall Englewood Cliffs, NJ, 1987. [112] F. P. Kelly, "Charging and rate control for elastic traffic," European transactions on Telecommunications, vol. 8, pp. 33-38, 1997. [113] F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate control for communication networks: shadow prices, proportional fairness and stability," Journal of the Operational Research society, vol. 49, pp. 237-252, 1998. [114] L. Massoulie and J. Roberts, "Bandwidth sharing: objectives and algorithms," 1999. [115] T. Bonald and A. Proutiere, "Insensitive bandwidth sharing in data networks," Queuing systems, vol. 44, pp. 69-100, 2003. 217 [116] A. K. Erlang, "Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges," The Post Office Electrical Engineers’ Journal, vol. 10, pp. 189–197, 1918. [117] T. Bonald, L. Massoulié, A. Proutiere, and J. Virtamo, "A Queuing analysis of max-min fairness, proportional fairness and balanced fairness," Queuing systems, vol. 53, pp. 65-84, 2006. [118] S. Shenker, "Fundamental design issues for the future Internet," Selected Areas in Communications, IEEE Journal on, vol. 13, pp. 1176-1188, 1995. [119] U. Feige, "On allocations that maximise fairness," 2008, pp. 287-293. [120] D. Nace and M. Pioro, "Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial," IEEE Communications Surveys & Tutorials, vol. 10, pp. 5-17, 2008. [121] V. Pareto, "The new theories of economics," The Journal of Political Economy, pp. 485-502, 1897. [122] V. Pareto, R. Marchionatti, and F. Mornati, Considerations on the fundamental principles of pure political economy: Routledge, 2007. [123] E. Karipidis, N. D. Sidiropoulos, and Z. Q. Luo, "Quality of service and max-min fair transmit beamforming to multiple cochannel multicast groups," IEEE Transactions on Signal Processing, vol. 56, pp. 1268-1279, 2008. [124] D. Chakrabarty, J. Chuzhoy, and S. Khanna, "On allocating goods to maximise fairness," 2009, pp. 107-116. [125] A. Sridharan and B. Krishnamachari, "Maximising network utilisation with max–min fairness in wireless sensor networks," Wireless Networks, vol. 15, pp. 585-600, 2009. [126] T. Bonald, A. Proutiere, J. Roberts, and J. Virtamo, "Computational aspects of balanced fairness," 2003, pp. 801–810. [127] S. Bhatti and M. Bateman, "Transport Protocol Throughput Fairness," Journal of Networks, vol. 4, pp. 881-894, 2009. [128] B. H. Thacker, S. W. Doebling, F. M. Hemez, M. C. Anderson, J. E. Pepin, and E. A. Rodriguez, "Concepts of model verification and validation," Los Alamos National Lab., Los Alamos, NM (US) 2004. [129] B. Schilling, "Qualitative comparison of network simulation tools," Institute of Parallel and Distributed Systems (IPVS), University of Stuttgart, 2005. [130] D. Nicol, "Comparison of network simulators revisited," 2002. [131] T. Issariyakul and E. Hossain, Introduction to Network Simulator NS2: Springer Verlag, 2008. [132] G. F. Lucio, M. Paredes-Farrera, E. Jammeh, M. Fleury, and M. J. Reed, "Opnet modeller and ns-2: Comparing the accuracy of network simulators for packet-level analysis using a network testbed," WSEAS Transactions on Computers, vol. 2, pp. 700-707, 2003. [133] X. Chang, "Network simulations with OPNET," 1999, pp. 307-314 vol. 1. [134] I. Katzela, Modelling and simulating communication networks: a hands-on approach using OPNET: Prentice Hall PTR Upper Saddle River, NJ, USA, 1998. [135] J. H. Holland, "Adaptation in natural and artificial systems," Ann Arbor MI: University of Michigan Press, 1975. [136] C. R. Reeves and J. E. Rowe, Genetic algorithms: principles and perspectives: a guide to GA theory: Kluwer Academic Pub, 2002. [137] M. Gen and R. Cheng, Genetic algorithms and engineering optimisation: Wiley-interscience, 2000. 218 [138] M. Mitchell, An introduction to genetic algorithms: The MIT press, 1998. [139] C. Darwin, "On the origin of species by means of natural selection, or the preservation of favoured races in the struggle for life," New York: D. Appleton, 1859. [140] S. N. Sivanandam and S. N. Deepa, Introduction to genetic algorithms: Springer Verlag, 2007. [141] F. Jay and J. A. Goetz, "IEEE standard dictionary of electrical and electronics terms," 1977. [142] J. Radatz, "IEEE standard glossary of software engineering terminology," IEEE Std 610121990, vol. 121990, 1990. [143] S. Schlesinger, R. E. Crosbie, R. E. Gagne, G. S. Innis, C. S. Lalwani, J. Loch, R. J. Sylvester, R. D. Wright, N. Kheir, and D. Bartos, "Terminology for model credibility," Simulation, vol. 32, pp. 103-104, 1979. [144] D. Brade, A. Lehmann, and R. K. Huber, "Ageneralised Process for the Verification and Validation of Models and Simulation Results," 2007. [145] F. Stern, R. V. Wilson, H. W. Coleman, E. G. Paterson, and C. Iowa Inst Of Hydraulic Research Iowa, Verification and validation of CFD simulations: Citeseer, 1999. [146] K. Norlund, T. Ottosson, and A. Brunstrom, "Fairness measures for best effort traffic in wireless networks," 2004, pp. 2953-2957 Vol. 4. [147] D. Raz, H. Levy, and B. Avi-Itzhak, "A resource-allocation Queuing fairness measure," 2004, pp. 130-141. [148] P. Goyal and B. Tech, "Packet scheduling algorithms for integrated services networks." vol. PhD Austin: The University of Texas, 1997, p. 221. [149] J. A. Cobb, M. G. Gouda, and A. El-Nahas, "Time-shift scheduling-fair scheduling of flows in high-speed networks," Networking, IEEE/ACM Transactions on, vol. 6, pp. 274-285, 1998. [150] R. Patel and M. M. Raghuwanshi, "Review on Real Coded Genetic Algorithms Used in Multiobjective Optimisation," in Third International Conference on Emerging Trends in Engineering and Technology, 2010, pp. 610-613. [151] B. G. Lee and S. Choi, Broadband wireless access and local networks: mobile WiMax and WiFi: Artech House Publishers, 2008.

Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks

Similar Items