0-1 knapsack problem approach for multicast agent in NEMO system

Rashid Saeed, Abdelmuizz Eisa, Raed Alsaqour

Research output: Contribution to journalArticle

Abstract

Multicast provides an effective group communication mechanism in IP layer to reduce the redundant packets transmission compared with the unicast. The knapsack problem is a problem in combinatorial optimization when we have given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. This paper discusses 0-1 Knapsack approach to use by NEMO's multicast agent (MA) to ensure the forwarding data to their destinations in combinational optimize selection manner, and acceptable throughput.

Original languageEnglish
Pages (from-to)411-417
Number of pages7
JournalInternational Journal of Engineering and Technology
Volume6
Issue number1
Publication statusPublished - 2014

Fingerprint

Combinatorial optimization
Throughput
Communication

Keywords

  • Knapsack problem
  • Mobile router
  • Multicast agent
  • Remote subscription
  • Tunneling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

0-1 knapsack problem approach for multicast agent in NEMO system. / Saeed, Rashid; Eisa, Abdelmuizz; Alsaqour, Raed.

In: International Journal of Engineering and Technology, Vol. 6, No. 1, 2014, p. 411-417.

Research output: Contribution to journalArticle

Saeed, Rashid ; Eisa, Abdelmuizz ; Alsaqour, Raed. / 0-1 knapsack problem approach for multicast agent in NEMO system. In: International Journal of Engineering and Technology. 2014 ; Vol. 6, No. 1. pp. 411-417.
@article{51f0ff8582f2402b9bcc5906ee760749,
title = "0-1 knapsack problem approach for multicast agent in NEMO system",
abstract = "Multicast provides an effective group communication mechanism in IP layer to reduce the redundant packets transmission compared with the unicast. The knapsack problem is a problem in combinatorial optimization when we have given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. This paper discusses 0-1 Knapsack approach to use by NEMO's multicast agent (MA) to ensure the forwarding data to their destinations in combinational optimize selection manner, and acceptable throughput.",
keywords = "Knapsack problem, Mobile router, Multicast agent, Remote subscription, Tunneling",
author = "Rashid Saeed and Abdelmuizz Eisa and Raed Alsaqour",
year = "2014",
language = "English",
volume = "6",
pages = "411--417",
journal = "International Journal of Engineering and Technology",
issn = "0975-4024",
publisher = "Engg Journals Publications",
number = "1",

}

TY - JOUR

T1 - 0-1 knapsack problem approach for multicast agent in NEMO system

AU - Saeed, Rashid

AU - Eisa, Abdelmuizz

AU - Alsaqour, Raed

PY - 2014

Y1 - 2014

N2 - Multicast provides an effective group communication mechanism in IP layer to reduce the redundant packets transmission compared with the unicast. The knapsack problem is a problem in combinatorial optimization when we have given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. This paper discusses 0-1 Knapsack approach to use by NEMO's multicast agent (MA) to ensure the forwarding data to their destinations in combinational optimize selection manner, and acceptable throughput.

AB - Multicast provides an effective group communication mechanism in IP layer to reduce the redundant packets transmission compared with the unicast. The knapsack problem is a problem in combinatorial optimization when we have given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. This paper discusses 0-1 Knapsack approach to use by NEMO's multicast agent (MA) to ensure the forwarding data to their destinations in combinational optimize selection manner, and acceptable throughput.

KW - Knapsack problem

KW - Mobile router

KW - Multicast agent

KW - Remote subscription

KW - Tunneling

UR - http://www.scopus.com/inward/record.url?scp=84899980302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899980302&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84899980302

VL - 6

SP - 411

EP - 417

JO - International Journal of Engineering and Technology

JF - International Journal of Engineering and Technology

SN - 0975-4024

IS - 1

ER -