Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data transfer regulating
Reexamination Certificate
1998-09-28
2002-04-30
Rinehart, Mark H. (Department: 2152)
Electrical computers and digital processing systems: multicomput
Computer-to-computer protocol implementing
Computer-to-computer data transfer regulating
C370S320000
Reexamination Certificate
active
06381647
ABSTRACT:
TECHNICAL FIELD OF THE INVENTION
This invention relates generally to communication networks and more particularly to a method and system for scheduling network communication
BACKGROUND OF THE INVENTION
Communication devices such as telephones, computers, and video equipment may be interconnected to form a network. A network allows multiple parties to communicate with each other. Communications within a network often take the form of voice, data, video, or a combination of these forms. Such communications allow for meetings and presentations with participants separated by long distances. These events depend on the network to function as quickly and accurately as possible, in order to compensate for the distance of the participants.
A network may be formed by linking independent communication devices together according to a protocol. One example of a protocol for linking communication devices is Fibre Channel. In a Fibre Channel network, each device, acting as a node, or entry point onto the network, transmits and receives information through the network to the other network nodes. Although Fibre Channel networks may take various forms, a loop topology is often incorporated. In a loop topology, network nodes are connected in loop arrangement with any given node directly connected to only its two neighbors. In this manner, communication between all parties connected to the network is possible. One advantage of the some loop topologies is fault tolerance. In some implementations that utilize counter-rotational rings, if a break between nodes occurs, information may be routed back around the loop to its destination.
Information transmitted by the nodes travels around the loop until it reaches its destination. Traditionally, many Fibre Channel networks are configured to allow transmission of information by only one node at a given time. Thus, while any given node is transmitting information, all other nodes can only receive information. In addition traditional networking protocols do not specify the amount of time that this one node can transmit. Such communication schemes pose problems with the transmission of isochronous data that require the transfer of data at regular intervals such as live video and audio. A node that has live video to transfer is threatened with data loss if the network is currently servicing an unbounded transfer for another node. This problem is enhanced when the network has multiple sources of live isochronous data.
Such a problem may be addressed by periodically transmitting, around a network, a plurality of frames that include a plurality of slots for storing information. In such a system, it is desirable to be able to allocate priorities to the frames and to specify the time in which such frames are transmitted. Furthermore, it is also desirable to be able to specify a rate at which frames are transmitted.
SUMMARY OF THE INVENTION
Accordingly, a need has arisen for an improved method and system for network communication. The present invention provides a method and system for communication information in a network that addresses shortcomings of prior systems and methods.
According to one embodiment of the invention, a method for communicating information in a network having a plurality of nodes includes providing a frame for storing information. The frame has a frame type. The method also includes determining the type of the frame. In response to determining the frame type, scheduling transmission of the frame from a node in the network is scheduled. The method also includes transmitting the frame at the scheduled time.
According to another embodiment of the invention, an apparatus for scheduling periodic transmission of a plurality of frames in a network having a plurality of nodes, each frame having a type, includes a schedule memory and a sequencer. The schedule memory stores a transmission time for each frame type and a list of frames to be transmitted. The sequencer is operable to access the schedule memory and initiate transmission of the frames in the list.
Embodiments of the invention provide numerous technical advantages. For example, in one embodiment of the invention, a plurality of frames of data may be transmitted around a network at different periodic rates. Furthermore, these frames may be specified to carry different amounts of data. Such transmission provides an efficient method of communication because smaller frames may be used to carry smaller amounts of data and frames that are transmitted at a slower periodic rate may be used for data that does not require a faster rate of transmission. The invention also allows transmission of aperiodic frames when bandwidth is available which is also efficient.
Other technical advantages are readily apparent to one skilled in the art from the following figures, descriptions, and claims.
REFERENCES:
patent: 3924245 (1975-12-01), Eaton et al.
patent: 4482999 (1984-11-01), Janson et al.
patent: 4835770 (1989-05-01), Hayano
patent: 5257259 (1993-10-01), Tsurumi
patent: 5301185 (1994-04-01), Cherry
patent: 5303230 (1994-04-01), Hishida et al.
patent: 5305314 (1994-04-01), Edblad et al.
patent: 5317572 (1994-05-01), Satoh
patent: 5351243 (1994-09-01), Kalkunte et al.
patent: 5361372 (1994-11-01), Rege et al.
patent: 5375233 (1994-12-01), Kimber et al.
patent: 5428819 (1995-06-01), Wang et al.
patent: 5502719 (1996-03-01), Grant et al.
patent: 5519690 (1996-05-01), Suzuka et al.
patent: 5598541 (1997-01-01), Malladi
patent: 5602852 (1997-02-01), Shiobara
patent: 5610914 (1997-03-01), Yamada
patent: 5610921 (1997-03-01), Christensen
patent: 5621898 (1997-04-01), Wooten
patent: 5644761 (1997-07-01), Yoder et al.
patent: 5664224 (1997-09-01), Davis
patent: 5737743 (1998-04-01), Ooe et al.
patent: 5742847 (1998-04-01), Knoll et al.
patent: 5748629 (1998-05-01), Caldara et al.
patent: 5761430 (1998-06-01), Gross et al.
patent: 5768043 (1998-06-01), Nemazie et al.
patent: 5796720 (1998-08-01), Yoshida et al.
patent: 5805808 (1998-09-01), Hasani et al.
patent: 5828402 (1998-10-01), Collings
patent: 5835087 (1998-11-01), Herz et al.
patent: 5862136 (1999-01-01), Irwin
patent: 5896511 (1999-04-01), Manning et al.
patent: 5924112 (1999-07-01), Barber et al.
patent: 5938747 (1999-08-01), Young
patent: 5963982 (1999-10-01), Goldman
patent: 5978578 (1999-11-01), Azarya et al.
patent: 5983293 (1999-11-01), Murakami
patent: 5991847 (1999-11-01), Ballard et al.
patent: 5999634 (1999-12-01), Abbott et al.
patent: 6041060 (2000-03-01), Leichty et al.
patent: 6044091 (2000-03-01), Kim
patent: 6072832 (2000-06-01), Katto
patent: 6088337 (2000-07-01), Eastmond et al.
patent: 6266702 (2001-07-01), Darnell et al.
patent: 6317415 (2001-11-01), Darnell et al.
patent: 2 232 696 (1998-11-01), None
patent: 0 256 681 (1987-07-01), None
patent: 0 621 704 (1993-04-01), None
patent: 0 632 625 (1995-01-01), None
patent: 0 724 344 (1996-07-01), None
patent: 0 855 818 (1998-01-01), None
patent: 0 876 075 (1998-11-01), None
patent: 06 326721 (1995-03-01), None
Cavalier et al, Scheduling Transmission in Time-critical Distributed Systems, IEEE 1995.*
PCT International Search Report dated Jan. 26, 2001 for PCT/US99/21722 filed Oct. 21, 1999.
PCT International Search Report dated Mar. 10, 2000 for PCT/US99/21648 dated Sep. 21, 1999.
PCT International Search Report dated Mar. 02, 2000 for PCT/US99/21721 dated Sep. 21, 1999.
Lin Y-S, et al., “Queue Management for Shared Buffer and Shared Multi-Buffer ATM Switches” Proceedings of Infocom, US, Los Alamitos,IEEE Comp. Soc. Press., vol. Conf. 15 (pp 688-695), 1996.
“Protocol for Isochronous Traffic Over Fiber channel Switching”IBM Technical Disclosure Bulletin, US, IBM Corp. NY, vol. 37 No. 06B (pp 377-380) Jun. 1994.
Malavalli, “High Speed Fibre Channel Switching Fabric Services,” SPIE, vol. 1577 (pp 216-226) 1991.
PCT International Search Report dated Jan. 26, 2000 for PCT/US99/21714 filed Sep. 21, 1999.
PCT International Search Report dated Feb. 24, 2000 for PCT/US99/21722 filed Sep. 21, 1999.
Darnell B. Scott
Jennings William T.
Lengel Bradley D.
Reddy Praveen S.
Baker & Botts L.L.P.
Raytheon Company
Rinehart Mark H.
Vu Thong
LandOfFree
Method and system for scheduling network communication does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for scheduling network communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for scheduling network communication will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2901287