Matches in SemOpenAlex for { <https://semopenalex.org/work/W2170955173> ?p ?o ?g. }
Showing items 1 to 68 of
68
with 100 items per page.
- W2170955173 endingPage "172" @default.
- W2170955173 startingPage "164" @default.
- W2170955173 abstract "We consider scheduling packets with values in a capacity-bounded buffer in an online setting. In this model, there is a buffer with limited capacity B . At any time, the buffer cannot accommodate more than B packets. Packets arrive over time. Each packet has a non-negative value. Packets leave the buffer only because they are either sent or dropped. Those packets that have left the buffer will not be reconsidered for delivery any more. In each time step, at most one packet in the buffer can be sent. The order in which the packets are sent should comply with the order of their arrival time. The objective is to maximize the total value of the packets sent in an online manner. In this paper, we study a variant of this FIFO buffering model in which a packet’s value is either 1 or α > 1 . We present a deterministic memoryless 1.304-competitive algorithm. This algorithm has the same competitive ratio as the one presented in Lotker and Patt-Shamir [Z. Lotker, B. Patt-Shamir, Nearly optimal FIFO buffer management for DiffServ, in: Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, PODC, 2002, pp. 134–142; Z. Lotker, B. Patt-Shamir, Nearly optimal FIFO buffer management for DiffServ, Computer Networks 17 (1) (2003) 77–89]. However, our algorithm is simpler and does not employ any marking bits. The idea used in our algorithm is novel and different from all previous approaches that have been applied for the general model and its variants. We do not proactively preempt one packet when a new packet arrives. Instead, we may preempt more than one 1-value packet at the time when the buffer contains sufficiently many α -value packets." @default.
- W2170955173 created "2016-06-24" @default.
- W2170955173 creator A5005228021 @default.
- W2170955173 date "2013-07-01" @default.
- W2170955173 modified "2023-10-18" @default.
- W2170955173 title "A near-optimal memoryless online algorithm for FIFO buffering two packet classes" @default.
- W2170955173 cites W1552828154 @default.
- W2170955173 cites W1978849867 @default.
- W2170955173 cites W2010459659 @default.
- W2170955173 cites W2013760396 @default.
- W2170955173 cites W2037223718 @default.
- W2170955173 cites W2054524518 @default.
- W2170955173 cites W2095073910 @default.
- W2170955173 cites W2116240509 @default.
- W2170955173 cites W2120354662 @default.
- W2170955173 cites W3013142134 @default.
- W2170955173 doi "https://doi.org/10.1016/j.tcs.2011.11.039" @default.
- W2170955173 hasPublicationYear "2013" @default.
- W2170955173 type Work @default.
- W2170955173 sameAs 2170955173 @default.
- W2170955173 citedByCount "1" @default.
- W2170955173 countsByYear W21709551732018 @default.
- W2170955173 crossrefType "journal-article" @default.
- W2170955173 hasAuthorship W2170955173A5005228021 @default.
- W2170955173 hasBestOaLocation W21709551731 @default.
- W2170955173 hasConcept C11413529 @default.
- W2170955173 hasConcept C118615104 @default.
- W2170955173 hasConcept C158379750 @default.
- W2170955173 hasConcept C173608175 @default.
- W2170955173 hasConcept C196921405 @default.
- W2170955173 hasConcept C199360897 @default.
- W2170955173 hasConcept C2777145635 @default.
- W2170955173 hasConcept C31258907 @default.
- W2170955173 hasConcept C33923547 @default.
- W2170955173 hasConcept C41008148 @default.
- W2170955173 hasConcept C80444323 @default.
- W2170955173 hasConceptScore W2170955173C11413529 @default.
- W2170955173 hasConceptScore W2170955173C118615104 @default.
- W2170955173 hasConceptScore W2170955173C158379750 @default.
- W2170955173 hasConceptScore W2170955173C173608175 @default.
- W2170955173 hasConceptScore W2170955173C196921405 @default.
- W2170955173 hasConceptScore W2170955173C199360897 @default.
- W2170955173 hasConceptScore W2170955173C2777145635 @default.
- W2170955173 hasConceptScore W2170955173C31258907 @default.
- W2170955173 hasConceptScore W2170955173C33923547 @default.
- W2170955173 hasConceptScore W2170955173C41008148 @default.
- W2170955173 hasConceptScore W2170955173C80444323 @default.
- W2170955173 hasLocation W21709551731 @default.
- W2170955173 hasLocation W21709551732 @default.
- W2170955173 hasOpenAccess W2170955173 @default.
- W2170955173 hasPrimaryLocation W21709551731 @default.
- W2170955173 hasRelatedWork W1620184302 @default.
- W2170955173 hasRelatedWork W2088826026 @default.
- W2170955173 hasRelatedWork W2118334700 @default.
- W2170955173 hasRelatedWork W2132894080 @default.
- W2170955173 hasRelatedWork W2166772398 @default.
- W2170955173 hasRelatedWork W2170955173 @default.
- W2170955173 hasRelatedWork W2175379584 @default.
- W2170955173 hasRelatedWork W2283243641 @default.
- W2170955173 hasRelatedWork W2368072106 @default.
- W2170955173 hasRelatedWork W3164287526 @default.
- W2170955173 hasVolume "497" @default.
- W2170955173 isParatext "false" @default.
- W2170955173 isRetracted "false" @default.
- W2170955173 magId "2170955173" @default.
- W2170955173 workType "article" @default.