Execution of the system when the transmitter sends immediately. In the gure, W (t) represents the... more Execution of the system when the transmitter sends immediately. In the gure, W (t) represents the number of packets waiting in the queue at time t.
hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abs... more hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abstract his pper investigtes the hievle rtes using vrile length odes when trnsmitting independent informtion over degrded rodst hnnelF sn this noteD we de¢ne the trnsmission rtes from the perspetive of the reeivers nd llow the deoders to mke their deision t different instnt of timeF e give n outer ound to the region of hievle rtesD s well s exmples of ode tht hieve this ound in some settingsF
In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced... more In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced from the analysis of the transmission process. However, in traditional information theory the random arrival times are smoothed out by appropriated source coding and no consideration is made for the end-to-end delay. In this thesis, using tools from network theory, we investigate simple models that consider the end-to-end delay and/or the variability of the packet arrivals as important parameters, while staying in a information theoretic framework. First, we simplify the problem and focus on the transmission of a bursty source over a single-user channel. We introduce a new measure of channel features that enable us to incorporate the possibility to code among several packets in a scheduling problem. In this setup, we look for policies that minimize the average packet delay. Assuming that the packets are independent and sufficiently large to perform capacity achieving coding, we then con...
2006 International Conference on Communication Technology, 2006
We consider the rate allocation problem when two users (each one associated with one receiver) se... more We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality of the Best User Highest Possible Rate (BUHPR) scheduling policy. Such a policy always allocate the whole possible rate to the non-empty queue serving the user with the minimum average packet length. Our analysis can be generalized to the symmetric multiuser broadcast channel.
2007 IEEE International Symposium on Information Theory, 2007
hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abs... more hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abstract his pper investigtes the hievle rtes using vrile length odes when trnsmitting independent informtion over degrded rodst hnnelF sn this noteD we de¢ne the trnsmission rtes from the perspetive of the reeivers nd llow the deoders to mke their deision t different instnt of timeF e give n outer ound to the region of hievle rtesD s well s exmples of ode tht hieve this ound in some settingsF
We consider the rate allocation problem when two users (each one associated with one receiver) se... more We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality of the Best User Highest Possible Rate (BUHPR) scheduling policy. Such a policy always allocate the whole possible rate to the non-empty queue serving the user with the minimum average packet length. Our analysis can be generalized to the symmetric multiuser broadcast channel.
Traditionally, the bursty nature of data sources is not taken in consideration by information the... more Traditionally, the bursty nature of data sources is not taken in consideration by information theory. Random arrival times typically are assumed to be smoothed out by appropriate source coding, rendering any meaningful analysis of the endto-end delay impossible. On the other hand, network theory directly treats these issues, but over-simplifies the channel model. Particularly, the issues of noise and interference are ignored and no sophisticated coding is allowed. In this paper, we introduce a framework in which some aspects of both sides are incorporated. This results in the formulation of new scheduling problems. In simple settings, we are able to characterize and analyze delay optimal policies.
Variable Length Coding over the Two-User Multiple-Access Channel
For discrete memoryless multiple-access channels, we propose a general definition of variable len... more For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel coding problem and allows us to characterize the region of achievable rates when the receiver is able to decode each transmitted message at a different instant of time.We show an outer bound on this region and derive a simple coding scheme that can achieve, in particular settings, all rates within the region delimited by the outer bound. In addition, we propose a random variable length coding scheme that achieve the direct part of the block code capacity region of a multiple-access channel without requiring any agreement between the transmitters.
Execution of the system when the transmitter sends immediately. In the gure, W (t) represents the... more Execution of the system when the transmitter sends immediately. In the gure, W (t) represents the number of packets waiting in the queue at time t.
hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abs... more hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abstract his pper investigtes the hievle rtes using vrile length odes when trnsmitting independent informtion over degrded rodst hnnelF sn this noteD we de¢ne the trnsmission rtes from the perspetive of the reeivers nd llow the deoders to mke their deision t different instnt of timeF e give n outer ound to the region of hievle rtesD s well s exmples of ode tht hieve this ound in some settingsF
In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced... more In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced from the analysis of the transmission process. However, in traditional information theory the random arrival times are smoothed out by appropriated source coding and no consideration is made for the end-to-end delay. In this thesis, using tools from network theory, we investigate simple models that consider the end-to-end delay and/or the variability of the packet arrivals as important parameters, while staying in a information theoretic framework. First, we simplify the problem and focus on the transmission of a bursty source over a single-user channel. We introduce a new measure of channel features that enable us to incorporate the possibility to code among several packets in a scheduling problem. In this setup, we look for policies that minimize the average packet delay. Assuming that the packets are independent and sufficiently large to perform capacity achieving coding, we then con...
2006 International Conference on Communication Technology, 2006
We consider the rate allocation problem when two users (each one associated with one receiver) se... more We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality of the Best User Highest Possible Rate (BUHPR) scheduling policy. Such a policy always allocate the whole possible rate to the non-empty queue serving the user with the minimum average packet length. Our analysis can be generalized to the symmetric multiuser broadcast channel.
2007 IEEE International Symposium on Information Theory, 2007
hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abs... more hool of gomputer nd gommunition ienesD ipv grEIHIS vusnneD witzerlnd imilX stephneFmusydep£Fh Abstract his pper investigtes the hievle rtes using vrile length odes when trnsmitting independent informtion over degrded rodst hnnelF sn this noteD we de¢ne the trnsmission rtes from the perspetive of the reeivers nd llow the deoders to mke their deision t different instnt of timeF e give n outer ound to the region of hievle rtesD s well s exmples of ode tht hieve this ound in some settingsF
We consider the rate allocation problem when two users (each one associated with one receiver) se... more We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality of the Best User Highest Possible Rate (BUHPR) scheduling policy. Such a policy always allocate the whole possible rate to the non-empty queue serving the user with the minimum average packet length. Our analysis can be generalized to the symmetric multiuser broadcast channel.
Traditionally, the bursty nature of data sources is not taken in consideration by information the... more Traditionally, the bursty nature of data sources is not taken in consideration by information theory. Random arrival times typically are assumed to be smoothed out by appropriate source coding, rendering any meaningful analysis of the endto-end delay impossible. On the other hand, network theory directly treats these issues, but over-simplifies the channel model. Particularly, the issues of noise and interference are ignored and no sophisticated coding is allowed. In this paper, we introduce a framework in which some aspects of both sides are incorporated. This results in the formulation of new scheduling problems. In simple settings, we are able to characterize and analyze delay optimal policies.
Variable Length Coding over the Two-User Multiple-Access Channel
For discrete memoryless multiple-access channels, we propose a general definition of variable len... more For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel coding problem and allows us to characterize the region of achievable rates when the receiver is able to decode each transmitted message at a different instant of time.We show an outer bound on this region and derive a simple coding scheme that can achieve, in particular settings, all rates within the region delimited by the outer bound. In addition, we propose a random variable length coding scheme that achieve the direct part of the block code capacity region of a multiple-access channel without requiring any agreement between the transmitters.
Uploads
Papers by Stéphane Musy