Dr. Shekhar Verma Profile

Dr. Shekhar Verma

at IIITM

SPIE Involvement:

Author

Publications (2)

Proceedings Article | 8 August 2003 Paper

Polynomial time algorithm for hop constrained QoS routing

Shekhar Verma, Anil Saxena

Proceedings Volume 5245, (2003) https://doi.org/10.1117/12.511062

KEYWORDS: Computer simulations, Computer programming, Algorithm development, Staring arrays, Switches, Switching, Information technology, Internet, Detection and tracking algorithms, Multimedia

Read Abstract +

Proceedings Article | 1 July 2002 Paper

Routing in DiffServ multicast environment

Shekhar Verma

Proceedings Volume 4865, (2002) https://doi.org/10.1117/12.473397

KEYWORDS: Internet, Neural networks, Receivers, Computer programming, Data modeling, Evolutionary algorithms, Video, Information technology, Optimization (mathematics), Artificial neural networks

Read Abstract +

QOS aware applications have propelled the development of two complementary technologies, Multicasting and Differentiated Services. To provide the required QOS on the Internet, either the bandwidth needs to be increased (Multicasting) or limited bandwidth prioritized among users (DiffServ). Although, the bandwidth on the Internet is continually increasing, the backbone is still insufficient to support QOS without resource allocations. Hence, there is a need to map multicasting in a DiffServ Environment to conserve network bandwidth and to provision this bandwidth in an appropriate fashion. In this regard, two issues have to be addressed. One, the key difference between multicast and DiffServe routing is the structure of the multicast tree. This tree is maintained in multicast aware routers whereas in DiffServe, the core routers maintain no state information regarding the flows. Second, the task of restructuring the multicast tree when members join/leave. Currently, the first issue is addressed by embedding the multicast information within the packet itself as an additional header field. In this paper, we propose a neural network based heuristic approach to address the second problem of routing in a dynamic DiffServe Multicast environment. Many dynamic multicast routing algorithms have been proposed. The greedy algorithm creates a near optimal tree when a node is added but requires many query/reply messages. The PSPT algorithm cannot construct a cost optimal tree. The VTDM algorithm requires the estimated number of nodes that will join and is not flexible. The problem of building an optimal tree to satisfy QOS requirements at minimum cost and taking minimum network resources is NP- complete and none of the above solutions give an optimal solution. We have modeled this combinatorial optimization as a nonlinear programming problem and trained an artificial neural network to solve the problem. The problem is tractable only when the QOS parameters are combined into DiffServe classes because of the flows are short-liv

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Keywords/Phrases

Search In:

Publication Years