Author Description

Today's Internet provides one simple service: best effort datagram delivery. This minimalist service allows the Internet to be stateless, that is, routers do not need to maintain any fine grained information about traffic. As a result of this stateless architecture, the Internet is both highly scalable and robust. In this thesis novel solutions are proposed for providing flow protection with stateless network and simple state network by retaining simple, scalable and robust features of the current best effort service. Stateless network architecture is a network in which, routers do not maintain any state information. This architecture is simple, scalable and robust. simple state Network is a net work in which routers maintain only packet count and flow-id as state information. This architecture is simple. we describe complete solutions including architectures, algorithms and implementations which address the most important flow protection problem in today's Internet. Compared to existing solutions our solutions eliminate the most complex per flow operations, since our solutions process the packets on per class basis. proposed Solutions are are evaluated using NS-2 Simulator