In this thesis, an interconnection network, called shuffle/exchanged-shuffle network(SESN), is presented as a possible candidate for VLSI network. SESN is a 4-regular graph and has a small diameter. We describe how to efficiently solve Fast Fourier Transformation, sorting problems in this network. We also present a method which gives an $O(n^2/log(n))$-area layout for SESN.