Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy
المؤلفون المشاركون
Park, Joon-Sang
Baek, Seung Jun
المصدر
Mathematical Problems in Engineering
العدد
المجلد 2017، العدد 2017 (31 ديسمبر/كانون الأول 2017)، ص ص. 1-15، 15ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2017-11-21
دولة النشر
مصر
عدد الصفحات
15
التخصصات الرئيسية
الملخص EN
We consider a scheduling problem for a two-hop queueing network where the queues have randomly varying connectivity.
Customers arrive at the source queue and are later routed to multiple relay queues.
A relay queue can be served only if it is in connected state, and the state changes randomly over time.
The source queue and relay queues are served in a time-sharing manner; that is, only one customer can be served at any instant.
We propose Join the Shortest Queue-Longest Connected Queue (JSQ-LCQ) policy as follows: (1) if there exist nonempty relay queues in connected state, serve the longest queue among them; (2) if there are no relay queues to serve, route a customer from the source queue to the shortest relay queue.
For symmetric systems in which the connectivity has symmetric statistics across the relay queues, we show that JSQ-LCQ is strongly optimal, that is, minimizes the delay in the stochastic ordering sense.
We use stochastic coupling and show that the systems under coupling exist in two distinct phases, due to dynamic interactions among source and relay queues.
By careful construction of coupling in both phases, we establish the stochastic dominance in delay between JSQ-LCQ and any arbitrary policy.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Baek, Seung Jun& Park, Joon-Sang. 2017. Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy. Mathematical Problems in Engineering،Vol. 2017, no. 2017, pp.1-15.
https://search.emarefa.net/detail/BIM-1190410
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Baek, Seung Jun& Park, Joon-Sang. Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy. Mathematical Problems in Engineering No. 2017 (2017), pp.1-15.
https://search.emarefa.net/detail/BIM-1190410
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Baek, Seung Jun& Park, Joon-Sang. Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy. Mathematical Problems in Engineering. 2017. Vol. 2017, no. 2017, pp.1-15.
https://search.emarefa.net/detail/BIM-1190410
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-1190410
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر