公开(公告)号：WO2005104176A2

公开(公告)日：2005-11-03

申请号：PCT/US2005013716

申请日：2005-04-22

Applicant: IBM ,  LIU ZHEN ,  SAHU SAMBIT ,  SILBER JEREMY I

Inventor： LIU ZHEN ,  SAHU SAMBIT ,  SILBER JEREMY I

IPC: G06F15/16 ,  H01J49/00 ,  H04J3/06 ,  H04L12/24 ,  H04L29/06

CPC classification number: H04L41/0654 ,  H04L45/00 ,  H04L67/2842 ,  H04L67/2852 ,  H04L69/16 ,  H04L69/163 ,  H04L69/165 ,  H04L69/40

Abstract: In one embodiment, the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a marker is introduced into the data stream, e.g., at the sending node, and allows, in turn, forwarding nodes and/or receivers to efficiently track data stream reception. The marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver. Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application. Thus, if a forwarding node fails, the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.

Abstract translation: 在一个实施例中，本发明是用于在计算机网络上进行数据故障恢复转发的方法和装置。 在一个实施例中，标记被引入数据流，例如在发送节点，并且允许转发节点和/或接收器来有效地跟踪数据流接收。 标记用作数据传输过程的检查点，并在每个转发节点和接收器处被识别和索引。 每个接收器在将数据传送到应用程序之前保存标记，从而指定数据流中的所有先前数据被确认已被递送到应用的点。 因此，如果转发节点发生故障，则接收方可以通过指定备用转发节点从标记开始提供数据来从备用转发节点请求流数据。

公开(公告)号：AT400950T

公开(公告)日：2008-07-15

申请号：AT02808336

申请日：2002-12-20

Applicant: IBM

Inventor： LIU ZHEN ,  SANKAR ARVIND

IPC: H04L12/56

公开(公告)号：AU2002357353A1

公开(公告)日：2004-07-22

申请号：AU2002357353

申请日：2002-12-20

Applicant: IBM

Inventor： LIU ZHEN ,  SANKAR ARVIND

IPC: H04L12/56

公开(公告)号：AU2003292269A1

公开(公告)日：2004-06-30

申请号：AU2003292269

申请日：2003-11-14

Applicant: IBM

Inventor： DIAS DANIEL MANUEL ,  LIU ZHEN ,  SQUILLANTE MARK STEVEN ,  XIA HONGHUI ,  YU SHUNG-ZHENG ,  ZHANG LI ,  KING RICHARD PERVIN

IPC: H04L12/24 ,  H04L12/56 ,  H04L29/06 ,  H04L29/08

Abstract: Identifying traffic patterns to web sites based on templates that characterize the arrival of traffic to the web sites is provided. Based on these templates, determinations are made as to which web sites should be co-located so as to optimize resource allocation. Web sites whose templates are complimentary, i.e. a first web site having a peak in arrival traffic at time t1 and a second web site that has a trough in arrival traffic at time t1, are designated as being candidates for co-location. In addition, the templates identified for the traffic patterns of web sites are used to determine thresholds for offloading traffic to other servers. These thresholds include a first threshold at which offloading should be performed, a second threshold that takes into consideration the lead time needed to begin offloading, and a third threshold that takes into consideration a lag time needed to stop offloading of traffic.

公开(公告)号：DE102021129175A1

公开(公告)日：2022-12-22

申请号：DE102021129175

申请日：2021-11-10

Applicant: IBM

Inventor： LIU ZHEN ,  ZHANG MING LEI ,  ZHONG JIA TIAN ,  CHANG LE ,  ZHAN TING TING ,  TIAN XIAO YAN

IPC: G06F8/40

Abstract: Es wird ein Verfahren bereitgestellt, um festzustellen, dass ein Datenspeicher für ein Programm nicht ausreicht. Ein Prozessor kann einen Satz von markierten Daten empfangen, die einem Satz von Quellcode zugehörig sind. Der Prozessor kann einen Bereich des Codes ermitteln, dem die markierten Daten zugehörig sind. Der Prozessor kann einen ersten Satz von Anweisungen erzeugen, um eine erste Momentaufnahme eines variablen Speicherplatzes beim Eintreten in den Bereich und eine zweite Momentaufnahme des variablen Speicherplatzes beim Verlassen des Bereichs zu erstellen. Der Prozessor kann einen zweiten Satz von Anweisungen zum Vergleichen der ersten und der zweiten Momentaufnahme erzeugen, um eine Nutzungsmenge des variablen Speicherplatzes zu ermitteln. Der Prozessor kann einen dritten Satz von Anweisungen erzeugen, um als Reaktion darauf, dass die Nutzungsmenge des variablen Speicherplatzes einen Schwellenwert überschreitet, eine Aktion auszuführen. Der Prozessor kann den Code in eine ausführbare Datei kompilieren.

公开(公告)号：DE102021128521A1

公开(公告)日：2022-06-09

申请号：DE102021128521

申请日：2021-11-03

Applicant: IBM

Inventor： LIU ZHEN ,  ZHONG JIA TIAN ,  CHANG LE ,  ZHANG MING LEI ,  ZHAN TING TING ,  TIAN XIAO YAN

IPC: G06F11/36 ,  G06F8/70

Abstract: Quellcode einer goldenen Version und einer nächsten Version eines Programms, in dem Prozeduraufrufe so modifiziert werden, dass sie aus einer Eingangspunkttabelle (EPT) mit Indexnummern aufrufen, die Prozedurspeicheradressen entsprechen, wird empfangen. Ein ausführbares defektfreies Programm der goldenen Version und ein Programm der nächsten Version mit einem Defekt werden empfangen. Eine erste Eingangspunkttabelle (erste EPT) für das Programm der neuen Version und eine zweite EPT für das Programm der goldenen Version werden erzeugt. Eine Reihe von Ersetzungen von Prozeduren aus der zweiten EPT in der ersten EPT wird durchgeführt, und eine Ersetzungsreihenfolge umfasst: einen Modulsatz, ein Modul des Modulsatzes, einen Prozedursatz des Moduls und eine Prozedur des Prozedursatzes. Die Prozedur zum Erzeugen eines Defekts wird durch Ersetzen der Reihenfolge nach identifiziert, bis der Defekt nicht mehr vorhanden ist, und anschließend wird in der Reihenfolge mit dem nächsten Ersetzen fortgefahren.

公开(公告)号：CA2508051C

公开(公告)日：2009-06-30

申请号：CA2508051

申请日：2002-12-20

Applicant: IBM

Inventor： LIU ZHEN ,  SANKAR ARVIND

IPC: H04L12/56

Abstract: Routing techniques are provided that meet performance objectives associated with an ad-hoc network environment and the like. The techniques of invention serve to substantially maximize the lifetime of the network. In one aspect o f the invention, a packet routing technique for use in a node of a distributed network comprises the following steps/operations. Queues for storing packets are maintained, wherein at least one queue is associated with a link existin g between the node and a neighboring node, and a queue has a height associated therewith. A route is then determined for one or more packets stored in the queues based on heights of queues at neighboring nodes, such that energy constraints associated with the node and the neighboring nodes are substantially maximized. As mentioned, the distributed network is preferably a mobile ad-hoc network wherein the node and the at least one neighboring node communicate over a wireless link.

公开(公告)号：CA2508051A1

公开(公告)日：2004-07-15

申请号：CA2508051

申请日：2002-12-20

Applicant: IBM

Inventor： SANKAR ARVIND ,  LIU ZHEN

IPC: H04L12/56

Abstract: Routing techniques are provided that meet performance objectives associated with an ad-hoc network environment and the like. The techniques of invention serve to substantially maximize the lifetime of the network. In one aspect o f the invention, a packet routing technique for use in a node of a distributed network comprises the following steps/operations. Queues for storing packets are maintained, wherein at least one queue is associated with a link existin g between the node and a neighboring node, and a queue has a height associated therewith. A route is then determined for one or more packets stored in the queues based on heights of queues at neighboring nodes, such that energy constraints associated with the node and the neighboring nodes are substantially maximized. As mentioned, the distributed network is preferably a mobile ad-hoc network wherein the node and the at least one neighboring node communicate over a wireless link.

公开(公告)号：BRPI0808619A2

公开(公告)日：2014-08-12

申请号：BRPI0808619

申请日：2008-03-19

Applicant: IBM

Inventor： LIU ZHEN ,  YANG HAO ,  YE FAN

IPC: H04L29/06 ,  H04L12/22

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.

公开(公告)号：AT511295T

公开(公告)日：2011-06-15

申请号：AT08718046

申请日：2008-03-19

Applicant: IBM

Inventor： LIU ZHEN ,  YANG HAO ,  YE FAN

IPC: H04L29/06 ,  H04L12/22

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.