Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy

Full metadata record
DC Field Value Language
dc.contributor.authorBaek, Seung Jun-
dc.contributor.authorPark, Joon-Sang-
dc.date.accessioned2021-12-21T15:40:57Z-
dc.date.available2021-12-21T15:40:57Z-
dc.date.created2021-08-30-
dc.date.issued2017-
dc.identifier.issn1024-123X-
dc.identifier.urihttps://scholar.korea.ac.kr/handle/2021.sw.korea/132423-
dc.description.abstractWe 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-LCQis 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.-
dc.languageEnglish-
dc.language.isoen-
dc.publisherHINDAWI LTD-
dc.subjectCONGESTION CONTROL-
dc.subjectWIRELESS-
dc.subjectCOMMUNICATION-
dc.subjectALLOCATION-
dc.subjectTECHNOLOGIES-
dc.subjectTHROUGHPUT-
dc.subjectCHALLENGES-
dc.subjectSTABILITY-
dc.titleDelay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy-
dc.typeArticle-
dc.contributor.affiliatedAuthorBaek, Seung Jun-
dc.identifier.doi10.1155/2017/4362652-
dc.identifier.scopusid2-s2.0-85038972024-
dc.identifier.wosid000415806700001-
dc.identifier.bibliographicCitationMATHEMATICAL PROBLEMS IN ENGINEERING, v.2017-
dc.relation.isPartOfMATHEMATICAL PROBLEMS IN ENGINEERING-
dc.citation.titleMATHEMATICAL PROBLEMS IN ENGINEERING-
dc.citation.volume2017-
dc.type.rimsART-
dc.type.docTypeArticle-
dc.description.journalClass1-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaEngineering-
dc.relation.journalResearchAreaMathematics-
dc.relation.journalWebOfScienceCategoryEngineering, Multidisciplinary-
dc.relation.journalWebOfScienceCategoryMathematics, Interdisciplinary Applications-
dc.subject.keywordPlusCONGESTION CONTROL-
dc.subject.keywordPlusWIRELESS-
dc.subject.keywordPlusCOMMUNICATION-
dc.subject.keywordPlusALLOCATION-
dc.subject.keywordPlusTECHNOLOGIES-
dc.subject.keywordPlusTHROUGHPUT-
dc.subject.keywordPlusCHALLENGES-
dc.subject.keywordPlusSTABILITY-
Files in This Item
There are no files associated with this item.
Appears in
Collections
Graduate School > Department of Computer Science and Engineering > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Baek, Seung Jun photo

Baek, Seung Jun
컴퓨터학과
Read more

Altmetrics

Total Views & Downloads

BROWSE