IEEE abc-01/22r1
|
|
- Dulcie Taylor
- 5 years ago
- Views:
Transcription
1 Project IEEE Broadband Wireless Access Working Group < > Title An ARQ proposal for consideration by TG3/4 MAC group Date Submitted Source(s) Yigal Leiba Itzik Kitroser Runcom Technologies LTD. 2 Ahoma St , Rishon Lezion Israel Voice: Fax: yigall@runcom.co.il itzikk@runcom.co.il Re: Call for comments, document IEEE ab-01/06r1 Abstract This ARQ proposal attempts to incorporate elements from IEEE802.16abc- 01/01 and discussions, comments and contributions that took place within the ARQ Ad-Hoc group. The document attempts to cover the majority of issues related to ARQ incorporation in the MAC. Purp ose For consideration and improvement by the TG3/4 ARQ Ad Hoc Group. Notice Release Patent Policy and Procedures T h i s d o c u m e n t h a s b e e n p r e p a r e d t o a s s i s t I E E E I t i s o f f e r e d a s a b a s i s f o r d i s c u s s i o n a n d i s n o t b i n d i n g o n t h e c o n t r i b u t i n g i n d i v i d u a l ( s ) o r o r g a n i z a t i o n ( s ). T h e m a t e r i a l i n t h i s d o c u m e n t i s s u b j e c t t o c h a n g e i n f o r m a n d c o n t e n t a f t e r f u r t h e r s t u d y. T h e c o n t r i b u t o r ( s ) r e s e r v e ( s ) t h e r i g h t t o a d d, a m e n d o r w i t h d r a w m a t e r i a l c o n t a i n e d h e r e i n. T h e c o n t r i b u t o r g r a n t s a f r e e, i r r e v o c a b l e l i c e n s e t o t h e I E E E t o i n c o r p o r a t e m a t e r i a l c o n t a i n e d i n t h i s c o n t r i b u t i o n, a n d a n y m o d i f i c a t i o n s t h e r e o f, i n t h e c r e a t i o n o f a n I E E E S t a n d a r d s p u b l i c a t i o n ; t o c o p y r i g h t i n t h e I E E E s n a m e a n y I E E E S t a n d a r d s p u b l i c a t i o n e v e n t h o u g h i t m a y i n c l u d e p o r t i o n s o f t h i s c o n t r i b u t i o n ; a n d a t t h e I E E E s s o l e d i s c r e t i o n t o p e r m i t o t h e r s t o r e p r o d u c e i n w h o l e o r i n p a r t t h e r e s u l t i n g I E E E S t a n d a r d s p u b l i c a t i o n. T h e c o n t r i b u t o r a l s o a c k n o w l e d g e s a n d a c c e p t s t h a t t h i s c o n t r i b u t i o n m a y b e m a d e p u b l i c b y I E E E T h e c o n t r i b u t o r i s f a m i l i a r w i t h t h e I E E E P a t e n t P o l i c y a n d P r o c e d u r e s ( V e r s i o n 1. 0 ) < h t t p : / / i e e e o r g / 1 6 / i p r / p a t e n t s / p o l i c y. h t m l >, i n c l u d i n g t h e s t a t e m e n t I E E E s t a n d a r d s m a y i n c l u d e t h e k n o w n u s e o f p a t e n t ( s ), i n c l u d i n g p a t e n t a p p l i c a t i o n s, i f t h e r e i s t e c h n i c a l j u s t i f i c a t i o n i n t h e o p i n i o n o f t h e s t a n d a r d s - d e v e l o p i n g c o m m i t t e e a n d p r o v i d e d t h e I E E E r e c e i v e s a s s u r a n c e f r o m t h e p a t e n t h o l d e r t h a t i t w i l l l i c e n s e a p p l i c a n t s u n d e r r e a s o n a b l e t e r m s a n d c o n d i t i o n s f o r t h e p u r p o s e o f i m p l e m e n t i n g t h e s t a n d a r d. E a r l y d i s c l o s u r e t o t h e W o r k i n g G r o u p o f p a t e n t i n f o r m a t i o n t h a t m i g h t b e r e l e v a n t t o t h e s t a n d a r d i s e s s e n t i a l t o r e d u c e t h e p o s s i b i l i t y f o r d e l a y s i n t h e d e v e l o p m e n t p r o c e s s a n d i n c r e a s e t h e l i k e l i h o o d t h a t t h e d r a f t p u b l i c a t i o n w i l l b e a p p r o v e d f o r p u b l i c a t i o n. P l e a s e n o t i f y t h e C h a i r < m a i l t o : r. b. m a r k i e e e. o r g > a s e a r l y a s p o s s i b l e, i n w r i t t e n o r e l e c t r o n i c f o r m, o f a n y p a t e n t s ( g r a n t e d o r u n d e r a p p l i c a t i o n ) t h a t m a y c o v e r t e c h n o l o g y t h a t i s u n d e r c o n s i d e r a t i o n b y o r h a s b e e n a p p r o v e d b y I E E E T h e C h a i r w i l l d i s c l o s e t h i s n o t i f i c a t i o n v i a t h e I E E E w e b s i t e < h t t p : / / i ee e o r g / 1 6 / i p r / p a t e n t s / n o t i c e s >. 0
2 An ARQ proposal for consideration by TG3/4 ARQ Ad-Hoc group Yigal Leiba Itzik Kitroser Runcom Technologies LTD. 1 General The ARQ mechanism is part of the MAC layer. Its implementation is mandatory, yet it s use is optional, on a per-connection basis. The requirement to use ARQ should be specified upon connection creation, but the decision on which connections ARQ should be used is outside the scope of the air interface specification. When a connection is designated to support ARQ, transmission of non -ARQ traffic on the connection is not allowed. The scope of a specific instance of the ARQ state machines, parameters and messages is limited to one unidirectional unicast MAC connection between the BST and an SS. The feedback information required for the ARQ algorithm is sent as a MAC management message on the appropriate basic management connection between that SS and the BST (i.e. it cannot be fragmented), or as piggybacked information on some existing connection. 2 Block numbering concept An ARQ block is a uniquely identifiable entity on which the ARQ algorithm operates. Each ARQ block is identified by an ARQ block number, which is assigned to it by the MAC. ARQ block numbers are assigned in increasing order, modulo ARQ_MAX_ IDX. When the MAC decides to transmit a certain MSDU for the first time, it assigns it block numbers starting from the current block index, and according to the ARQ_BLOCK_SIZE parameter, that will determine how many ARQ blocks are contained in the MSDU. No te that the ARQ numbering is merely a numbering scheme that identifies both the MSDU transmission order, and the order of the ARQ blocks comprising each MSDU. Note the ARQ block numbering implies nothing on the order and size of MPDU transmission. 3 Packing and fragmentation interoperation with ARQ 3.1 Motivation As the packing and fragmentation mechanism purpose is to allow the MAC to efficiently use arbitrary bandwidth assignments. The BW assignment for any connections while not completely arbitrary is limi ted by the granularity imposed by the PHY, namely relatively large FEC block granularity. The current packing and fragmentation mechanism operates on a byte boundary, i.e. it can fully use any BW assignment to the last byte. The ARQ scheme described here is specifically designed for minimal interference with the existing packing and fragmentation mechanism, and preserves its granularity. The proposed ARQ scheme does pose a restriction that an MSDU fragment should not be smaller than the size of an ARQ block. 3.2 Connection fragmentation state The current MAC creates an MPDU from a single MSDU, a fragment of an MSDU, or packing of several MSDUs or fragments of MSDUs. Currently, the range of states introduced by the fragmentation and packing mechanisms is limited by the fact that the connection on which the MSDU is transported is only allowed to be in one fragmentation state at any given instance. When ARQ, whose operation is based on retransmission of erred data, is introduced into the current MAC, the concept of a connection being in a single fragmentation state no longer holds. Instead, once a MSDU is fragmented, it remains fragmented until all 1
3 its pieces (i.e. ARQ blocks) have arrived at the receiver. The ARQ blocks should carry enough information in them so the receiver can place them correctly without the assumption of a single fragmentation state. 3.3 Block numbering operation To demonstrate how the block numbering works we might look at the allowed formats of MPDUs, and how ARQ block numbering woul d work in each. ARQ block numbering is done in the MSDU level, and ARQ blocks may be split between different MPDUs. As the ARQ algorithm in the receiver has enough information in each ARQ block to place it correctly regardless of the fragmentation, the split will at most cause the yet untransmitted portion of a block to be transmitted in vain. If this situation is to be avoided, the MAC may choose to always fragment on an ARQ block boundary. I order to support this choice of fragmentation, a parameter called SEND_FULL_BLOCKS is defined, that instructs the MAC to always fragment on an ARQ block boundary. Refer to section 7.1 for the format of the ARQ sub -headers. MSDU # MSDU # MSDU # Option I: Single MSDU in the MPDU MPDU # MPDU # MPDU # MSDU#2 MSDU#3 Option II: MSDU and MSDU fragments in the MPDU MPDU # MPDU #2 MPDU #3 MPDU #4 MPDU # MSDU#2 FRG#0 MSDU#2 FRG#1 Option III: MSDU and MSDU fragments packed in the MPDU MSDU#3 FRG#0 MSDU#3 FRG#1 MPDU # FRG#0 FRG#1 MPDU # MSDU#2 MPDU # MSDU#3 FRG#0 MSDU#3 FRG#1 Figure 1: Pa cking Fragmentation and ARQ block numbering 4 ARQ state machine The ARQ scheme is one of type selective repeat, and it uses an independent state machine on each ARQenabled connection. The ARQ scheme utilizes the existing MPDU CRC-32 checksum for detecting erred MPDUs. The proposed ARQ scheme is specifically designed to be simple and include minimal explicit messaging between transmitter and receiver. 4.1 Transmitter state machine At the transmitter the MSDUs are segmented ARQ blocks, and each block is numbered as explained in section 2 above. An ARQ block may be in one of the following four states, not - sent, outstanding, discarded and n o t - acknowledged. Any ARQ block begins as not -sent. When it is sent it becomes outstanding for a period of time termed ACK_WINDOW_DURATION. After that period of time it either is acknowledged and is discarded, or becomes not -acknowledged. An ARQ block can become n o t -acknowledged before the 2
4 ACK_WINDOW_DURATION period expires if it is implicitly negativel y acknowledged (for instance an ACK for a block having a higher sequence number has been received). An ARQ block may also change from not -acknowledged to discarded when an ACK message for it is received or after a timeout ARQ_BLOCK_MAX_DELAY, but setting this timeout is considered outside the scope of the ARQ specification. In order to simplify implementation, a parameter MAX_TX_WINDOW is defined. This parameter specifies the maximum difference between lowest and highest numbered outstanding ARQ blocks at any given time. This parameter can be varied to trade buffering requirements at the transmitter (and the receiver) for ARQ algorithm performance (throughput). The transmitter policy is that if any not -acknowledged ARQ blocks exist, they should be given prec edence over not -sent packets. ARQ blocks that are outstanding or discarded should never be transmitted. The ARQ block state sequence is graphically shown below. Transmit ACk_Window_Size Timer NS OS NA NACK NS - Not Sent OS - Outstanding NA - Not Acknowledged DS - Discarded ACK DS ACK ARQ_Block_Max_Delay Figure 2 : ARQ block states 4.2 Receiver state machine When an MPDU is received, its integrity is determined based on its CRC-32 checksum. If the MPDU is not erred, it is unpacked and de-fragmented. The receiver maintains a sliding- window defined by minimum arq block number state variable and the MAX_TX_WINDOW parameter. When an ARQ block with a number that falls in the range defined by sliding window is received, the receiver will accept it. ARQ block numbers outside the sliding window will be rejected as out of order. The receiver should identify duplicate ARQ blocks (i.e. ARQ blocks that where already received correctly) and discard them. The sliding window is maintained such that the minimum arq block number variable always points to the lowest numbered ARQ block that has not been received or has b een received with errors. When an ARQ block with a number corresponding to the minimum ARQ block number is received, the window is advanced (i.e. minimum arq block number is increased modulo ARQ_MAX_IDX) such that the minimum arq block number variable points to the next lowest numbered ARQ block that has not been received or has been received with errors. If ARQ blocks are being received, yet the minimum arq block number variable has pointed to a specific ARQ block longer than ARQ_SYNC_LOSS_DELAY, the ARQ a lgorithm synchronization will be considered lost. In such a case the window will slide until an ARQ block that has been correctly received is found. The minimum arq block number variable will point to the next lowest numbered ARQ block that has not been 3
5 received or has been received with errors. (Optionally a sync- loss handshake protocol between the transmitter and the receiver can be added if people believe it is important). For each ARQ block accepted fully and without errors (including duplicates), an acknowledgment message is sent to the sender. Acknowledgments may be either for specific ARQ blocks (i.e. contain information on the acknowledged ARQ block numbers), or cumulative (i.e. contain the highest ARQ block number below which all ARQ blocks have been received correctly). Acknowledgments should be sent in order of the ARQ block numbers they acknowledge. An MSDU is handed to the upper layers when all the ARQ blocks between the lowest numbered ARQ block in a fragment marked as starting-fragment and the first highest numbered ARQ block in the a fragment marked as last-fragment have been received without errors. 5 ARQ and scheduling interoperation ARQ and scheduling interact in the sense that ARQ consumes part of the bandwidth for re-transmissions and for control messages (ACK). BW requests from SS supporting connections with ARQ will always include the entire overhead required for the ARQ. To support GPC terminals a new UIUC value is defined, that identifies bandwidth the scheduler has set aside for transmission of uplink ARQ information. Here is the addition to table 108 of document IEEE P802.16/D IE Name U p l i n k Connection ID Description Interval U s a g e C o d e (UIUC) ACK -d a t a 1 2 u n i c a s t Starting offset of burst for ACK data assignment. Table 1 : A C K-data UIUC Note that as this UIUC also describes the modulation parameters to use for sending the data, it might not be an adequate solution. A cleaner solution for GPC terminals would be to define an explicit connection for ACK d ata. 6 ARQ parameters and connection setup Connections are set and defined either statically through the configuration, or dynamically through the DSA/DSC class of messages. All the ARQ parameters for an ARQ supporting connection are set when the connection is set up. The transmitter and receiver windows are reset on connection setup. This section describes the TLV fields for the ARQ algorithm, that are required for both static and dynamic connection creation methods. 6.1 ARQ_BLOCK_SIZE Fixing this number considerably simplifies the definition of related messages and bit field and makes implementation easier. The suggested fixed value is 64 bytes. 6.2 ARQ_MAX_IDX Sets the size of the group of ARQ block numbers, should be expressed as 2^N 1 where N is an integer. The group should be large enough such that no loss of an ARQ block or an ACK will cause any ambiguity. The number would depend on the ACK_WINDOW_DURATION, the ARQ_BLOCK_SIZE, and the transmission rate. Taking as a maximum a PHY data rate of 120Mb/S with frame duration of 1mS, and allowing 16mS for the ACK-WINDOW_DURATION, implies we need N as high as 13 here. 4
6 6.3 MAX_TX_WINDOW From the point of view of performance, it would be ideal if this parameter were set such that the transmitter is never blocked by transmission and processing delays. It is also required for correct ARQ algorithm operation that this number is less than half of the ARQ_MAX_IDX parameter. From the point of view of implementation complexity, this parameter eases implementation by placing a limit on the transmitter (and receiver) buffering requirements. This parameter is negotiated between the transmitter and the receiver at the connection set -up. The DSA/DSC message will contain a suggested value for this parameter The DSA - RSP/DSC-RSP message will contain an acknowledgement of this parameter, or a different suggested value. The lower of the two values will be used. T y p e Length Value S c o p e [ 2 4 / 2 5 ].? D S x -REQ D S x -RSP Table 2 : MAX_TX_WINDOW TLV 6.4 ACK_WINDOW_DURATION The ACK window duration should account for the transmission and processing time for the forward going message and for the scheduling, transmission and processing delays for the ACK message. The combination of all these delays is partly predictable, partly implementation dependent and partly scenario dependant (e.g. the scheduling part). The minimal ACK_WINDOW_DURATION is the sum of the times durations listed below, Tmsg-t x- time: The time it takes to send an ARQ block over the PHY. Depends on the channel and modulation parameters. Known by the BS at connection setup. Tair- delay: The time it takes the RF wave to spread, depends on the cell size. The BS at connection setup knows the maximum value. Treceiver-process: Implementation depen dent receiver processing delay. This is a capability of the receiver. Tack-scheduling: Scenario or policy dependant scheduling delay for the ACK message in the receiver. This value could be set by the BS (for a GPC terminal) or by the SS (for a GPT terminal). The longer value should prevail. Tack-tx-time: The time it takes to send an ACK message over the PHY. Depends on the format of the ACK message as well as on channel and modulation parameters. Known by the BS at connection setup. Tair- delay: The time it takes the RF wave to spread, depends on the cell size. The BS at connection setup knows the maximum value. Ttransmitter-process: Implementation dependent transmitter processing delay of the ACK message. This is a capability of the transmitter. From the above analysis we may conclude that there are three types of parameters here, 1. Parameters set by the BS (namely Tmsg-tx-time, Tair-delay, Tack-tx-time). The DSA/DSC or DSA - RSP/DSC-RSP message will contain the values for these parameters, set by the BS. 2. Parameters negotiated between the BS and the SS (namely Tack- scheduling ). The DSA/DSC message will contain a suggested value for this parameter The DSA -RSP/DSC-RSP message will contain an acknowledgement of this parameter, or a different suggested value. The larger of the two values will be used. 3. Parameters that are capabilities (namely Treceiver-process, Ttransmitter- process). The DSA/DSC or DSA - RSP/DSC - RSP message will contain the values for these parameters where the receiver and transmitter each declare its capability. When the DSA/DSC handshake is over each party should know all the parameters listed above and each can calculate the value for the ACK_WINDOW_DURATION as their sum. 5
7 The table below lists the relevant TLVs. Name T y p e Length Value S c o p e T m s g -t x -t i m e [ 2 4 / 2 5 ].?.? D S x -R E Q (In microseconds) D S x -R S P T a i r-d e l a y [ 2 4 / 2 5 ].?.? (In microseconds) T r e c e i v e r - p r o c e s s [ 2 4 / 2 5 ].?.? (In microseconds) T a c k -s c h e d u l i n g [ 2 4 / 2 5 ].?.? (In microseconds) Tack- t x -t i m e [ 2 4 / 2 5 ].?.? (In microseconds) T t r a n s m i t t e r -p r o c e s s [ 2 4 / 2 5 ].?.? (In microseconds) 6.5 ARQ_BLOCK_MAX_DELAY Table 3: ACK_WINDOW_DURATION releated TLVs D S x -R E Q D S x -R S P D S x -R E Q D S x -R S P C onfiguration D S x -R E Q D S x -R S P D S x -R E Q D S x -R S P D S x -R E Q D S x -R S P This parameter is useful for cases where delay is bounded, yet ARQ can be helpful (e.g. VOIP). It allows limiting the delay that ARQ introduces and guarantees that transmission of ARQ blocks that are no longer useful to the upper layers is avoided. The BS should set this parameter. The DSA/DSC or DSA -RSP/DSC-RSP message will contain the value for this parameter as set by the BS. T y p e Length Value S c o p e [ 2 4 / 2 5 ].? D S x -REQ D S x -RSP 6.6 ARQ_SYNC_LOSS_DELAY Table 4: ARQ_BLOCK_MAX_DELAY TLV This parameter guarantees that the ARQ algorithm does not get stuck indefinitely. The only li mitation on this parameter is that it should be long enough such that a reasonable number of retransmissions are allowed before this timeout occurs and data is lost in the corrective action taken. The BS should set this parameter. The DSA/DSC or DSA -RSP/DSC-RSP message will contain the value for this parameter as set by the BS. T y p e Length Value S c o p e [ 2 4 / 2 5 ].? D S x -REQ D S x -RSP Table 5 : ARQ_SYNC_LOSS_DELAY TLV 6
8 6.7 SEND_FULL_BLOCKS This parameter is negotiated between the transmitter and the receiver at the connection set-u p. The DSA/DSC message will contain a suggested value for this parameter The DSA - RSP/DSC-RSP message will contain an acknowledgement of this parameter, or a different suggested value. The lower of the two values will be used. T y p e Length Value S c o p e [ 2 4 / 2 5 ].? 2 0= Fragment on ARQ block boundary only D S x -REQ 1= No limitation on fragmentation D S x -RSP 7 Formats of ARQ related MAC message 7.1 ARQ sub-header Table 6 : SEND_FULL_BLOCKS TLV The information conveyed by the ARQ sub -header is a BSN, which stands for Block Sequential Number referencing the block number of the first ARQ block in the MPDU. As the size of the ARQ block is known, and it is possible to detect a partial ARQ block (i.e. an ARQ block that was last in the MSDU and therefore its size is smaller than ARQ_BLOCK_SIZE ), this information should suffice to extract all ARQ block numbers in the MPDU. When an ARQ sub -header is present with other sub-headers, it is always inserted between the generic MAC header and the MPDU payload after the grant -management and packing or fragmentation sub -headers. 7.2 ARQ feedback sub-header This sub -header enables piggybacking of ARQ feedback information elements. When A R Q-feedback sub - header is present with other sub-headers, it is always the last to be inserted between the generic MAC header and the MPDU payload. Refer to section for details. 7.3 Generic MAC header update The Generic MAC header TYPE field needs to be updated to indicate the presence of the ARQ feedback subheader. Here are the updated table that should replace table 4 and table 5 of document IEEE P802.16/D
9 T y p e D e s c r i p t i o n 0 x 0 0 N o s u b -h e a d e r s p r e s e n t 0 x 0 1 R e s e rved 0 x 0 2 P a c k i n g s u b -h e a d e r p r e s e n t 0 x 0 3 R e s e r v e d 0 x 0 4 F r a g m e n t a t i o n s u b -h e a d e r p r e s e n t 0 x 0 5 R e s e r v e d 0 x 0 6 R e s e r v e d 0 x 0 7 R e s e r v e d 0 x 0 8 ARQ -f e e d b a c k s u b -h e a d e r p r e s e n t 0 x 0 9 R e s e r v e d 0x0A ARQ -f e e d b a c k a n d p a c k i n g s u b -h e a d e r s p r e s e n t 0 x 0 B R e s e r v e d 0 x 0 C ARQ -f e e d b a c k a n d f r a g m e n t a t i o n s u b -h e a d e r s p r e s e n t 0x0D 0x3F R e s e r v e d Table 7 : Downlink type encoding T y p e D e s c r i p t i o n 0 x 0 0 N o s u b -h e a d e r s p r e s e n t 0 x 0 1 G r a n t m a n a g e m e n t s u b -h e a d e r p r e s e n t 0 x 0 2 P a c k i n g s u b -h e a d e r p r e s e n t 0 x 0 3 G r a n t m a n a g e m e n t a n d p a c k i n g s u b -h e a d e r s p r e s e n t 0 x 0 4 F r a g m e n t a t i o n s u b -h e a d e r p r e s e n t 0 x 0 5 G r a n t m a n a g e m e n t a n d f r a g m e n t a t i o n s u b -h e a d e r s p r e s e n t 0 x 0 6 R e s e r v e d 0 x 0 7 R e s e r v e d 0 x 0 8 ARQ -f e e d b a c k s u b -h e a d e r p r e s e n t 0 x 0 9 ARQ -f e e d b a c k a n d g r a n t m an a g e m e n t s u b -h e a d e r s p r e s e n t 0x0A ARQ -f e e d b a c k a n d p a c k i n g s u b -h e a d e r s p r e s e n t 0 x 0 B ARQ -f e e d b a c k a n d p a c k i n g a n d g r a n t m a n a g e m e n t s u b -h e a d e r s p r e s e n t 0 x 0 C ARQ -f e e d b a c k a n d f r a g m e n t a t i o n s u b -h e a d e r s p r e s e n t 0x0D ARQ -f e e d b a c k a n d f r a g m e n t a t i o n a n d g r a n t m a n a g e m e n t s u b -h e a d e r s p r e s e n t 0x0E 0 x 3 F R e s e r v e d Table 8: Uplink type encoding ARQ with no fragmentation and no packing In this case each MPDU will contain a single MSDU. Knowledge of the BSN, the length of the MSDU (conveyed i n the MAC header) and the ARQ_BLOCK_SIZE parameter enables the calculation of the range of ARQ blocks contained in the message. The ARQ sub- header position and its contents are shown below. Generic MAC Header ARQ sub-header Payload ( = One MSDU) CRC-32 Figure 3 : A RQ sub- header with no fragmentation and no packing 8
10 Syntax Size Notes ARQ_Sub_Header_Format() { Reserved 3 b i t s BSN 1 3 b i t s Block sequential number for the first ARQ block in the MSDU Table 9 : ARQ sub-header forma t with no fragmentation and no packing ARQ with fragmentation only In this case each MPDU will contain a single fragment of a MSDU. Fragmentation is NOT guaranteed to be on an ARQ block boundary, and therefore either the first ARQ block or the last ARQ block (or both) could be partial blocks. Note that part of the information carried in the fragmentation sub -header is no longer very useful. We still require the FC field to tell us if this is the first, last or a middle fragment, but the FSN field is redundant, as we must use the ARQ block numbers for correct fragment placement. We will reuse the FSN bits carry information about the size of the first ARQ block (that may be partial) in the fragment. Note that a partial first ARQ block in a fragment will always carry the last bytes of the ARQ block while a partial last ARQ block in the fragment will always carry the first bytes of the ARQ block (there is an example later). Knowledge of the BSN of the first ARQ block, the size of the first ARQ block, the length o f the MSDU (conveyed in the MAC header) and the ARQ_BLOCK_SIZE parameter enables the calculation of the range of ARQ blocks contained in the message. The ARQ with fragmentation sub- header position and its contents is shown below. Generic MAC Header Fragmentaion and ARQ sub-header Payload ( = One MSDU fragment) CRC-32 Figure 4: ARQ sub -header with fragmentation only Syntax Size Notes Fragmentation_and_ARQ_Sub_Header_Format() { FC 2 b i t s Fragmentation Control Indicates the fragmentation state of the payload: 00 = no fragmentation 01 = last fragment 10 = first fragment 11 = continuing (middle) fragment Reserved 3 b i t s First block length in bytes, minus one 6 b i t s ARQ_BLOCK_SIZE = 64 bytes BSN 1 3 b i t s Block sequential number for the first ARQ block in the MSDU fragment Table 1 0: ARQ with fragmentation sub -header format ARQ with fragmentation and packing In this case each MPDU may contain multiple MSDU or fragments thereof. In this case as well, fragmentation is NOT guaranteed to be on an ARQ block boundary, and therefore either the first ARQ block or the last ARQ block (or both) could be partial blocks. Here as well, part of the information carried in the fragmentation subheader is no longer very useful. We still require the FC field but not the FSN field. We will reuse the FSN bits carry information about the size of the first ARQ block (that may be partial) in the fragment. Note that a partial 9
11 first ARQ block in a fragment will always carry the last bytes of the ARQ block while a partial last ARQ block in the fragment will always carry the first bytes of the ARQ block (see example below). Each of the packed MSDU or MSDU fragments requires its own ARQ sub-header, as some of them may be transmissions while other are re-transmissions. Knowledge of the BSN of the first ARQ block, the size of the first ARQ block, the length of the each MSDU fragment (conveyed in the packing sub- header) and the ARQ_BLOCK_SIZE parameter enables the calculation of the range of ARQ blocks contained in each part of t h e p acked message. The ARQ with packing sub- headers position and the contents of an ARQ with packing and fragmentation sub-header is shown below. Generic MAC Header Packing and ARQ sub-header Payload ( = One MSDU or fragment) Packing and ARQ sub-header Payload ( = One MSDU or fragment) CRC-32 Figure 5 : ARQ sub -header with fragmentation and packing Syntax Size Notes Packing_and_ARQ_Sub_Header_Format() { FC 2 b i t s Fragmentation Control Indicates the fragmentation state of the payload: 00 = no fragmentation 01 = last fragment 10 = first fragment 11 = continuing (middle) fragment L e n g t h 1 1 b i t s T h e length in bytes of the MSDU or MSDU fragment, including the four- byte Packing_and_ARQ sub- header First block length in bytes, minus one 6 b i t s ARQ_BLOCK_SIZE = 64 bytes BSN 1 3 b i t s Block sequential number for the first ARQ block in the MSDU or MSDU fragment Table 11 : ARQ with fragmentation and packing sub-header format As this case is the most complicated, an example is given here to show how information on the ARQ block numbers is extracted from the data in the MPDU in a dynamic situation. 1 0
12 MSDU # MSDU # MSDU # MSDUs to send time axis MPDU #1 MPDU #2 MPDU #3 MPDU # Start FRG Middle FRG Last FRG MSDU#2 Unfragmented MSDU#3 Start FRG MSDU#3 Last FRG Middle FRG First transmission First transmission First transmission First transmission Retransmission FC: Length: First block: BSN: bytes for block 17 (part of MSDU #3) 64 bytes for block 18 (part of MSDU #3) 64 bytes for block 19 (part of MSDU #3) 12 bytes for block 20 (part of MSDU #3) FC: Length: First block: BSN: Figure 6 : ARQ with packing and fragmentation dynamic example bytes for block 9 (part of MSDU #1) 32 bytes for block 10 (part of MSDU #1) 7.4 ACK messages In order to function the ARQ algorithm in the transmitter needs feedback from in the receiver in the form acknowledgment messages for the ARQ blocks that have been received without errors. The feedback information is sent on the appropriate basic management connection between that SS and the BST (there is one such connection in each direction). Note that MAC management messages sent on the basic management connection should not be packed or fragmented Stand-alone ACK message This ACK message may take the format of a stand-alone MAC message. It can signal a cumulative ACK or several selective ACKs, and it can also hint on not acknowledged ARQ block numbers (NACKs). The format is shown below. Syntax Size Notes ACK_Message_Format() { Management Message Type =? 8 b i t s for ( i = 1 ; I <n ; i ++) { Repeat as many times as required ARQ_feed back_ie () 1 6 b i t s The connection ID being referenced Table 1 2 : ACK message 1 1
13 Syntax Size Notes ARQ_feedback_IE () { L a s t _ f l a g 1 bit 0 = More ARQ feedback IE in the list 1 = Last ARQ feedback IE in the lis t C u m _ S e l _ f l a g 1 bit 0 = Selective ACK entry 1 = Cumulative ACK entry B M _ f l a g 1 bit 0 = Bit -map field does not exist 1 = Bit -map field exists If (Cum_Sel_flag == 0) { B S N 1 3 b i t s Block sequential number for the else { B S N If (BM_flag == 1) { ACK MAP 1 3 b i t s 1 6 b i t s acknowledged ARQ block Block sequential number for the ARQ block below which all blocks are acknowledged Each bit set to one means the corresponding ARQ block has been received without errors. The LSB corresponds to the ARQ block whose number is the BSN above, an the MSB relates to the ARQ block whose number is (BSN + 15) modulo 2^13 CID 1 6 b i t s The ID of the connection being referenced Table 13 : ARQ feedback IE definition Piggyback ACK The ARQ feedback can be piggybacked on any connection taking the format of a sub-header. 1 2
IEEE C /058r3
Project Title IEEE 802.16 Broadband Wireless Access Working Group MAC support and the general structure of the Coexistence Protocol messages Date Submitted 2006-07-13 Source(s)
More informationIEEE C802.16e-05/084r4. IEEE Broadband Wireless Access Working Group <
Project Title Date Submitted IEEE 80.16 Broadband Wireless Access Working Group A MAP IE for H-ARQ and SDMA Allocation in AAS Zone 005-01-6 Source(s) InSeok Hwang, Jaehee Cho, Seungj
More informationIEEE Broadband Wireless Access Working Group <
2003-12-29 EE 802.16d-03/84r1 Project Title Date Submitted EE 802.16 Broadband Wireless Access Working Group Proposal on DLFP Format Change for 802.16 OFDM 2003-12-29 Source(s)
More informationModeling and Simulation NETW 707
Modeling and Simulation NETW 707 Lecture 6 ARQ Modeling: Modeling Error/Flow Control Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Data Link Layer Data Link Layer provides
More informationIEEE C802.16e-05/084r1. IEEE Broadband Wireless Access Working Group <
Project Title Date Submitted IEEE 80.16 Broadband Wireless Access Working Group A MAP IE for H-ARQ and SDMA Allocation in AAS Zone 005-01-184 Source(s) InSeok Hwang, Jaehee Cho,
More informationIEEE C802.16e-05/142 Project. IEEE Broadband Wireless Access Working Group <
Project IEEE 80.6 Broadband Wireless Access Working Group Title Date Submitted Per Stream Power Control in CQICH Enhanced Allocation IE 005-03-09 Source(s) Re: Xiangyang (Jeff) Zhuang
More informationMultimedia Systems WS 2010/2011
Multimedia Systems WS 2010/2011 15.11.2010 M. Rahamatullah Khondoker (Room # 36/410 ) University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Total points: 40 Homework 1 - Solutions Out: 10/4, Due: 10/11 Solutions 1. Two-dimensional parity Given below is a series of 7 7-bit items of data, with an additional bit each
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationcs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Agenda Internetworking n Routing across LANs, layer2-layer3 n DHCP n NAT Transport layer
More informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Per-node throughput in case of: Full connected networs each node sees all the others Generic networ topology not all nodes are visible Performance Analysis of single-hop
More informationThese are special traffic patterns that create more stress on a switch
Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually
More informationEECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)
EECS 150 - Components and esign Techniques for igital Systems Lec 26 CRCs, LFSRs (and a little power) avid Culler Electrical Engineering and Computer Sciences University of California, Berkeley http://www.eecs.berkeley.edu/~culler
More informationWireless Internet Exercises
Wireless Internet Exercises Prof. Alessandro Redondi 2018-05-28 1 WLAN 1.1 Exercise 1 A Wi-Fi network has the following features: Physical layer transmission rate: 54 Mbps MAC layer header: 28 bytes MAC
More informationBit Error Period Determination and Optimal Frame Length Prediction for a Noisy Communication Channel
Bit Error Period Determination and Optimal Frame Length Prediction for a oisy Communication Channel Georgi Atanasov aydenov and Petko Stoyanov Stoyanov Faculty of Science and Technology, Technical University
More informationIEEE Broadband Wireless Access Working Group <
Project Title IEEE 802.6 Broadband Wireless Access Working Group Codebook based pre-coding MIMO Date Submitted Source(s) 2008-05-05 Jaewan Kim, Wookbong Lee, Bin-chul Ihm Voice:
More informationComputer Networks ( Classroom Practice Booklet Solutions)
Computer Networks ( Classroom Practice Booklet Solutions). Concept Of Layering 0. Ans: (b) Sol: Data Link Layer is responsible for decoding bit stream into frames. 0. Ans: (c) Sol: Network Layer has the
More informationA POMDP Framework for Cognitive MAC Based on Primary Feedback Exploitation
A POMDP Framework for Cognitive MAC Based on Primary Feedback Exploitation Karim G. Seddik and Amr A. El-Sherif 2 Electronics and Communications Engineering Department, American University in Cairo, New
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.
Outline EECS 150 - Components and esign Techniques for igital Systems Lec 18 Error Coding Errors and error models Parity and Hamming Codes (SECE) Errors in Communications LFSRs Cyclic Redundancy Check
More informationConvolutional Coding LECTURE Overview
MIT 6.02 DRAFT Lecture Notes Spring 2010 (Last update: March 6, 2010) Comments, questions or bug reports? Please contact 6.02-staff@mit.edu LECTURE 8 Convolutional Coding This lecture introduces a powerful
More informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Ł Ł Ł Ł Arbitrary networ capacity [Gupta & Kumar The Capacity of Wireless Networs ] Ł! Ł "! Receiver Model Ł Ł # Ł $%&% Ł $% '( * &%* r (1+ r Ł + 1 / n 1 / n log n Area
More informationECE 4450:427/527 - Computer Networks Spring 2017
ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.2: Error Detection & Correction Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527
More informationLan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN
Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN Ethernet Frame Format 7 b y te s 1 b y te 2 o r 6 b y te s 2 o r 6 b y te s 2 b y te s 4-1 5 0 0 b y te s 4 b y te s P r e a m b le S ta r t F r
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationE8 TCP. Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione
E8 TP Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Exercises o onsider the connection in the figure A =80 kbit/s τ =0 ms R =? τ =? B o o o Host A wants to know the capacity
More informationGetting Connected. Chapter 2, Part 2. Networking CS 3470, Section 1 Sarah Diesburg
Getting Connected Chapter 2, Part 2 Networking CS 3470, Section 1 Sarah Diesburg 1 Five Problems Encoding/decoding Framing Error Detection Error Correction Media Access 2 Five Problems Encoding/decoding
More informationDetecting Stations Cheating on Backoff Rules in Networks Using Sequential Analysis
Detecting Stations Cheating on Backoff Rules in 82.11 Networks Using Sequential Analysis Yanxia Rong Department of Computer Science George Washington University Washington DC Email: yxrong@gwu.edu Sang-Kyu
More informationPerformance Analysis of the IEEE e Block ACK Scheme in a Noisy Channel
Performance Analysis of the IEEE 802.11e Block ACK Scheme in a Noisy Channel Tianji Li, Qiang Ni, Hamilton Institute, NUIM, Ireland. Thierry Turletti, Planete Group, INRIA, France. Yang Xiao, University
More informationScheduling Algorithms for Efficient. Delivery of Synchronous Traffic in. Wireless Access Networks
Scheduling Algorithms for Efficient Delivery of Synchronous Traffic in Wireless Access Networks Liran Katzir Scheduling Algorithms for Efficient Delivery of Synchronous Traffic in Wireless Access Networks
More informationData byte 0 Data byte 1 Data byte 2 Data byte 3 Data byte 4. 0xA Register Address MSB data byte Data byte Data byte LSB data byte
SFP200 CAN 2.0B Protocol Implementation Communications Features CAN 2.0b extended frame format 500 kbit/s Polling mechanism allows host to determine the rate of incoming data Registers The SFP200 provides
More informationTCP over Cognitive Radio Channels
1/43 TCP over Cognitive Radio Channels Sudheer Poojary Department of ECE, Indian Institute of Science, Bangalore IEEE-IISc I-YES seminar 19 May 2016 2/43 Acknowledgments The work presented here was done
More informationMATHEMATICAL MODEL AND CALCULATION OF SS7 RELIABILITY
MATHEMATICAL MODEL AND CALCULATION OF 7 RELIABILITY THUNEIBAT. A. Asstt rof., Department of Electrical Engineering, BAU, Jordan Thuneibat@hotmail.com ABTRACT In this paper, a mathematical model of signaling
More informationEPOC Upstream Mapping Part 2
EPOC Upstream Mapping Part 2 Ed Boyd, Broadcom Burst Anatomy UPSTREAM BURST MARKERS EPON Review The EPON OLT locks to the upstream without information from the MAC. The is able to determine 1G or 10G EPON
More informationReliable Data Transport: Sliding Windows
Reliable Data Transport: Sliding Windows 6.02 Fall 2013 Lecture 23 Exclusive! A Brief History of the Internet guest lecture by Prof. Hari Balakrishnan Wenesday December 4, 2013, usual 6.02 lecture time
More informationECE 3511: Communications Networks Theory and Analysis. Fall Quarter Instructor: Prof. A. Bruce McDonald. Lecture Topic
ECE 3511: Communications Networks Theory and Analysis Fall Quarter 2002 Instructor: Prof. A. Bruce McDonald Lecture Topic Introductory Analysis of M/G/1 Queueing Systems Module Number One Steady-State
More informationMathematical Analysis of IEEE Energy Efficiency
Information Engineering Department University of Padova Mathematical Analysis of IEEE 802.11 Energy Efficiency A. Zanella and F. De Pellegrini IEEE WPMC 2004 Padova, Sept. 12 15, 2004 A. Zanella and F.
More informationA Model for the Performance Evaluation of Packet Transmissions Using Type-II Hybrid ARQ over a Correlated Error Channel
A Model for the Performance Evaluation of Packet Transmissions Using Type-II Hybrid ARQ over a Correlated Error Channel Rami Mukhtar, Stephen Hanly, Moshe Zukerman and Fraser Cameron ARC Special research
More informationImproved MU-MIMO Performance for Future Systems Using Differential Feedback
Improved MU-MIMO Performance for Future 80. Systems Using Differential Feedback Ron Porat, Eric Ojard, Nihar Jindal, Matthew Fischer, Vinko Erceg Broadcom Corp. {rporat, eo, njindal, mfischer, verceg}@broadcom.com
More informationHari Coding Objectives
Hari Coding Objectives Protocol Independence - 10 GbE, FC, InfiniBand Alignment independence (e.g. word, even/odd, etc.) Application Independence Chip-to-PMD, Chip-to-Chip (backplane), Very Short-Haul
More informationLecture on Sensor Networks
Lecture on Sensor Networks Cyclic Historical Redundancy Development Copyright (c) 2008 Dr. Thomas Haenselmann (University of Mannheim, Germany). Permission is granted to copy, distribute and/or modify
More informationRate-Compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Schemes in Packet Data Communications
Rate-Compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Schemes in Packet Data Communications Jing Li (Tiffany) Electrical Engineering Dept, Texas A&M University College Station, TX
More informationAbout the Sens it Payload
About the Sens it Payload Payload structure 4 bytes 8 bytes Mode values Configuration values (optional) If the message is an uplink only frame, the payload contains only the 4 bytes of mode values. If
More informationIEEE Working Group on Mobile Broadband Wireless Access. <http://grouper.ieee.org/groups/802/20/>
C802.20-07/35 Project IEEE 802.20 Working Group on Mobile Broadband Wireless Access Title Date Submitted Practice letter ballot 2 comment LDPC harmonized text from
More informationClock Synchronization
Today: Canonical Problems in Distributed Systems Time ordering and clock synchronization Leader election Mutual exclusion Distributed transactions Deadlock detection Lecture 11, page 7 Clock Synchronization
More informationAssume that the follow string of bits constitutes one of the segments we which to transmit.
Cyclic Redundancy Checks( CRC) Cyclic Redundancy Checks fall into a class of codes called Algebraic Codes; more specifically, CRC codes are Polynomial Codes. These are error-detecting codes, not error-correcting
More informationMultiaccess Communication
Information Networks p. 1 Multiaccess Communication Satellite systems, radio networks (WLAN), Ethernet segment The received signal is the sum of attenuated transmitted signals from a set of other nodes,
More informationOn queueing in coded networks queue size follows degrees of freedom
On queueing in coded networks queue size follows degrees of freedom Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard Laboratory for Information and Decision Systems, Massachusetts Institute of Technology,
More informationApproximate Queueing Model for Multi-rate Multi-user MIMO systems.
An Approximate Queueing Model for Multi-rate Multi-user MIMO systems Boris Bellalta,Vanesa Daza, Miquel Oliver Abstract A queueing model for Multi-rate Multi-user MIMO systems is presented. The model is
More informationBurst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks
Burst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks G. Mohan, M. Ashish, and K. Akash Department of Electrical and Computer Engineering National University
More informationCiA Draft Standard Proposal 447
CiA Draft Standard Proposal 447 Application profile for special-purpose car add-on devices Part 4: Pre-defined s and This DSP is for CiA members only and may be changed without notification. Version: 1.0
More informationNoisy channel communication
Information Theory http://www.inf.ed.ac.uk/teaching/courses/it/ Week 6 Communication channels and Information Some notes on the noisy channel setup: Iain Murray, 2012 School of Informatics, University
More informationIntegrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks
VANET Analysis Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks Tom Hao Luan, Xuemin (Sherman) Shen, and Fan Bai BBCR, ECE, University of Waterloo, Waterloo, Ontario, N2L 3G1,
More informationHDR - A Hysteresis-Driven Routing Algorithm for Energy Harvesting Tag Networks
HDR - A Hysteresis-Driven Routing Algorithm for Energy Harvesting Tag Networks Adrian Segall arxiv:1512.06997v1 [cs.ni] 22 Dec 2015 March 12, 2018 Abstract The work contains a first attempt to treat the
More informationPerformance analysis of IEEE WLANs with saturated and unsaturated sources
Performance analysis of IEEE 82.11 WLANs with saturated and unsaturated sources Suong H. Nguyen, Hai L. Vu, Lachlan L. H. Andrew Centre for Advanced Internet Architectures, Technical Report 11811A Swinburne
More informationTuning the TCP Timeout Mechanism in Wireless Networks to Maximize Throughput via Stochastic Stopping Time Methods
Tuning the TCP Timeout Mechanism in Wireless Networks to Maximize Throughput via Stochastic Stopping Time Methods George Papageorgiou and John S. Baras Abstract We present an optimization problem that
More informationIEEE C802.16a-02/66. IEEE Broadband Wireless Access Working Group <http://ieee802.org/16>
Project Title Date Submitted IEEE 802.16 Broadband Wireless Access Working Group Method for using non-squared QAM constellations 2002-05-23 Source(s) Re: Juan Alberto Torres VOCAL
More informationAgressive Transmissions over Redundant Paths for Time Critical Messages
Agressive Transmissions over Redundant Paths for Time Critical Messages Hector Garcia-Molina Department of Computer Science Stanford University Stanford CA 94305 Ben Kao Department of Computer Science
More informationAssured Horizon A new Combined Framework for Burst Assembly and Reservation in Optical Burst Switched Networks
Assured Horizon A new Combined Framework for Burst Assembly and Reservation in Optical Burst Switched Networks Klaus Dolzer University of Stuttgart, Institute of Communication Networks and Computer Engineering,
More informationWiFi MAC Models David Malone
WiFi MAC Models David Malone November 26, MACSI Hamilton Institute, NUIM, Ireland Talk outline Introducing the 82.11 CSMA/CA MAC. Finite load 82.11 model and its predictions. Issues with standard 82.11,
More informationService differentiation without prioritization in IEEE WLANs
Service differentiation without prioritization in IEEE 8. WLANs Suong H. Nguyen, Student Member, IEEE, Hai L. Vu, Senior Member, IEEE, and Lachlan L. H. Andrew, Senior Member, IEEE Abstract Wireless LANs
More informationOptimization of the Hamming Code for Error Prone Media
Optimization of the Hamming Code for Error Prone Media Eltayeb Abuelyaman and Abdul-Aziz Al-Sehibani College of Computer and Information Sciences Prince Sultan University Abuelyaman@psu.edu.sa Summery
More informationCoding versus ARQ in Fading Channels: How reliable should the PHY be?
Coding versus ARQ in Fading Channels: How reliable should the PHY be? Peng Wu and Nihar Jindal University of Minnesota, Minneapolis, MN 55455 Email: {pengwu,nihar}@umn.edu Abstract This paper studies the
More informationCommunication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi
Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 41 Pulse Code Modulation (PCM) So, if you remember we have been talking
More informationRandom Access Protocols for Massive MIMO
Random Access Protocols for Massive MIMO Elisabeth de Carvalho Jesper H. Sørensen Petar Popovski Aalborg University Denmark Emil Björnson Erik G. Larsson Linköping University Sweden 2016 Tyrrhenian International
More informationPerformance Evaluation of Deadline Monotonic Policy over protocol
Performance Evaluation of Deadline Monotonic Policy over 80. protocol Ines El Korbi and Leila Azouz Saidane National School of Computer Science University of Manouba, 00 Tunisia Emails: ines.korbi@gmail.com
More informationOptimization of the Hamming Code for Error Prone Media
278 IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.3, March 2008 Optimization of the Hamming Code for Error Prone Media Eltayeb S. Abuelyaman and Abdul-Aziz S. Al-Sehibani
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,, Bi Li a,b, Nicolas Nisse a, Hervé Rivano c, Min-Li Yu d a Coati Project, INRIA I3S(CNRS/UNSA), Sophia
More informationMin Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min
JetMax: Scalable Max-Min Min Congestion Control for High- Speed Heterogeneous Networks Yueping Zhang Joint work with Derek Leonard and Dmitri Loguinov Internet Research Lab Department of Computer Science
More informationOn ARQ for Packet Erasure Channels with Bernoulli Arrivals
On ARQ for Packet Erasure Channels with Bernoulli Arrivals Dinkar Vasudevan, Vijay G. Subramanian and Douglas J. Leith Hamilton Institute, National University of Ireland, Maynooth Abstract We study packet
More informationProcessor Sharing Flows in the Internet
STANFORD HPNG TECHNICAL REPORT TR4-HPNG4 Processor Sharing Flows in the Internet Nandita Dukkipati, Nick McKeown Computer Systems Laboratory Stanford University Stanford, CA 9434-93, USA nanditad, nickm
More informationVISY-Quick Communication Protocol
VISY-Quick Communication Protocol Rev. Protocol Version Modification VI Version Date Name 0 1.00 First release 2.0.1 2000-03-29 Willmer 1 1.10 New commands date and time (3.2... 3.5) 2.0.2 2000-07-07 Willmer
More informationRecap. CS514: Intermediate Course in Operating Systems. What time is it? This week. Reminder: Lamport s approach. But what does time mean?
CS514: Intermediate Course in Operating Systems Professor Ken Birman Vivek Vishnumurthy: TA Recap We ve started a process of isolating questions that arise in big systems Tease out an abstract issue Treat
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationThe impact of varying channel capacity on the quality of advanced data services in PCS networks
The impact of varying channel capacity on the quality of advanced data services in PCS networks Markus Fiedler Dept. of Telecommunications and Signal Processing, University of Karlskrona/Ronneby, S-371
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationA Mathematical Model of the Skype VoIP Congestion Control Algorithm
A Mathematical Model of the Skype VoIP Congestion Control Algorithm Luca De Cicco, S. Mascolo, V. Palmisano Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari 47th IEEE Conference on Decision
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationIEEE Broadband Wireless Access Working Group <
Project Title IEEE 80.6 Broadband Wireless Access Working Group LDPC coding for OFDMA PHY Date Submitted Source(s) 004-08-7 Brian Classon Yufei Blankenship Motorola Jerry Kim Gyubum
More informationUnreliable Failure Detectors for Reliable Distributed Systems
Unreliable Failure Detectors for Reliable Distributed Systems A different approach Augment the asynchronous model with an unreliable failure detector for crash failures Define failure detectors in terms
More informationAdaptive Reverse Link Rate Control Scheme for cdma2000 1xEV-DO Systems
Adaptive Reverse Link Rate Control Scheme for cdma2000 1xEV-DO Systems HyeJeong Lee, Woon-Young Yeo and Dong-Ho Cho Korea Advanced Institute of Science and Technology Abstract The cdma2000 1xEV-DO standard
More informationStrong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers Jonathan Turner Washington University jon.turner@wustl.edu January 30, 2008 Abstract Crossbar-based switches are commonly used
More informationOptimal Channel Probing and Transmission Scheduling in a Multichannel System
Optimal Channel Probing and Transmission Scheduling in a Multichannel System Nicholas B. Chang and Mingyan Liu Department of Electrical Engineering and Computer Science University of Michigan, Ann Arbor,
More informationNetworked Control Systems
Networked Control Systems Simulation & Analysis J.J.C. van Schendel DCT 2008.119 Traineeship report March till June 2008 Coaches: Supervisor TU/e: Prof. Dr. D. Nesic, University of Melbourne Dr. M. Tabbara,
More informationThroughput Maximization for Delay-Sensitive Random Access Communication
1 Throughput Maximization for Delay-Sensitive Random Access Communication Derya Malak, Howard Huang, and Jeffrey G. Andrews arxiv:1711.02056v2 [cs.it] 5 Jun 2018 Abstract Future 5G cellular networks supporting
More informationrequests/sec. The total channel load is requests/sec. Using slot as the time unit, the total channel load is 50 ( ) = 1
Prof. X. Shen E&CE 70 : Examples #2 Problem Consider the following Aloha systems. (a) A group of N users share a 56 kbps pure Aloha channel. Each user generates at a Passion rate of one 000-bit packet
More informationDiscrete Random Variables
CPSC 53 Systems Modeling and Simulation Discrete Random Variables Dr. Anirban Mahanti Department of Computer Science University of Calgary mahanti@cpsc.ucalgary.ca Random Variables A random variable is
More informationData Link Layer. Contents. Lecture 2. Overview of data Link Layer I. Overview of data Link Layer II. Functions of Data Link Layer
ELL 785 omputer ommunication Networks ontents Overview of data link layer Lecture Data Link Layer Framing Error control Flow control: RQs Examples of data link protocols - - Overview of data Link Layer
More informationDelay QoS Provisioning and Optimal Resource Allocation for Wireless Networks
Syracuse University SURFACE Dissertations - ALL SURFACE June 2017 Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks Yi Li Syracuse University Follow this and additional works
More informationAdvanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur
Advanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur Lecture - 19 Multi-User CDMA Uplink and Asynchronous CDMA
More informationOptimal Association of Stations and APs in an IEEE WLAN
Optimal Association of Stations and APs in an IEEE 802. WLAN Anurag Kumar and Vinod Kumar Abstract We propose a maximum utility based formulation for the problem of optimal association of wireless stations
More informationA Comprehensive Study of the IEEE e Enhanced Distributed Control Access (EDCA) Function. Chunyu Hu and Jennifer C. Hou.
Report No. UIUCDCS-R-26-27 UILU-ENG-26-743 A Comprehensive Study of the IEEE 82.e Enhanced Distributed Control Access EDCA) Function by Chunyu Hu and Jennifer C. Hou April 26 A Comprehensive Study of the
More informationChannel Allocation Using Pricing in Satellite Networks
Channel Allocation Using Pricing in Satellite Networks Jun Sun and Eytan Modiano Laboratory for Information and Decision Systems Massachusetts Institute of Technology {junsun, modiano}@mitedu Abstract
More informationCognitive Spectrum Access Control Based on Intrinsic Primary ARQ Information
Cognitive Spectrum Access Control Based on Intrinsic Primary ARQ Information Fabio E. Lapiccirella, Zhi Ding and Xin Liu Electrical and Computer Engineering University of California, Davis, California
More informationP e = 0.1. P e = 0.01
23 10 0 10-2 P e = 0.1 Deadline Failure Probability 10-4 10-6 10-8 P e = 0.01 10-10 P e = 0.001 10-12 10 11 12 13 14 15 16 Number of Slots in a Frame Fig. 10. The deadline failure probability as a function
More informationCommunication Theory II
Communication Theory II Lecture 24: Error Correction Techniques Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt May 14 th, 2015 1 Error Correction Techniques olinear Block Code Cyclic
More informationCapacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
IEEE TRASACTIOS O IFORMATIO THEORY 1 Capacity and Delay Tradeoffs for Ad-Hoc Mobile etworks Michael J. eely University of Southern California mjneely@usc.edu http://www-rcf.usc.edu/ mjneely Eytan Modiano
More informationEE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing
EE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely 1 Abstract This collection of notes provides a
More informationNew EPoC Burst Markers with Data Field
New EPoC Burst Markers with Data Field Leo Montreuil Rich Prodan Tom Kolze January 2015 www.broadcom.com Burst Markers Update Modifications in Burst Marker Motivation Updated BM Sequences and Modulated
More informationTransition from GVAR to GOES-R GRB Service Continuity
Transition from GVAR to GOES-R GRB Service Continuity Presented to CGMS-43 Plenary session, agenda item F.2.3 CGMS-43-NOAA-WP-02 GOES-R at Test Location First 12 Months CGMS-43-NOAA-WP-02 Slide: 2 Transitioning
More informationBounded Delay for Weighted Round Robin with Burst Crediting
Bounded Delay for Weighted Round Robin with Burst Crediting Sponsor: Sprint Kert Mezger David W. Petr Technical Report TISL-0230-08 Telecommunications and Information Sciences Laboratory Department of
More information