Main Reference PaperIntroducing Size-Oriented Dropping Policies as QoS-Supportive Functions, IEEE Transactions on Network Service Management, March 2010.
  • Proposed work mainly focuses on reallocating bandwidth and controls delay for flexible applications. The project provides an efficient service differentiation method called as Size oriented dropping policies. It uses the size of the packet for categorization process and formulates packet dropping probability.

+ Description
  • Proposed work mainly focuses on reallocating bandwidth and controls delay for flexible applications. The project provides an efficient service differentiation method called as Size oriented dropping policies. It uses the size of the packet for categorization process and formulates packet dropping probability.

  • To provide better service without increasing the management complexity of the Internet.

  • To prevent damage on basic properties such as resource sharing, utilization efficiency and system fairness.

  • To provide a new service principle called Less Impact Better Service (LIBS) and to enhance a novel scheme for packet dropping probability

+ Aim & Objectives
  • To provide better service without increasing the management complexity of the Internet.

  • To prevent damage on basic properties such as resource sharing, utilization efficiency and system fairness.

  • To provide a new service principle called Less Impact Better Service (LIBS) and to enhance a novel scheme for packet dropping probability

  • A Time Scheduling mechanism namely Fair Shortest Remaining Processing Time, was contributed which minimize the aggregate response time in the queue. They set different priority levels to withstand the traffic inside its buffer. They first service the fully deliverable packets inside the buffer. Hence all the data packets that were dropped are catched under the common buffer. Hence all the data packets in the buffer have to be serviced which delivers the best packet delivery ratio.

+ Contribution
  • A Time Scheduling mechanism namely Fair Shortest Remaining Processing Time, was contributed which minimize the aggregate response time in the queue. They set different priority levels to withstand the traffic inside its buffer. They first service the fully deliverable packets inside the buffer. Hence all the data packets that were dropped are catched under the common buffer. Hence all the data packets in the buffer have to be serviced which delivers the best packet delivery ratio.

  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

+ Software Tools & Technologies
  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.