Matches in SemOpenAlex for { <https://semopenalex.org/work/W3025846675> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W3025846675 endingPage "406" @default.
- W3025846675 startingPage "395" @default.
- W3025846675 abstract "We consider the problem of designing an online scheduling scheme for a multi-hop wireless packet network with arbitrary topology and operating under arbitrary scheduling constraints. The objective is to design a scheme that achieves high throughput and low delay simultaneously. We propose a scheduling scheme that - for networks operating under primary interference constraints - guarantees a per-flow end-to-end packet delay bound of 5 d j /(1- ρ j ), at a factor 5 loss of throughput, where d j is the path length (number of hops) of flow j and ρ j is the effective loading along the route of flow j . Clearly, d j is a universal lower bound on end-to-end packet delay for flow j . Thus, our result is essentially optimal. To the best of our knowledge, our result is the first one to show that it is possible to achieve a per-flow end-to-end delay bound of O (# of hops) in a constrained network. Designing such a scheme comprises two related subproblems: Global Scheduling and Local Scheduling. Global Scheduling involves determining the set of links that will be simultaneously active, without violating the scheduling constraints. While local scheduling involves determining the packets that will be transferred across active edges. We design a local scheduling scheme by adapting the Preemptive Last-In-First-Out (PL) scheme, applied for quasi-reversible continuous time networks, to an unconstrained discrete-time network. A global scheduling scheme will be obtained by using stable marriage algorithms to emulate the unconstrained network with the constrained wireless network. Our scheme can be easily extended to a network operating under general scheduling constraints, such as secondary interference constraints, with the same delay bound and a loss of throughput that depends on scheduling constraints through an intriguing sub-graph covering property." @default.
- W3025846675 created "2020-05-21" @default.
- W3025846675 creator A5009308441 @default.
- W3025846675 creator A5039000172 @default.
- W3025846675 date "2008-06-02" @default.
- W3025846675 modified "2023-09-26" @default.
- W3025846675 title "Optimal delay scheduling in networks with arbitrary constraints" @default.
- W3025846675 cites W1997161730 @default.
- W3025846675 cites W2068115726 @default.
- W3025846675 cites W2079931475 @default.
- W3025846675 cites W2084427019 @default.
- W3025846675 cites W2099573773 @default.
- W3025846675 cites W2103348200 @default.
- W3025846675 cites W2105177639 @default.
- W3025846675 cites W4297972233 @default.
- W3025846675 doi "https://doi.org/10.1145/1384529.1375502" @default.
- W3025846675 hasPublicationYear "2008" @default.
- W3025846675 type Work @default.
- W3025846675 sameAs 3025846675 @default.
- W3025846675 citedByCount "0" @default.
- W3025846675 crossrefType "journal-article" @default.
- W3025846675 hasAuthorship W3025846675A5009308441 @default.
- W3025846675 hasAuthorship W3025846675A5039000172 @default.
- W3025846675 hasConcept C107568181 @default.
- W3025846675 hasConcept C108037233 @default.
- W3025846675 hasConcept C120314980 @default.
- W3025846675 hasConcept C126255220 @default.
- W3025846675 hasConcept C127456818 @default.
- W3025846675 hasConcept C134306372 @default.
- W3025846675 hasConcept C158379750 @default.
- W3025846675 hasConcept C175893541 @default.
- W3025846675 hasConcept C206729178 @default.
- W3025846675 hasConcept C31258907 @default.
- W3025846675 hasConcept C31689143 @default.
- W3025846675 hasConcept C33923547 @default.
- W3025846675 hasConcept C41008148 @default.
- W3025846675 hasConcept C5119721 @default.
- W3025846675 hasConcept C555944384 @default.
- W3025846675 hasConcept C76155785 @default.
- W3025846675 hasConcept C77553402 @default.
- W3025846675 hasConceptScore W3025846675C107568181 @default.
- W3025846675 hasConceptScore W3025846675C108037233 @default.
- W3025846675 hasConceptScore W3025846675C120314980 @default.
- W3025846675 hasConceptScore W3025846675C126255220 @default.
- W3025846675 hasConceptScore W3025846675C127456818 @default.
- W3025846675 hasConceptScore W3025846675C134306372 @default.
- W3025846675 hasConceptScore W3025846675C158379750 @default.
- W3025846675 hasConceptScore W3025846675C175893541 @default.
- W3025846675 hasConceptScore W3025846675C206729178 @default.
- W3025846675 hasConceptScore W3025846675C31258907 @default.
- W3025846675 hasConceptScore W3025846675C31689143 @default.
- W3025846675 hasConceptScore W3025846675C33923547 @default.
- W3025846675 hasConceptScore W3025846675C41008148 @default.
- W3025846675 hasConceptScore W3025846675C5119721 @default.
- W3025846675 hasConceptScore W3025846675C555944384 @default.
- W3025846675 hasConceptScore W3025846675C76155785 @default.
- W3025846675 hasConceptScore W3025846675C77553402 @default.
- W3025846675 hasIssue "1" @default.
- W3025846675 hasLocation W30258466751 @default.
- W3025846675 hasOpenAccess W3025846675 @default.
- W3025846675 hasPrimaryLocation W30258466751 @default.
- W3025846675 hasRelatedWork W1007906405 @default.
- W3025846675 hasRelatedWork W1605706132 @default.
- W3025846675 hasRelatedWork W1904356719 @default.
- W3025846675 hasRelatedWork W1976129816 @default.
- W3025846675 hasRelatedWork W2091654523 @default.
- W3025846675 hasRelatedWork W2091980923 @default.
- W3025846675 hasRelatedWork W2096052440 @default.
- W3025846675 hasRelatedWork W2142540075 @default.
- W3025846675 hasRelatedWork W2351390697 @default.
- W3025846675 hasRelatedWork W4231101290 @default.
- W3025846675 hasVolume "36" @default.
- W3025846675 isParatext "false" @default.
- W3025846675 isRetracted "false" @default.
- W3025846675 magId "3025846675" @default.
- W3025846675 workType "article" @default.