Practical Recovery Solution for Information Loss in Real-Time Network Environment

Feedback mechanism based algorithms are frequently used to solve network optimization problems. These schemes involve users and network exchanging information (e.g. requests for bandwidth allocation and pricing) to achieve convergence towards an optimal solution. However, in the implementation, these algorithms do not guarantee that messages will be delivered to the destination when network congestion occurs. This in turn often results in packet drops, which may cause information loss, and this condition may lead to algorithm failing to converge. To prevent this failure, we propose least square (LS) estimation algorithm to recover the missing information when packets are dropped from the network. The simulation results involving several scenarios demonstrate that LS estimation can provide the convergence for feedback mechanism based algorithm.

[1]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[2]  Byung-Guk Kim,et al.  Congestion Control with QoS and Delays Utility Function , 2013, 2013 22nd International Conference on Computer Communication and Networks (ICCCN).

[3]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[4]  Byung-Guk Kim,et al.  Recovery of Information Lost by the Least Squares Estimation in Real-Time Network Environment , 2014, 2014 IEEE 13th International Symposium on Network Computing and Applications.

[5]  Hengky Susanto,et al.  From Self-Regulate to Admission Control in Real-Time Traffic Environment , 2014, 2014 IEEE 28th International Conference on Advanced Information Networking and Applications.

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  Jim Kurose,et al.  Computer Networking: A Top-Down Approach (6th Edition) , 2007 .

[8]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[9]  Vishal Misra,et al.  On the robustness of soft state protocols , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[10]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[11]  A. Couch,et al.  Toward a cost model for system administration , 2005 .

[12]  Giampiero Pecelli,et al.  Dynamic behavior of feedback congestion control schemes , 1995, Proceedings of INFOCOM'95.

[13]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[14]  Michael D. Lemmon,et al.  Distributed network utility maximization using event-triggered barrier methods , 2009, 2009 European Control Conference (ECC).

[15]  Colin Perkins,et al.  Explicit Congestion Notification (ECN) for RTP over UDP , 2012, RFC.

[16]  Byung-Guk Kim,et al.  Congestion control and user utility function for real-time traffic , 2013, 2013 IEEE Globecom Workshops (GC Wkshps).

[17]  Steven H. Low,et al.  Optimization flow control with estimation error , 2004, IEEE INFOCOM 2004.

[18]  Jim Kurose,et al.  Computer Networking: A Top-Down Approach , 1999 .

[19]  B. Kim.  The soft QoS service (SQS) in the Internet , 2001, Joint 4th IEEE International Conference on ATM(ICATM'01) and High Speed Intelligent Internet Symposium. ICATM 2001 (Cat. No.00EX486).

[20]  Byung-Guk Kim,et al.  Message passing delay in network congestion management , 2014, 2014 23rd Wireless and Optical Communication Conference (WOCC).