About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
2nd International IEEE Conference on Communication System Software and Middleware

Research Article

Controlled Dissemination Filter (CDF) for Integrated Link Selection Agents

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1109/COMSWA.2007.382584,
        author={Mariusz  A. Fecko and Ibrahim  Hokelek and Sunil Samtani and Aristides Staikosb},
        title={Controlled Dissemination Filter (CDF) for Integrated Link Selection Agents},
        proceedings={2nd International IEEE Conference on Communication System Software and Middleware},
        publisher={IEEE},
        proceedings_a={COMSWARE},
        year={2007},
        month={7},
        keywords={Bandwidth  Decision making  Distributed algorithms  Information filtering  Information filters  Polynomials  Resource management  Robustness  Routing  Unicast},
        doi={10.1109/COMSWA.2007.382584}
    }
    
  • Mariusz A. Fecko
    Ibrahim Hokelek
    Sunil Samtani
    Aristides Staikosb
    Year: 2007
    Controlled Dissemination Filter (CDF) for Integrated Link Selection Agents
    COMSWARE
    IEEE
    DOI: 10.1109/COMSWA.2007.382584
Mariusz A. Fecko1,*, Ibrahim Hokelek1,*, Sunil Samtani1,*, Aristides Staikosb2,*
  • 1: Applied Research, Telcordia Technologies, Inc. Piscataway, NJ 08854, USA
  • 2: U.S. Army CERDEC Fort Monmouth, NJ 07703, USA
*Contact email: mfecko@research.telcordia.com, ihokelek@research.telcordia.com, ssamtani@research.telcordia.com, Aristides.Staikos@us.army.mil

Abstract

To perform optimizations as the network changes dynamically, distributed network agents rely on information that is dispersed in the network. A data dissemination service for the agents can benefit from data filtering at selected nodes in a data distribution tree. Controlled dissemination filter (CDF) offers an efficient filtering functionality such as sifting, collection, aggregation, and scoping. We defined a number of new objective functions for the data-flow channelization algorithms, and created both centralized and distributed algorithms to optimize filter placement in polynomial time. We also designed an application of the CDF to information flows relevant to the unicast routing control agent (URCA) and showed how the CDF reduces the bandwidth consumed by data dissemination without impairing the URCA decision-making functionalities.

Keywords
Bandwidth Decision making Distributed algorithms Information filtering Information filters Polynomials Resource management Robustness Routing Unicast
Published
2007-07-09
Publisher
IEEE
Modified
2011-07-24
http://dx.doi.org/10.1109/COMSWA.2007.382584
Copyright © 2007–2025 IEEE
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL