1999
DOI: 10.1109/69.755631
|View full text |Cite
|
Sign up to set email alerts
|

Information survivability for evolvable and adaptable real-time command and control systems

Abstract: MITRE's Evolvable Real-Time C3 (Command, Control, and Communications) project has developed an approach that would enable current real-time systems to evolve into the systems of the future. This paper first summarizes the design and implementation of an infrastructure for an evolvable real-time C3 system. Then, a detailed discussion of the infrastructure requirements for a survivable real-time C3 system is presented. Finally security issues for survivability, as well as open implementation of the infrastructur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(9 citation statements)
references
References 4 publications
0
8
0
Order By: Relevance
“…We need to incorporate security into this research. For a discussion of integrating security and real-time processing for command and control systems we refer to [31].…”
Section: Quality Of Service For Multimedia Data Management Systemsmentioning
confidence: 99%
“…We need to incorporate security into this research. For a discussion of integrating security and real-time processing for command and control systems we refer to [31].…”
Section: Quality Of Service For Multimedia Data Management Systemsmentioning
confidence: 99%
“…We used object technology for integrating the various components. We also showed how such an infrastructure could be used to migrate legacy applications (see [3], [25]). …”
Section: Secure Dependable Information Managementmentioning
confidence: 99%
“…H 4 is visited twice but H 1 is selected as the parent since H 4 is visited from H 1 first and there is no need for adjustment when it is visited the second time. From the clusters nearest to S, the clusters that are two hops away from S, including H 10 , H 11 , H 12 , H 13 , H 14 , and H 15 , are visited. Finally, the nodes that are further away from S are visited.…”
Section: A Heuristic Algorithm For the Oirspmentioning
confidence: 99%