We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...

In this writeup, we summarize the extensions made to TCP (relative to what I teach in the Internet architecture/protocols course). The list includes: 1. Larger window sizes accommodated through a window scale option is proposed for LFNs (Networks with Long Fat Pipes) [1], which are networks that have large values of the delay bandwidth product (DBP). TCP performance depends upon this product. T...

We are working on a modification to TCP’s window increase/decrease algorithm that would allow TCP to run with high congestion windows with realistic packet drop rates. TCP’s sending rate is roughly 1:2=pp packets per round-trip time, for p the packet loss rate on the path. This is a direct consequence of TCP’s halving its congestion window in response to loss, and increasing the congestion wind...

This paper proposes a joint optimization mechanism for packet length and power in the scenario of covert short D2D communication, so as to effectively improve communication performance between pairs subject constraint. Specifically, we construct short-packet model assisted by further propose notion effective throughput (ECT) quantitatively characterize trade-off covertness reliability IoT state...

In this paper we study necessary and sufficient conditions for some types of linear combinations of wave packet frames to be a frame for L2(Rd). Further, we illustrate our results with some examples and applications.