We discuss some recent improvements on bounds on optimal code size for some non symmetric channels such as deletion/insertion channel. We show that in essence such bounds may be thought of as generalized sphere-packing upper bounds derived either for the channel graph or codeword constraint graph of the channel.