International Business Machines Corporation

Other

John G Dudley

Marc Adam Kaplan

Jeffrey Haskell Derby

Kenneth Harvey Potter, Jr

Marcia Lambert Peters

Israel Cidon

Roch A Guerin

John E Drake, Jr

Gerald Arnold Marin

Inder Sarat Gopal

Shay Kutten

Dinesh C Verma

Ronald Patrick Doyle

David Mark Ogle

Yongcheng Li

Mohammad Peyravian

Zon-Yin Shae

James Corvin Fletcher

Yih-Shin Tan

Brad Byer Topol

Kathryn Heninger Britton

James R Giles

Steven Dale Ims

Balan Subramanian

Andrew Hilliard Arrowood

Neeraj Joshi

James P Janniello

Allan K Edwards

Chee-Seng Chow

Owen H Choi

Theodore E Tedijanto

David William Davenport

Chandra Paul Immanuel

Francis R Koperda

Rachel A Bodner

Kaiwah Chan

Diane A Schuster

Embodiments of the present invention address deficiencies of the art in respect to administering and automating operations in a component based application and provide a method, system and computer program product for the pattern based administration of operations in a component based computing solution. In one embodiment of the invention, a composite application data processing system enabled for pattern based administration of an operation can include a dependency matrix model, a set of artifacts, each artifact associated with a particular action for a particular computing platform, and a pattern generated operation task control enabled to process an instance of the dependency matrix model through an invocation of selected ones of the artifacts.

Pattern based adminstration of an operation in a component based computing solution

A method, system and apparatus for autonomically configuring a virtual log. In accordance with the present invention, events flowing into the virtual log can be heuristically processed to determine if any events have been lost. When an event is considered to have been lost, the size of the log associated with the event can be increased. Also, the interval in which the virtual log interacts with the associated log can be decreased so as to ensure that the events will not continue to be lost. When a period of time has elapsed during which no events are heuristically determined to have been lost, either or both of the interval and associated log can be adjusted so as to increase the interval and decrease the size of the associated log.

Autonomic virtual log configuration

The present invention generally relates to a method, system and program product for distributing portal content processing. Specifically, a request for portal content is received on a surrogate system and then passed to a portal system. The portal system will obtain and aggregate a first type of the requested content, and then package the aggregated content into a response. The response will also include place holders that correspond to the remaining type of the requested content. The response will then be transmitted to the surrogate system, which will, based upon the place holders, obtain the remaining type of portal content. Once obtained, the remaining type of portal content will replace the place holders in the response, and the response will be rendered for the requesting portal user.

Method, system and program products for distributing portal content processing

An error recovery system and method for use in a data communication system in which a sender station transmits information packets with sequentially numbered information to a receiver station. The system includes selective retransmission of information packets which have had errors in transmission based on the order of transmission of information packets independent of the sequential (sequence) number of the information packets. A list, such as a linked list having a beginning and an end, is provided and, at the time of transmission of information packets, an identification of the transmitted information packet is placed at the end of the list. A status packet is provided by the receiver station to the sender station which identifies the sequential number of information packets which have been correctly received. Any information packets which have not been acknowledged as correctly received are retransmitted only if such packet was transmitted earlier in time than an information packet which has been acknowledged as correctly received as indicated by the position of the information packets in the list. The receiver station detects the presence of gaps and transmits a status packet to the sender station either responsive to a request from the sender station or responsive to detection of a gap.

Transmission order based selective repeat data transmission error

Method and apparatus for managing internal-node communications in a packet switching network by calculating optimal routes for packets and addressing subnodes within packet nodes using a specific message format. Internal communication facilities called intranode links connect multiple subnodes within nodes. Each subnode contains a switching mechanism and routes packet to other nodes, subnodes, or user applications using a specific message format. The message format allows specific subnodes anywhere in the network to the addressed by any other subnode, making communications more efficient and simplifying the management of internode links.

Packet switching resource management within nodes

A packet communications network in which multicast transmissions are made reliable by transmitting acknowledgements to all neighbors of every receiving node, including the source node. This allows the relinquishment of message holding buffers as soon as all near neighbors acknowledge receipt of the message after only tile longest round trip time to the nearest neighbors, rather than the round trip to the furthest destination. Moreover, highly reliable ancillary point-to-point transmission facilities can be used to retransmit multicast messages indicated as being lost by failure of acknowledgment. Finally, network partitions occurring during the multicast procedure do not necessarily lose the multicast message to the remote partitions since any node receiving the message can insure delivery to all other nodes in that partition.

Reliable multicasting over spanning trees in packet communications

Method and apparatus for making limited internal-node communication facilities externally visible in a packet switching network. Internal-node communication facilities are called intranode links, can include any cable, channel, bus, etc. over which data passes, and are used to connect the multiple subnodes within a given node. Each subnode contains a switching mechanism and routes packets to other nodes, subnodes, or user applications. Each node provides network control functions such as topology, directory, path selection, and bandwidth management which can manage intranode links in the same manner that internode links are currently managed.

A packet communications system provides for point-to-point packet routing and multicast packet routing to limited subsets of nodes in the network, using a routing field in the packet header which is processed according to two different protocols. A third protocol is provided in which a packet can be multicast to the limited subset even when launched from a node which is not a member of the subset. The routing field includes a first portion which contains the route labels necessary to deliver the packet to the multicast subset. A second portion of the routing field contains the multicast subset identifier which can then be used to deliver the packet to all of the members of the multicast subset. Provision is made to backtrack deliver the packet to the last node identified before the multicast subset if that last node is itself a member of the subset.

Methods and apparatus for routing packets in packet transmission networks

A method and apparatus of releasing resources allocated to terminated sessions at a secondary data processing node. A first node transmits one or more switch messages to a second node requesting the second node to redistribute sessions on a first route between the nodes among one or more alternate routes. Each switch message identifies the sessions to be switched and an alternate route to which the sessions are to be switched. The last switch message transmitted by the first node is indicated to be the last message in some appropriate way and includes a count of the total number of sessions that have been requested to be switched. The second node accumulates a count of the total number of sessions on the first route for which it has received a switch request. The second node compares its accumulated count with the total count derived from the last switch message and releases the resources allocated to all remaining sessions on the first route in the event the counts are equal.

Method of auditing primary and secondary node communication sessions

Growing community of inventors

Raleigh, NC, United States of America

John G Dudley