WikiPatents - Community Patent Review
Create Free Account  |  License or Sell Your Patent  |  WikiPatents Marketplace  |  WikiPatents Blog
Username:  Password:  
    
Advanced Search
Dynamic allocation of B-channels in ISDN    
United States Patent5574861   
Link to this pagehttp://www.wikipatents.com/5574861.html
Inventor(s)Lorvig; Don (5 Manor Pkwy., Salem, NH 03079); Lew; Paul (5 Manor Pkwy., Salem, NH 03079); Cummings; Paul (53 Lawndale St., Belmont, MA 02178)
AbstractAn implementation of an ISDN router enables computers interconnected to each other and to the ISDN to share resources by issuing operating system commands. One computer can access a storage disk or other resource of another computer distributed at any terminal location on the ISDN. Each disk on the Network has a unique name by which it is accessed. The configuration of the Network and number of computers distributed on it are transparent to each user. To improve bandwidth utilization of the ISDN line while sharing terminal resources, a B-channel allocation algorithm executed by routers between the terminals and the ISDN line dynamically allocates bandwidth by monitoring traffic at each destination queue and in response allocating or deallocating virtual B-channels. Bandwidth utilization is optimized by packaging data packets into trains that are transmitted to the destination when the train is completed and upon satisfaction of other conditions. Each train undergoes data compression by execution of a suitable compression algorithm.
   














 Title Information Submit all comments and votes
 
Patent Text Patent PDF Print Page Summary File History
Plain text PDF images Print Summary File History
Drawing from US Patent 5574861
Dynamic allocation of B-channels in ISDN - US Patent 5574861 Drawing
Dynamic allocation of B-channels in ISDN
Inventor     Lorvig; Don (5 Manor Pkwy., Salem, NH 03079); Lew; Paul (5 Manor Pkwy., Salem, NH 03079); Cummings; Paul (53 Lawndale St., Belmont, MA 02178)
Owner/Assignee    
Patent assignment
All assignments
Publication Date     November 12, 1996
Application Number     08/539,251
PAIR File History     Application Data   Transaction History
Image File Wrapper   Patent Term   Fees
Litigation
Filing Date     October 5, 1995
US Classification     709/226 370/410 370/524 709/229 709/236 709/241 709/243 709/247
Int'l Classification     H01J 013/00 H04J 003/12 H04J 003/24
Examiner     Bowler; Alyssa H.
Assistant Examiner     Malyala; Krishna
Attorney/Law Firm     Lowe, Price, LeBlanc & Becker
Address
Parent Case     This application is a continuation of application Ser. No. 08/094,114 filed Jul. 30, 1993, now abandoned.
Priority Data    
USPTO Field of Search     370/60 370/60.1 370/94.1 370/13 370/16 395/200.13 395/200.17 395/200.2
Patent Tags     dynamic allocation b-channels isdn
   
Enter a comma (,) or semicolon (;) between multiple tag words/phrases.
Describe this patent:
 Amusing   
 Clever   
 Complex   
 Efficient   
 Historic   
 Important   
 Innovative   
 Interesting   
 Practical   
 Simple   
[no votes]
Patent WIKI

Share information and news about this patent, including information and news about the technology, inventors, company, ligation and licensing.

 References Submit all comments and votes
 
*references marked with an asterisk below are user-added references
 U.S. References
 
Add a new US reference:  
ReferenceRelevancyCommentsReferenceRelevancyComments
5479407
Ko
370/231
Dec,1995

[0 after 0 votes]
5463629
Ko
370/463
Oct,1995

[0 after 0 votes]
5444703
Gagliardi
370/401
Aug,1995

[0 after 0 votes]
5442630
Gagliardi
370/402
Aug,1995

[0 after 0 votes]
5327428
Van As
370/353
Jul,1994

[0 after 0 votes]
5317562
Nardin
370/428
May,1994

[0 after 0 votes]
5313454
Bustini
370/231
May,1994

[0 after 0 votes]
5224099
Corbalis
370/412
Jun,1993

[0 after 0 votes]
5208811
Kashio
370/401
May,1993

[0 after 0 votes]
5184348
Abdelmouttalib
370/431
Feb,1993

[0 after 0 votes]
5164938
Jurkevich
370/231
Nov,1992

[0 after 0 votes]
5081671
Raith

Jan,1992

[0 after 0 votes]
5014265
Hahne
370/236
May,1991

[0 after 0 votes]
4996685
Farese
370/352
Feb,1991

[0 after 0 votes]
4993017
Bachinger

Feb,1991

[0 after 0 votes]
4972183
Kuhlmann
340/825.22
Nov,1990

[0 after 0 votes]
4965790
Nishino
370/437
Oct,1990

[0 after 0 votes]
4930123
Shimizu
370/389
May,1990

[0 after 0 votes]
4885739
Read
370/384
Dec,1989

[0 after 0 votes]
4866703
Black
370/352
Sep,1989

[0 after 0 votes]
4821264
Kim
370/434
Apr,1989

[0 after 0 votes]
4821265
Albal
370/469
Apr,1989

[0 after 0 votes]
4805167
Leslie
370/540
Feb,1989

[0 after 0 votes]
4789981
Yanosy, Jr.
370/271
Dec,1988

[0 after 0 votes]
4700341
Huang
370/471
Oct,1987

[0 after 0 votes]
4663748
Karbowiak
370/224
May,1987

[0 after 0 votes]
5282202
Bernstein
370/468
Dec,1969

[0 after 0 votes]
 Foreign References
 Other References
 Market Review Submit all comments and votes
   
Market Size
Estimate the gross annual revenues of the relevant market sector:
> $10B
$5B - $10B
$2B - $5B
$500M - $2B
$100M - $500M
$10M - $100M
$1M - $10M
$500K - $1M
$100K - $500K
< $100K
[No votes]
$0
 
$0   $2.5B   $5B   $7.5B   $10B
Market Share
Estimate the percentage of the relevant market sector this invention will capture:
75% - 100%
50% - 74.99%
25% - 49.99%
10 - 24.99%
5 - 9.99%
2 - 4.99%
1 - 1.99%
< 1%
[No votes]
0.0%
 
0%   25%   50%   75%   100%
Reasonable Royalty
What percentage of gross sales should the inventor or assignee be paid?
75% - 100%
50% - 74.99%
25% - 49.99%
10 - 24.99%
5 - 9.99%
2 - 4.99%
1 - 1.99%
< 1%
[No votes]
0.0%
 
0%   25%   50%   75%   100%
Public's "Guesstimation" of Royalty Value
Market SizeN/A[No votes]
xMarket ShareN/A[No votes]
xReasonable RoyaltyN/A[No votes]

N/A

License Availablity
If you are NOT the owner or assignee, answer here:
Yes, license is available for purchase

No, license is not currently available



[No votes]
License Availablity
If you ARE the owner or assignee, answer here:
Yes, license is available for purchase

No, license is not currently available



[No votes]
Competitive Advantage
Does this invention have a significant competitive advantage over similar technologies?
Yes

No



[No votes]
Most helpful competitive advantage comment
[No comments]

Commercial Alternatives
Are there viable commercial alternatives for this invention?
Yes

No



[No votes]
Most helpful commercial alternative comment
[No comments]

 Technical Review Submit all comments and votes
 Claims Submit all comments and votes
 


We claim:

1. A network, comprising:

a plurality of computers having a common operating system;

means for interfacing said computers to a common ISDN line;

means for transmitting on said common ISDN line an operating system command globally to all of said computers;

means for detecting on said ISDN line a queue of messages destined for a predetermined terminal; and

means responsive to said queue for dynamically allocating B-channels interactively with the network to the predetermined terminal, extra B-channels being added to allocated B-channels when the queue increases, and some of the allocated B-channels being released when the queue decreases, wherein said channel allocating means deallocates the extra B-channels from a first destination to allocate them to a second destination, when the queue to the first destination decreases and the queue to the second destination increases.

2. The network of claim 1, wherein said B-channel allocation means includes means for establishing input and output destination queues corresponding to said terminals;

data flowmeter means for measuring quantity of data arriving at each said input and output destination queue during a particular time interval;

means for polling each said data flowmeter means at fixed intervals;

long term channel allocation means responsive to said polling means for allocating or deallocating transmission channels to a particular destination on said medium depending upon data flow traffic to said destination and particular channel parameters; and

short term channel allocation means, overriding said long term channel allocation means in response to predetermined conditions, for allocating or deallocating transmission channels on said medium.

3. The network of claim 2, including means for assembling pluralities of packets into trains, each consisting of a predetermined number of packets, and means for transmitting said trains onto said medium.

4. The network of claim 3, including means for compressing said trains prior to transmission thereof onto said medium.

5. The network of claim 1, wherein said queue of messages is established in a pool of buffers, and said B-channels are allocated asynchronously to allocation of said buffers.

6. A network, comprising:

a plurality of computers having associated resources and a common operating system;

means for interfacing said computers to a common ISDN line;

means for transmitting on said common ISDN line an operating system command globally to all of said computers for accessing said resources;

means for detecting on said ISDN lines a queue of messages destined for a predetermined terminal; and

means responsive to said queue for dynamically allocating B-channels interactively with the network to the predetermined terminal, extra B-channels being added to allocated B-channels when the queue increases, and some of the allocated B-channels being released when the queue decreases, wherein said channel allocating means deallocates the extra B-channels from a first destination to allocate them to a second destination, when the queue to the first destination decreases and the queue to the second destination increases.

7. The network of claim 6, wherein said B-channel allocation means includes means for establishing input and output destination queues corresponding to said terminals;

data flowmeter means for measuring quantity of data arriving at each said input and output destination queue during a particular time interval;

means for polling each said data flowmeter means at fixed intervals;

long term channel allocation means responsive to said polling means for allocating or deallocating transmission channels to a particular destination on said medium depending upon data flow traffic to said destination and particular channel parameters; and

short term channel allocation means, overriding said long term channel allocation means in response to predetermined conditions, for allocating or deallocating transmission channels on said medium.

8. The network of claim 7, including means for assembling pluralities of packets into trains, each consisting of a predetermined number of packets, and means for transmitting said trains onto said medium.

9. The network of claim 8, including means for compressing said trains prior to transmission thereof onto said medium.

10. The network of claim 6, wherein said queue of messages is established in a pool of buffers, and said B-channels are allocated asynchronously to allocation of said buffers.

11. A network, comprising:

a first local area network comprising a plurality of computers having a common operating system:

a second local area network remote from said first local area network comprising a plurality of computers having said common operating system;

means for interfacing said first and second local area networks to a common ISDN line;

means for transmitting an operating system command on said ISDN line from one computer on said first local area network globally to all other of said computers in said first and second local area networks;

means for detecting on said ISDN line a queue of messages destined for a predetermined terminal; and

means responsive to said queue for dynamically allocating B-channels interactively with the network to the predetermined terminal, extra B-channels being added to allocated B-channels when the queue increases, and some of the allocated B-channels being released when the queue decreases, wherein slid channel allocating means deallocates the extra B-channels from a first destination to allocate them to a second destination, when the queue to the first destination decreases and the queue to the second destination increases.

12. The network of claim 11, wherein said B-channel allocation means includes means for establishing input and output destination queues corresponding to said terminals;

data flowmeter means for measuring quantity of data arriving at each said input and output destination queue during a particular time interval;

means for polling each said data flowmeter means at fixed intervals;

long term channel allocation means responsive to said polling means for allocating or deallocating transmission channels to a particular destination on said medium depending upon data flow traffic to said destination and particular channel parameters; and

short term channel allocation means, overriding said long term channel allocation means in response to predetermined conditions, for allocating or deallocating transmission channels on said medium.

13. The network of claim 12, including means for assembling pluralities of packets into trains, each consisting of a predetermined number of packets, and means for transmitting said trains onto said medium.

14. The network of claim 13, including means for compressing said trains prior to transmission thereof onto said medium.

15. The network of claim 11, wherein said queue of messages is established in a pool of buffers, and said B-channels are allocated asynchronously to allocation of said buffers.

16. A network, comprising:

a local area network comprising a plurality of computers having a common operating system;

a computer remote from said local area network and having said common operating system;

means for interfacing said remote computer and said local area network to a common ISDN line;

means for transmitting an operating system command on said ISDN line from said remote computer globally to all of said computers in said local area network;

means for detecting on said ISDN line a queue of messages destined for a predetermined terminal; and

means responsive to said queue for dynamically allocating B-channels interactively with the network to the predetermined terminal, extra B-channels being added to allocated B-channels when the queue increases, and some of the allocated B-channels being released when the queue decreases, wherein said channel allocating means deallocates the extra B-channels from a first destination to allocate them to a second destination, when the queue to the first destination decreases and the queue to the second destination increases.

17. The network of claim 16, wherein said B-channel allocation means includes means for establishing input and output destination queues corresponding to said terminals;

data flowmeter means for measuring quantity of data arriving at each said input and output destination queue during a particular time interval;

means for polling each said data flowmeter means at fixed intervals;

long term channel allocation means responsive to said polling means for allocating or deallocating transmission channels to a particular destination on said medium depending upon data flow traffic to said destination and particular channel parameters; and

short term channel allocation means, overriding said long term channel allocation means in response to predetermined conditions, for allocating or deallocating transmission channels on said medium.

18. The network of claim 17, including means for assembling pluralities of packets into trains, each consisting of a predetermined number of packets, and means for transmitting said trains onto said medium.

19. The network of claim 18, including means for compressing said trains prior to transmission thereof onto said medium.

20. The network of claim 16, wherein said queue of messages is established in a pool of buffers, and said B-channels are allocated asynchronously to allocation of said buffers.

21. A network, comprising:

a plurality of computers each having at least one data storage disk;

means for interfacing said computers to a common ISDN line;

means for transmitting on said common ISDN line an operating system command from one of said computers globally to all others of said computers for accessing data storage disks thereof;

means for detecting on said ISDN line a queue of messages destined for a predetermined terminal; and

means responsive to said traffic for dynamically allocating B-channels interactively with the network to the predetermined terminal, extra B-channels being added to allocated B-channels when the queue increases, and some of the allocated B-channels being released when the queue decreases, wherein said channel allocating means deallocates the extra B-channel from a first destination to allocate them to a second destination, when the queue to the first destination decreases and the queue to the second destination increases.

22. The network of claim 21, wherein said B-channel allocation means includes means for establishing input and output destination queues corresponding to said terminals;

data flowmeter means for measuring quantity of data arriving at each said input and output destination queue during a particular time interval;

means for polling each said data flowmeter means at fixed intervals;

long term channel allocation means responsive to said polling means for allocating or deallocating transmission channels to a particular destination on said medium depending upon data flow traffic to said destination and particular channel parameters; and

short term channel allocation means, overriding said long term channel allocation means in response to predetermined conditions, for allocating or deallocating transmission channels on said medium.

23. The network of claim 22, including means for assembling pluralities of packets into trains, each consisting of a predetermined number of packets, and means for transmitting said trains onto said medium.

24. The network of claim 23, including means for compressing said trains prior to transmission thereof onto said medium.

25. The network of claim 21, wherein said queue of messages is established in a pool of buffers, and said B-channels are allocated asynchronously to allocation of said buffers.

26. A network, comprising:

a plurality of computers each having at least one data storage disk having a unique name;

means for interfacing said computers to a common ISDN line;

means for accessing a selected data storage disk for a particular one of said computers by transmitting on said common ISDN line an operating system command including the unique name of said selected disk, from said particular one of said computers globally to all others of said computers;

means for detecting on said ISDN line a queue of messages destined for a predetermined terminal; and

means responsive to said queue for dynamically allocating B-channels interactively with the network to the predetermined terminal, extra B-channels being added to allocated B-channels when the queue increases, and some of the allocated B-channels being released when the queue decreases, wherein said channel allocating means deallocates the extra B-channels from a first destination to allocate them to a second destination, when the queue to the first destination decreases and the queue to the second destination increases.

27. The network of claim 26, wherein said B-channel allocation means includes means for establishing input and output destination queues corresponding to said terminals;

data flowmeter means for measuring quantity of data arriving at each said input and output destination queue during a particular time interval;

means for polling each said data flowmeter means at fixed intervals;

long term channel allocation means responsive to said polling means for allocating or deallocating transmission channels to a particular destination on said medium depending upon data flow traffic to said destination and particular channel parameters; and

short term channel allocation means, overriding said long term channel allocation means in response to predetermined conditions, for allocating or deallocating transmission channels on said medium.

28. The network of claim 27, including means for assembling pluralities of packets into trains, each consisting of a predetermined number of packets, and means for transmitting said trains onto said medium.

29. The network of claim 28, including means for compressing said trains prior to transmission thereof onto said medium.

30. The network of claim 26, wherein said queue of messages is established in a pool of buffers, and said B-channels are allocated asynchronously to allocation of said buffers.
 Description Submit all comments and votes
 


TECHNICAL FIELD

The invention relates generally to Integrated Services Digital Networks (ISDN), and more particularly, to accessing from one computer data and applications resident at other computers distributed on an ISDN.

BACKGROUND ART

Small computers such as "personal computers" ordinarily operate as a stand alone device, carrying out information processing based on programming and data stored locally on a floppy or hard disk or in semiconductor memory media. Data can be transferred among computers digitally by cables connected to input-output ports of the computers or to commercial telephone lines or other physical media following digital-to-analog conversion by modems. Computers also can be interconnected in a local area network (LAN), sharing common resources such as data bases, files and programming, and peripheral devices, e.g., printers. Accessing from one computer a resource of another computer on a common network is not done "transparently", i.e., a computer having a desired resource must be accessed before the resource associated with it is accessed. The user accordingly must have knowledge of the location of the resource on the Network.

For example, referring to FIG. 1, a plurality of terminals T are coupled through modems M to a network. Each terminal T comprises a personal computer PC and an optional telephone unit TEL to enable the user to carry out voice communications with other terminals on the line. The computers PC, which are controlled by a common operating system, such as MS-DOS, contain data, applications and peripheral devices, hereinafter collectively called "resources", that are accessible through operating system commands. An example is a floppy or hard disk drive unit DS residing at each computer PC.

Assume that a local computer contains two disk drive units DSA and DSB, a floppy disk drive and a hard disk drive. To copy all data stored on disk drive unit DSA to drive unit DSB, the operating system command in MS-DOS is:

copy DSA:*.* DSB:

Conventionally, the operating system enables multiple resources to be accessed by a computer. However, no sharing of resources among different computers is possible unless the computers are programmed to operate as "master-slave" units. Remote access software, such as "pcANYWHERE", by Dynamic Microprocessor Associates, Inc., is an example of commercially available software for this purpose. Resource sharing requires each computer on the Network to be loaded with, and executing, the remote accesses software.

Files can be transferred between computers using conventional file transfer software, such as "SMARTCOM", by Hayes Microcomputing, but file transfer requires operator attendance at each terminal.

The present invention is directed to a router that provides resource sharing among computers standing alone or residing in local area networks LANs without operator attendance at the "slave" terminal. Communications between computers is transparent, enabling the user to access distributed resources without knowledge of the locations of the resources on the Network.

The invention is carried out in the environment of ISDN. ISDN is a relatively newly developed and emerging field of telecommunications which integrates computer and communications technologies to provide, worldwide, a common, all-digital network. This is based, in part, on standardizing the structure of digital protocols developed by the International Telegraph and Telephone Consultative Committee (CCITT). Despite implementation of multiple networks within national boundaries, from a user's point of view there is a single, uniformly accessible, worldwide network capable of handling a broad range of telephone, data and other conventional and enhanced services. The invention, carried out on the ISDN, will enable terminal resources to be shared globally.

A complete description of the architecture of ISDN is beyond the scope of this specification. For details, and for an extensive bibliography of references of ISDN, see Stallings, ISDN: An Introduction, MacMillan Publishing Company, 1989. Copending application Ser. No. 976,923 and now U.S. Pat. No. 5,463,629, to Ko, entitled "Dynamic Channel Allocation Method and System for Integrated Services Digital Network," filed by the assignee of this invention, provides a background discussion of ISDN features that are germane to the present invention, and is incorporated herein by reference.

To establish communications between a host and the ISDN, an interface, or "relay", must be implemented to accomplish gateway functions, translating protocols used on dissimilar networks. A relay of a type termed a "bridge" forms interconnections at the data-link layer of the OSI Reference Model. A "router" functions at the network layer, and a "gateway" handles higher-level protocols.

An ISDN router, designated by R in FIG. 2, operates entirely in the digital domain, carrying out all necessary protocol conversion between the host network and ISDN. Details of the router R are given in copending application Ser. No. 094,144 and now U.S. Pat. No. 5,444,703, to Gagliardi et al., entitled "ISDN Interfacing of Personal Computers," filed by the common assignee on even date herewith and incorporated herein by reference.

Copending application Ser. No. 094,143 and now U.S. Pat. No. 5,442,630, to Gagliardi et al., entitled "ISDN Interfacing of Local Area Networks," filed on even date herewith and assigned to the common assignee, describes a router supporting interconnections among hosts on the ISDN to form a "virtual" LAN. A local area network, or LAN, provides a cluster of interconnected hosts (computers), or nodes, on a medium. Each node can communicate with every other node; the Network requires no central node or computer.

FIG. 3 depicts utilization of one type of router described in the aforementioned copending application (LAN connector) for interconnecting a number of hosts to form a virtual B-channel LAN. A variation, shown in FIG. 4, provides ISDN routers R to interconnect to LANs of a common type or of different types. In FIG. 5, a remote host H is connected to a pair of hosts residing on a LAN through first and second routers at the host and LAN branches of the ISDN. The host side router R1 is of a type described in the copending application entitled "ISDN Interfacing of Personal Computers." The LAN side router R2 in FIG. 5 is of a type described in the copending application entitled "ISDN Interfacing of Local Area Networks."

Copending application Ser. No. 094,115 and now U.S. Pat. No. 5,479,407, to Ko et al., entitled "Channel Utilization Method and System for ISDN", describes an ISDN router that dynamically allocates bandwidth by monitoring traffic at each destination queue and in response allocates or deallocates virtual B-channels. Bandwidth utilization is optimized by packaging data packets into trains that are transmitted to the destination wh