Abstract:
A system and method for packet traceback in a network includes maintaining an identity number (ID) for each node in a network and generating a signature (e.g., a message authentication code (MAC)) using a secret key shared between each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deterministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the reverse order by which these signatures were appended. A last valid MAC is determined in the forwarding path to determine the locations of compromised nodes that collude in false data injection attacks.
Abstract:
A system and method for packet traceback in a network includes maintaining an identity number (ID) for each node in a network and generating a signature (e.g., a message authentication code (MAC)) using a secret key shared between each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deterministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the reverse order by which these signatures were appended. A last valid MAC is determined in the forwarding path to determine the locations of compromised nodes that collude in false data injection attacks.
Abstract:
Methods and systems are provided for identifying and allocating resources disposed within a plurality of distributed and autonomous computing systems, each of which may have its own legacy resource discovery service. Resource identification servers disposed within each one of the distributed computing systems communicate resource attribute data to a tree hierarchy of dedicated servers. The resource attribute data are maintained in native formats within the distributed computing systems and are mapped to a common format provided by the dedicated servers. The resource attribute data are aggregated at each node within the tree hierarchy, communicated up through the tree hierarchy to one or more root nodes and replicated down through all of the nodes. Additional system robustness is provided through period resource checks and resource attribute data updates. Resource allocation queries are submitted to any level node within the hierarchy and forwarded to the proper computing system for processing.
Abstract:
A system and method for packet traceback in a network includes maintaining an identity number (ID) for each node in a network and generating a signature (e.g., a message authentication code (MAC)) using a secret key shared between each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deterministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the reverse order by which these signatures were appended. A last valid MAC is determined in the forwarding path to determine the locations of compromised nodes that collude in false data injection attacks.
Abstract:
A system and method for packet traceback in a network includes maintaining an identity number (ID) for each node in a network and generating a signature (e.g., a message authentication code (MAC)) using a secret key shared between each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deterministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the reverse order by which these signatures were appended. A last valid MAC is determined in the forwarding path to determine the locations of compromised nodes that collude in false data injection attacks.
Abstract:
A system and method for packet traceback in a network includes maintainin g an identity number (ID) for each node in a network and generating a signat ure (e.g., a message authentication code (MAC)) using a secret key shared be tween each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deter ministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the rev erse order by which these signatures were appended. A last valid MAC is dete rmined in the forwarding path to determine the locations of compromised node s that collude in false data injection attacks.
Abstract:
Techniques for transmitting data according to at least one quality of service requirement. A message path is calculated specifying a sequence of broker computers selected from a network of interconnected broker computers. The message path is statistically estimated to fulfill the at least one quality of service requirement. Quality of service metrics are received about the network of interconnected broker computers. If the message path is determined not to fulfill the quality of service requirement, a new message path is calculated specifying a new sequence of broker computers selected from the network of interconnected broker computers. The new message path is statistically estimated to fulfill the at least one quality of service requirement.
Abstract:
Verfahren zur Erkennung der Rahmengrenze eines in der Vorwärtsfehlerkorrekturschicht (Forward Error Correction (FEC) layer) im Ethernet empfangenen Datenstroms, wobei das Verfahren Folgendes umfasst: Abtrennen von Daten mit der Länge eines Rahmens vom Datenstrom; Durchführen einer Gültigkeitsprüfung der FEC-Prüfung für die Daten mit der Länge eines Rahmens von der Startposition der Daten mit der Länge eines Rahmens; falls die FEC-Prüfung für die Daten mit der Länge eines Rahmens nicht korrekt ist, Annehmen der vom nächsten Bit der Endposition der Daten mit der Länge eines Rahmens um sbn Bit weitergesprungenen Datenstromposition als Startposition des nächsten abzutrennenden Datenrahmens, wobei sbn eine ganze Zahl ist, die größer als die Pipeline-Verzögerung der Hardware-Schaltung in der FEC-Schicht im Ethernet und teilerfremd mit der Länge des Rahmens ist. Zurückkehren zum Abtrennschritt; falls die FEC-Prüfung für die Daten mit der Länge eines Rahmens korrekt ist, Festlegen der Startposition der aktuellen Daten mit der Länge eines Rahmens als Rahmengrenzenposition des Datenstroms.
Abstract:
Die vorliegende Erfindung offenbart ein Verfahren und ein System zur Erkennung der Rahmengrenze eines in der Vorwärtsfehlerkorrekturschicht im Ethernet empfangenen Datenstroms. Das Verfahren umfasst Folgendes: Abtrennen von Daten mit der Länge eines Rahmens vom Datenstrom; Gültigkeitsprüfung der FEC-Prüfung für die Daten mit der Länge eines Rahmens von der Startposition der Daten mit der Länge eines Rahmens; falls die FEC-Prüfung für die Daten mit der Länge eines Rahmens nicht korrekt ist, Annehmen der vom nächsten Bit der Endposition der Daten mit der Länge eines Rahmens um sbn Bit weitergesprungenen Datenstromposition als Startposition des nächsten abzutrennenden Datenrahmens, wobei sbn eine ganze Zahl ist, die größer als die Pipeline-Verzögerung der Hardware-Schaltung und teilerfremd mit der Länge des Rahmen ist; Zurückkehren zum Abtrennschritt; falls die FEC-Prüfung für die Daten mit der Länge eines Rahmens korrekt ist, wird die Startposition der Daten mit der Länge eines Rahmens als Rahmengrenzenposition des Datenstroms festgelegt. Die vorliegende Erfindung kann die Geschwindigkeit der Rahmengrenzenerkennung und die Geschwindigkeit der Rahmensynchronisation erhöhen, ohne den Hardware-Aufwand zu vergrößern.