Browse Prior Art Database

Reducing Packet Network Data Flows

IP.com Disclosure Number: IPCOM000118856D
Original Publication Date: 1997-Aug-01
Included in the Prior Art Database: 2005-Apr-01
Document File: 1 page(s) / 36K

Publishing Venue

IBM

Related People

Banks, AD: AUTHOR [+2]

Abstract

In order to pass management data in datagram or packet-based networks, packets are transmitted to carry data other than that directly for the applications. It is desirable to minimize such data flows, thus, reducing network requirements, response times, and CPU load.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 65% of the total text.

Reducing Packet Network Data Flows

      In order to pass management data in datagram or packet-based
networks, packets are transmitted to carry data other than that
directly for the applications.  It is desirable to minimize such data
flows, thus,  reducing network requirements, response times, and CPU
load.

      In a datagram or packet-based network protocol, each layer
in the architecture responds with pacing, conformation of delivery,
syncpoint outcome, and server capacity data independently of the
other layers.  The improved described approach combines this data
into a single  response datagram.

The non-application data flowed in a packet based network may consist
of:
  o  Pacing data (PA)
  o  Packet acknowledgement (ACK)
  o  Syncpoint state (SP)
  o  Server viability and capacity (SRVR)

      Several payload packets and several pacing items and
acknowledgements will be required to complete transfer of a large
message so the flow of such a message might be:
                 Client                  Server
                 Send
                     -------(Payload1)------>
                     <----(PA,ACK,SRVR)-----
                                :
                                :
                     -------(PayloadN)------>
                     <----...