The Distributed Evolutionary Algorithm (DEA) presented in this paper produces efficient TDMA schedules for communication in an environment of changing network topology by passing topological and traffic information among nodes communicating on the schedule. As information is gained in this way moore nodes are added to the communicating group until the entire network is communicating on a common schedule. The key feature of the DEA presented is that the reorganization phase is fast, requiring a number of TDMA slots only on the order of the number of nodes. A secondary feature is that some network communication can take place, and thus some of the traffic requirements can be satisfied, even while the network is being reorganized. Numerical results are presented for a number of randomly generated networks which show how the algorithm performs.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    A distributed evolutionary algorithm for reorganizing network communications


    Weitere Titelangaben:

    Ein verteilter, erweiterter Algorithmus zur Reorganisierung von Kommunikationsnetzen


    Beteiligte:
    Post, M.J. (Autor:in) / Kershenbaum, A.S. (Autor:in) / Sarachik, P.E. (Autor:in)


    Erscheinungsdatum :

    1985


    Format / Umfang :

    7 Seiten, 3 Bilder, 7 Quellen


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    Reorganizing for Tomorrow

    Schill, A. J. / National Research Council; Transportation Research Board / American Public Transit Association | British Library Conference Proceedings | 1995


    Reorganizing for product development:Hondas case

    Muffatto,M. / Univ.di Padua,Dip.di Innovazione Meccanica e Gestionale,IT | Kraftfahrwesen | 1996



    A self-reorganizing digital flight control system for aircraft

    MONTGOMERY, R. / CAGLAYAN, A. | AIAA | 1974