METHOD AND SYSTEM FOR RESILIENT PACKET TRACEBACK IN WIRELESSMESH AND SENSOR NETWORKS

    公开(公告)号:CA2672696A1

    公开(公告)日:2008-10-09

    申请号:CA2672696

    申请日:2008-03-19

    Applicant: IBM

    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.

    METHOD AND APPARATUS FOR GROUP COMMUNICATION WITH END-TO-ENDRELIABILITY

    公开(公告)号:CA2564363A1

    公开(公告)日:2005-11-17

    申请号:CA2564363

    申请日:2005-04-29

    Applicant: IBM

    Abstract: The present invention addresses scalability and end-to-end reliability in overlay multicast networks. A simple end-system multicast architecture (Fig. 3) that is both scalable in throughput and reliable in an end-to-end way is used. In this architecture, the transfers between nodes use TCP with backpressure mechanisms to provide data packet transfers between intermediat e nodes (16) having finite-size forwarding buffers (22). There is also a finite~size backup buffer (24) in each node to store copies of packets which are copied out from the receiver window (20) to the forwarding buffers (22). These backup buffers (24) are used when TCP connections are re-established t o supply copies of data packets for the children nodes (18) after their parent node fails, maintaining a complete sequence of data packets to all nodes within the multicast overlay network. The architecture provides end-to-end reliability, tolerates multiple simultaneous node failures and provides positive throughput for any group size and any buffer size.

    APPARATUS AND METHODS FOR CLASSIFICATION OF WEB SITES

    公开(公告)号:AU2003296756A1

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

    申请号:AU2003296756

    申请日:2003-11-14

    Applicant: IBM

    Abstract: Apparatus and methods for classifying web sites are provided. With the apparatus and methods, traffic data is obtained for a plurality of web sites. This patterns, or templates, for each web site are generated based on this traffic data and the patterns are clustered into classes of web sites using a clustering algorithm. The clusters, or classes, are then profiled to generate a template for each class. The template for each class is generated by first shifting the patterns for each web site that is part of the class to compensate for effects like time zone differences, if any, and then identifying a pattern that is most similar to all of the patterns in the class. Once the template for each class is generated, this template is then used with traffic data from a new web site to classify the new web site into one of the existing classes. In other words, when traffic data for a new web site is received, a pattern for the traffic data of the new web site is generated and compared to the templates for the various classes. If a matching class template is identified, the new web site is classified into the corresponding class. If the pattern for the new web site does not match any of the existing templates, a new template and class may be generated based on the pattern for the new web site.

    APPARATUS AND METHODS FOR CO-LOCATION AND OFFLOADING OF WEB SITE TRAFFIC BASED ON TRAFFIC PATTERN RECOGNITION

    公开(公告)号:CA2508047A1

    公开(公告)日:2004-06-24

    申请号:CA2508047

    申请日:2003-11-14

    Applicant: IBM

    Abstract: Apparatus and methods for identifying traffic patterns to web sites based on templates that characterize the arrival of traffic to the web sites are provided. Based on these templates, determinations are made as to which web sites should be co-located so as to optimize resource allocation. Specifically, 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 tl, are designated as being candidat es for co-location. In addition, the present invention uses the templates identified for the traffic patterns of web sites 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 thi rd threshold that takes into consideration a lag time needed to stop all offloading of traffic to the other servers.

    METHOD AND APPARATUS FOR GROUP COMMUNICATION WITH END-TO-END RELIABILITY

    公开(公告)号:CA2564363C

    公开(公告)日:2010-07-20

    申请号:CA2564363

    申请日:2005-04-29

    Applicant: IBM

    Abstract: The present invention addresses scalability and end-to-end reliability in overlay multicast networks. A simple end-system multicast architecture (Fig. 3) that is both scalable in throughput and reliable in an end-to-end way is used. In this architecture, the transfers between nodes use TCP with backpressure mechanisms to provide data packet transfers between intermediate nodes (16) having finite-size forwarding buffers (22). There is also a finite~size backup buffer (24) in each node to store copies of packets which are copied out from the receiver window (20) to the forwarding buffers (22). These backup buffers (24) are used when TCP connections are re-established to supply copies of data packets for the children nodes (18) after their parent node fails, maintaining a complete sequence of data packets to all nodes within the multicast overlay network. The architecture provides end-to-end reliability, tolerates multiple simultaneous node failures and provides positive throughput for any group size and any buffer size.

    ROUTING IN WIRELESS AD-HOC NETWORKS

    公开(公告)号:AU2003259183A1

    公开(公告)日:2004-11-23

    申请号:AU2003259183

    申请日:2003-07-21

    Applicant: IBM

    Abstract: Efficient routing techniques that meet performance objectives associated with an ad-hoc network environment and the like. More specifically, the invention provides a routing methodology proven to provide high (e.g., close-to-optimal) throughput and low delay guarantees. Further, the present invention preferably considers a network with both static and mobile nodes. The mobile nodes preferably follow a particular model of movement, referred to herein as a mobility model.

Patent Agency Ranking