Method and apparatus for non contiguous sliding window
First Claim
Patent Images
1. A method, comprising:
- regulating a flow of sequentially addressed data across a network between a source node and a destination node by limiting the number of units of said data traversing said network to a set called a window such that units are added to said window because their transmission by said source is desired;
units are removed from said window because they have arrived at said destination;
units are removed from said window because they are declared to have been lost;
the total number of units within said window is no higher than by said limiting number of units of said data traversing said network;
the difference between the smallest address whose corresponding unit is contained within said window, and the largest address whose corresponding unit is contained within said window, is unbounded; and
, units are allowed to be noncontiguous.
0 Assignments
0 Petitions
Accused Products
Abstract
A method that limits data flow between two network nodes to an amount within a window where a first portion of data within a first segment of the window is separated from a second portion of data within a second segment of the window by a third portion of data not within the window.
-
Citations
25 Claims
-
1. A method, comprising:
regulating a flow of sequentially addressed data across a network between a source node and a destination node by limiting the number of units of said data traversing said network to a set called a window such that units are added to said window because their transmission by said source is desired;
units are removed from said window because they have arrived at said destination;
units are removed from said window because they are declared to have been lost;
the total number of units within said window is no higher than by said limiting number of units of said data traversing said network;
the difference between the smallest address whose corresponding unit is contained within said window, and the largest address whose corresponding unit is contained within said window, is unbounded; and
,units are allowed to be noncontiguous. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
16. A method that controls the transportation of an amount of data over a network, wherein, when said amount of data is viewed as being contiguous, such that a next piece of said amount of data is adjacent to a piece of said amount of data from the perspective of said piece of said amount of data, a window that is viewed as being superimposed upon said amount of data defines a specific portion of said amount data based upon a size of said window and a positioning of said window, said method comprising:
-
allowing non contiguous portions of said amount of data to be in transit over said network such that;
a first portion of said amount of data that is allowed to be in transit within said network can be viewed as being defined by a first window;
a second portion of said amount of data that is allowed to be in transit within said network can be viewed as being defined by a second window, wherein said first and second windows can be viewed as being superimposed upon said amount of data such that a third portion of said amount of data that is not in transit within said network exists between said first window and said second window, said second portion having a next piece of said amount of data from the perspective of a piece of said amount of data that is within said third portion; and
wherein;
1) if;
said next piece from the perspective of said piece within said third portion arrives at its destination causing said third portion to expand;
2) then;
a next piece of said amount data from the perspective of said second portion is allowed to be in transit within said network causing said second window to slide. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25)
-
Specification