Methods, computer code, and means are described that can control load in a network. In some applications, the monetary cost of operating the network can be reduced. Utilization of links in the network can be monitored. A degree of suboptimality with respect to some criteria can be assessed. In some
Methods, computer code, and means are described that can control load in a network. In some applications, the monetary cost of operating the network can be reduced. Utilization of links in the network can be monitored. A degree of suboptimality with respect to some criteria can be assessed. In some instances, the criteria could be based at least partly one or more monetary billing structures of some subset of two or more links. A subset of the forwarding decisions of one or more forwarding nodes in the network can be adjusted automatically, based at least partly on the assessing. The adjustment can attempt to reduce the degree of suboptimality.
대표청구항▼
What is claimed is: 1. A computer-usable medium having computer-readable instructions stored thereon for execution by a processor to perform a method to ensure a desired load distribution in a network, the method comprising: monitoring of at least a first utilization of a first subset of two or mor
What is claimed is: 1. A computer-usable medium having computer-readable instructions stored thereon for execution by a processor to perform a method to ensure a desired load distribution in a network, the method comprising: monitoring of at least a first utilization of a first subset of two or more links in the network; assessing, base at least partly on the monitoring, of a degree of suboptimality with respect to the desired load distribution, wherein the degree of suboptimality corresponds to a measurable difference between a performance of determined load distribution and a performance of the desired load distribution, the assessing including: generating at least two sets of functions; and selecting a first set of functions from the at least two sets of functions: wherein at least one function from the first set of functions gives a first degree of unacceptability of at least one link from the first subset of two or more links, wherein the first degree of unacceptability is based at least partly on a second utilization of the at least one link from the first subset of two or more links, wherein the first degree of unacceptability corresponds to a probability that adjusting a subset of forwarding decisions of one or more forwarding nodes in the network will decrease the measurable difference; and the at least one function in the first set of functions outputs at least a varying value; and selecting of a second set of functions from the at least two sets of functions if, for each function in the first set of functions that gives the first degree of unacceptability, the first degree of unacceptability fails a first threshold test; and adjusting, automatically, of a subset of forwarding decisions of one or more forwarding nodes in the network based at least partly on the assessing: wherein at least one forwarding decision from the subset of the forwarding decision corresponds to at least one link from a second subset of two or more links in the network; and the adjusting includes attempting to reduce the degree of suboptimality. 2. The computer-usable medium of claim 1, wherein the first utilization and the second utilization are equal. 3. The computer-usable medium of claim 1, wherein the first utilization and the second utilization are unequal. 4. The computer-usable medium of claim 1, wherein at least one link from the first subset of two or more links is included in the second subset of two or more links. 5. The computer-usable medium of claim 1, wherein at least one link from the first subset of two or more links is not included in the second subset of two or more links. 6. The computer-usable medium of claim 1, wherein at least one of the monitoring, the assessing and the adjusting repeats. 7. The computer-usable medium of claim 1, wherein at least one of the forwarding decisions of the one or more forwarding nodes are described at least partly by at least one Layer 3 Protocol. 8. The computer-usable medium of claim 7, wherein at least one of the forwarding decisions of the one or more forwarding nodes are described at least partly by at least one Internet Protocol (IP). 9. The computer-usable medium of claim 1, wherein at least one of the forwarding decisions of the one or more forwarding nodes are described at least partly by at least one Layer 2 Protocol. 10. The computer-usable medium of claim 1, wherein the adjusting is described at least partly by at least one Border Gateway Protocol (BGP). 11. The computer-usable medium of claim 1, wherein the at least two sets of functions are generated from one or more monetary billing structures of a third subset of two or more links in the network. 12. The computer-usable medium of claim 11, wherein at least one link from the third subset of two or more links is included in at least one of: 1) the first subset of two or more links and 2) the second subset of two or more links. 13. The computer-usable medium of claim 11, wherein at least one link from the third subset of two or more links is not included in at least one of: 1) the first subset of two or more links and 2) the second subset of two or more links. 14. The computer-usable medium of claim 11, wherein at least one of the one or more monetary billing structures is for at least one Internet Service Provider (ISP). 15. The computer-usable medium of claim 11, wherein each link of at least one link from the third subset of two or more links has a third utilization, and at least one of the one or more monetary billing structures receives as input at least the third utilization. 16. The computer-usable medium of claim 15, wherein the first utilization of the first subset of two or more links is at least partly indicative of the third utilization of the third subset of two or more links. 17. The computer-usable medium of claim 15, wherein at least one of the first utilization and the second utilization is being determined over time. 18. The computer-usable medium of claim 17, wherein the third utilization is computed at least partly from at least one of: 1a) a maximum and 1b) an average; of at least one of: 2a) one or more percentiles and 2b) one or more averages; and of one or more sets of utilization samples of the at least one link from the third subset of two or more links. 19. The computer-usable medium of claim 17, wherein the at least one of the one or more monetary billing structures is continuous or piecewise continuous with respect to the third utilization. 20. The computer-usable medium of claim 15, wherein the generating includes: compiling a list of at least two sums, wherein at least one sum of the list adds at least two of the third utilizations; determining, for a subset of the list, a utilization distribution based at least partly on the least one of the one or more monetary billing structures; and constructing the at least two sets of functions based at least partly on the utilization distribution. 21. The computer-usable medium of claim 20, wherein the utilization distribution minimizes a monetary cost of operating the network, with respect to the at least one of the one or more monetary billing structures. 22. The computer-usable medium of claim 20, wherein the utilization distribution uses at least a steepest descent strategy with respect to the at least one of the one or more monetary billing structures. 23. The computer-usable medium of claim 1, wherein the monitoring uses one or more of Simple Network Monitoring Protocol (SNMP), flow information export, NetFlow, span port, and a source external to the first subset of two or more links. 24. The computer-usable medium of claim 1, wherein at least one function in the at least two sets of functions is continuous or piecewise continuous with respect to the second utilization. 25. The computer-usable medium of claim 1, wherein at least one function in the least two sets of functions is non-decreasing with respect to the second utilization. 26. The computer-usable medium of claim 1, wherein at least one function in the at least two sets of functions receives at least one input, the at least one input at least partly depending on the second utilization, wherein the at least one function outputs at least: 1)a first constant value for values of the at least one input up to a threshold value; and 2)a second constant value for values of the at least one input above the threshold value. 27. The computer-usable medium of claim 1, wherein at least one function in the at least two sets of functions receives at least one input, the at least one input at least partly depending on the second utilization, wherein the at least one function outputs at least: 1)a first constant value for values of the at least one input ranging from a second constant value to a third constant value, 2)a linear function of at least one input for values of the at least one input ranging from the third constant value to a fourth constant value, and 3)a fifth constant value for values of the at least one input exceeding the fourth constant value. 28. The computer-usable medium of claim 1, wherein the adjusting includes attempting to reduce the degree of suboptimality based on least partly on the first degree of unacceptability. 29. The computer-usable medium of claim 28, wherein the adjusting further includes attempting to reduce the degree of suboptimality by changing at least one forwarding decision from the subset of the forwarding decisions, wherein: prior to the changing, the at least one forwarding decision from the subset of the forwarding decisions corresponds to at least a first link from the second subset of two or more links in the network; after the changing, the at least one forwarding decision from the subset of the forwarding decisions corresponds to at least a second link from the second subset of two or more links in the network; and wherein the first degree of unacceptability of the at least first link from the second subset is more unacceptable than the first degree of unacceptability of the at least the second link from the second subset. 30. The computer-usable medium of claim 1, wherein the assessing includes determining a second degree of unacceptability based at least partly on the first degree of unacceptability, wherein the second degree of unacceptability corresponds to a status of a link for routing over the network. 31. The computer-usable medium of claim 30, wherein the determining of the second degree of unacceptability includes treating the first degree of unacceptability as a probability value, and assigning, using the probability value, one of a plurality of states to the second degree of unacceptability. 32. The computer-usable medium of claim 1, further comprising: ordering the one or more sets of functions into an ordered list of the one or more sets of functions; and wherein the first set of functions and the second set of functions are adjacent in the ordered list of the one or more sets of functions. 33. The computer-usable medium of claim 32, wherein: at least one function in the one or more sets of functions received at least one input, the at least one input at least partly depending on the second utilization, wherein the at least one function outputs at least: 1)a first constant value for values of the at least one input ranging from a second constant value to a third constant value; 2)a linear function of at least one input for values of the at least one input ranging from the third constant value to a fourth constant value; and 3)a fifth constant value for values of the at least one input exceeding the fourth constant value, further comprising: computing, for each set of functions in the one or more sets of functions, a level, wherein the level is based at least partly on a sum of at least the fourth constant values across the one or more functions in each set of functions; and performing the ordering based at least partly on the level computed for each set of functions. 34. The computer-usable medium of claim 32, wherein the sum of at least the fourth constant values across the one or more functions in each set of functions, sums at least one function of the one or more functions in each set of functions. 35. The computer-usable medium of claim 32, wherein the sum of the fourth constant values across the one or more functions in each set of functions, sums all functions of the one or more functions in each set of functions. 36. The computer-usable medium of claim 1, wherein at least one forwarding decision from the subset of forwarding decisions at least partly influences one or more objects, wherein the one or more objects includes one of a prefix, a flow and a network application. 37. The computer-usable medium of claim 36, wherein the assessing is further based at least partly on quality characterizations of the one or more objects, wherein the quality characterizations are with respect to at least one link from the second subset of two or more links. 38. The computer-usable medium of claim 36, wherein the assessing further includes: selecting at least one object from the one or more objects; selecting at least one set of functions from the one or more sets of functions; and constructing one or more winner sets for the at least one object and the least one set of functions, wherein each winner set from the one or more winner sets includes a corresponding quality characterization threshold, wherein the constructing includes: 1)including in at least one of the one or more winner sets one or more links from the second subset of two or more links; 2)excluding, from the at least one or more winner sets, links for which the quality characterizations of the at least one object fails the corresponding quality characterization threshold included by each winner set from the one ore more winner sets; and 3)excluding, from the at least one or more winner sets, unwanted links, wherein the unwanted links have a second threshold of acceptable unacceptability, wherein the second threshold of acceptable unacceptability is based at least partly on the first degree of unacceptability given by the at least one set of functions; and selecting one or more links from a non-empty winner set from the one or more winner sets, wherein the non-empty winner set has a low corresponding quality characterization threshold from all corresponding quality characterization thresholds included by all winner sets from the one or more winner sets. 39. The computer-usable medium of claim 38, wherein the first threshold test and the second threshold test are equal. 40. The computer-usable medium of claim 38, wherein the first threshold test and the second threshold test are unequal. 41. The computer-usable medium of claim 38, wherein the low corresponding quality characterization threshold is the lowest corresponding quality characterization threshold from all corresponding quality characterization thresholds included by all winner sets from the one or more winner sets. 42. The computer-usable medium of claim 38, wherein: the constructing of a first one or more winner sets is done for a third set of functions from the one or more sets of functions; and the constructing of a second one or more winner sets is done for a fourth set of functions from the one or more sets of functions if: 1) the one or more sets of functions includes at least two sets of functions; and 2) all of the first one or more winner sets are empty. 43. The computer-usable medium of claim 38: wherein the constructing of a first one or more winner sets is done for a first object from the one or more objects; and the constructing of a second one or more winner sets is done for a second object from the one or more objects if: 1) the one or more objects includes at least two objects, and 2) all of the first one or more winner sets are empty. 44. The computer-usable medium of claim 38, wherein the excluding, from the at least one or more winner sets, links for which the quality characterizations of the at least one object fails the corresponding quality characterization threshold included by each winner set from the at least one or more winner sets is further comprised of: identifying at least one best link from the one or more links from the second subset of two or more links, wherein the at least one best link has a high quality characterization from at least one or more links from a second subset of two or more links, and determining the corresponding quality characterization threshold based at least partly on the high quality characterization. 45. The computer-usable medium of claim 44, wherein the high quality characterization is the highest quality characterization from the at least one of the one or more links from the second subset of two or more links. 46. The computer-usable medium of claim 1, further including selecting the subset of the forwarding decisions of one or more forwarding nodes automatically. 47. The computer-usable medium of claim 46, wherein the selecting of the subset of the forwarding decisions is at least partly random. 48. The computer-usable medium of claim 46, wherein the selecting of the subset of the forwarding decisions is independent from the assessing. 49. The computer-usable medium of claim 46, wherein the selecting of the subset of the forwarding decisions uses a flow monitoring device. 50. The computer-usable medium of claim 46, wherein at least one forwarding decision from the subset of the forwarding decisions at least partly influences one or more objects, wherein the one or more objects includes at least one of a prefix, a flow, and a network application; the assessing is further based at least partly on quality characterizations of the one or more objects, wherein the quality characterizations are with respect to at least one link from the second subset of two or more links; and the selecting of the subset of the forwarding decisions is based at least partly on a measuring of the quality characterizations of the one or more objects. 51. The computer-usable medium of claim 46, wherein the selecting of the subset of the forwarding decisions is based partly on a source external to the second subset of two or more links. 52. The computer-usable medium of claim 1, wherein the computer code is at least partly software. 53. The computer-usable medium of claim 1, wherein the computer code is all software. 54. The computer-usable medium of claim 1, wherein the computer code is at least partly hardware. 55. The computer-usable medium of claim 1, wherein the computer code is all hardware. 56. The computer-usable medium of claim 1, wherein the performance is a cost incurred by a load distribution. 57. A network of nodes configured to ensure a desired load distribution in a network, the network comprising: means for monitoring at least a first utilization of a first subset of two or more links in the network; means for assessing, based at least partly on the means for monitoring, a degree of suboptimality with respect to the desired load distribution, wherein the degree of suboptimality corresponds to a measurable difference between a performance of determined load distribution and a performance of the desired load distribution, wherein the means for assessing is configured to: generate a list of at least two sets of functions; select a first set of functions from the list of at least two sets of functions wherein at least one function from the first set of functions gives a first degree of unacceptability of at least one link from the first subset of two or more links, wherein the first degree of unacceptability is based at least partly on a second utilization of the at least one link from the first subset of two or more links, wherein the first degree of unacceptability is based at least partly on a second utilization of the at least one link from the first subset of two or more links, wherein the first degree of unacceptability corresponds to a probability that adjusting a subset of forwarding decisions of one or more forwarding nodes in the network will decrease the measurable difference, and at least one function in the first set of functions outputs at least a varying value, and selecting a second set of functions from the at least two sets of functions if: 1) at least one function in the first set of functions gives the first degree of unacceptability; and 2) for each function in the first set of functions that gives the first degree of unacceptability, the first degree of unacceptability fails a first threshold test, and means for adjusting automatically a subset of the forwarding decisions of one or more forwarding nodes in the network based at least partly on the means for assessing: wherein at least one forwarding decision from the subset of the forwarding decisions corresponds to at least one link from a second subset of two or more links in the network, the means for adjusting attempts to reduce the degree of suboptimality. 58. A method of attempting to ensure a desired load distribution in a network, the method comprising monitoring at least a first utilization of a first subset of two or more links in the network; assessing, based at least partly on the monitoring, a degree of suboptimality with respect to the desired load distribution, wherein the degree of suboptimality corresponds to a measurable difference between a performance of determined load distribution and a performance of the desired load distribution, the assessing including: generating at least two sets of functions; and selecting a first set of functions from the at least two sets of functions wherein at least one function from the first set of functions gives a first degree of unacceptability of at least one link from the subset of two or more links, wherein the first degree of unacceptability is based at least partly on a second utilization of the at least one link from the first subset of two or more links, wherein the first degree of unacceptability corresponds to a probability that adjusting a subset of forwarding decisions of one or more forwarding nodes in the network will decrease the measurable difference; and the at least one function in the first set of functions outputs at least a varying value; selecting a second set of functions from the at least two sets of functions if, for each function in the first set of functions that gives the first degree of unacceptability, the first degree of unacceptability fails a first threshold test; and adjusting automatically a subset of forwarding decisions of one or more forwarding nodes in the network based at least partly on the assessing: wherein at least one forwarding decision from the subset of the forwarding decision corresponds to at least one link from a second subset of two or more links in the network; and the adjusting includes attempting to reduce the degree of suboptimality. 59. A method of controlling load distributions on a computer network having multiple nodes coupled by multiple links, the method comprising: monitoring load distributions on a first subset of the multiple nodes on the network; generating from one or more billing structures corresponding first and second sets of unacceptability functions, wherein the first set of functions is used to determine first amounts that measurable performances associated with the monitored load distributions differ from a first threshold and the second set of functions is used when the first amounts all exceed the first threshold and is used to determine second amounts that measurable performances associated with the monitored load distributions differ from a second threshold; wherein the first set of functions generates a probability value that a measure of a first use on a first subset of the multiple links has a value that differs from a threshold; and automatically adjusting forwarding decisions on a second subset of the multiple nodes based on the first or the second amounts, thereby controlling load distributions on the computer network. 60. The method of claim 59, wherein the first subset of nodes is different from the second subset of nodes. 61. The method of claim 59, wherein the first use corresponds to a load. 62. The method of claim 59, wherein the first use corresponds to a load on one of the multiple links per a capacity of the one link. 63. The method of claim 59, wherein the second set of functions assigns a link from the multiple links to one of two states, wherein the one of the two states corresponds to a winner set from which links are selected for forwarding. 64. The method of claim 59, wherein generating the first set of functions comprises: determining a list of sums of load, wherein at least one sum in the list corresponds to the sums of different combinations of load on the multiple links; determining, for different values of sums of load, an optimal distribution of use on one of the multiple links; and constructing the two sets of functions based at least partly on the optimal distribution of use.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (160)
Kotchey Christopher Michael ; Hartung Robert Edward, Activation sequence for a network router.
Pacheco Mely L. (Campbell CA) Damouny Nabil G. (Sunnyvale CA) Matthews Abraham R. (Sunnyvale CA) Loitz Gary S. (Fremont CA) Edney Johnathan P. (Reading GB2), Apparatus and method for incorporating a large number of destinations over circuit-switched wide area network connection.
Aoki, Takeshi; Kikuchi, Shinji; Takahashi, Eiichi; Yokoyama, Ken; Katsuyama, Tsuneo; Okano, Tetsuya, Apparatus for and method of measuring communication performance.
Winckles, Adrian M; Cable, Julian Frank; Rosenberg, Catherine, Border gateway protocol manager and method of managing the selection of communication links.
Gelman Alexander (Brooklyn NY) Kobrinski Haim (Colts Neck NJ) Smoot Lanny S. (Morris Township ; Morris County NJ) Weinstein Stephen B. (Summit NJ), Communications architecture and method for distributing information services.
Blackett, Andrew W.; Gilbert, Bryan J.; Van Gorp, John C.; Teachman, Michael E.; Yeo, Jeffrey W., Communications architecture for intelligent electronic devices.
Nicolas C. Sheard ; Larry J. Fischer ; Richard W. Matthews ; Gurla Himabindu ; Qilin Hu ; Wendy J. Zheng ; Boyle Y. Mow, Data exchange system and method.
Bottomley John F. (Vienna VA) Chadwick Henry D. (Herndon VA) Hall James M. (Baltimore MD) Moore Frank R. (Waccabuc NY) Powers ; Jr. John T. (Morgan Hill CA) Putterman Marc A. (New York NY) Schaszberg, Data server, control server and gateway architecture system and method for broadcasting digital video on demand.
Salingre Daniel,FRX ; Davoult Armel,FRX, Data transmission system having a monitoring function for monitoring the congestion of links and node intended to be use.
Newmark Rona J. (Northboro MA) Alicandro Rosemarie (Millbury MA) Bixby Peter C. (Northboro MA) Burn Donald D. (Westboro MA) Enberg Eric H. (Westboro MA) Marino Paul K. (Hopkinton MA) Woodbury Paul W., Distributed processing system having plural computers each using identical retaining information to identify another com.
Sistanizadeh, Kamran; Tashayod, Alex; Bashaw, Lynn Eric; Kamali, Masoud M.; Collar, Craig Robert, Enhanced data switching/routing for multi-regional IP over fiber network.
Nguyen Tam M. (Valhalla NY) Rana Deepak (Yorktown Heights NY) Ruiz Antonio (Yorktown Heights NY) Willner Barry E. (Briarcliff Manor NY), Hybrid digital/analog multimedia hub with dynamically allocated/released channels for video processing and distribution.
Hershey Paul C. (Manassas VA) Barker Kenneth J. (Cary NC) Lingafelt ; Sr. Charles S. (Durham NC) Waclawsky John G. (Frederick MD), Information collection architecture and method for a data communications network.
Griffiths Michael John ; McElhiney James David,CAX, Information storage and delivery over a computer network using centralized intelligence to monitor and control the information being delivered.
Bond,Paul W.; Casper,Daniel F.; Chencinski,Edward; Hoke,Joseph M.; Livolsi,Robert R., Initialization of a bidirectional, self-timed parallel interface with automatic testing of AC differential wire pairs.
Ash Gerald R. (West Long Branch NJ) Oliver Billy B. (Chatham NJ), Integrated network controller for a dynamic nonhierarchical routing switching network.
James Pleasant Gossett Dalton, Jr. ; Alcina de Figueiredo Dalton ; Stephen Anthony Thomas ; Maria Osterholt Cown ; Rich Carroll Vaughn ; Pawel Szczerbina ; Brian Keith Lovette, Internet telephony call routing engine.
Nemirovsky Paul (3 Bouldercrest Ct. Rockville MD 20850) Ball Michael (1012 S. Mansion Dr. Silver Spring MD 20770) Dahl Roy (8152 Mandan Ter. Greenbelt MD 20770), Method and apparatus for aggregating terminals into clusters to assist in the construction of a distributed data communi.
Aggarwal Ajay (Somersworth NH) Scott Walter (Salem NH) Rustici Eric (Londonderry NH) Bucciero David (Nashua NH) Haskins Andrew (Lee NH) Matthews Wallace (Exeter NH), Method and apparatus for determining a communications path between two nodes in an Internet Protocol (IP) network.
Agarwal, Puneet; Menezes, Vivek; Basturk, Erol, Method and apparatus for distributing and providing fault tolerance to path-vector routing protocols within a multi-processor router.
Grady John (Fairfax VA) Hand Kenneth (Silver Spring MD) Modrowsky John (Burtonsville MD) Richard ; III Arthur A. (Springfield VA), Method and system for accessing multimedia data over public switched telephone network.
Colby Steven ; Krawczyk John J. ; Nair Raj Krishnan ; Royce Katherine ; Siegel Kenneth P. ; Stevens Richard C. ; Wasson Scott, Method and system for directing a flow between a client and a server.
Hegde,Kiran Venkatesh; McGrath, III,Raymond Edward; Kind,Jason Matthew Walter; Krause,Eric Kane; DeWitt,Josiah, Method and system for generating and providing rich media presentations optimized for a device over a network.
Ahuja, Abha; Ayers, Matt; Black, Ben; Brown, Chris; Cohn, Daniel T.; Ramsey, Stephen; Ronen, Ophir; Schachter, Paul J.; Stiffelman, Oscar B.; Wheeler, Christopher D., Method and system for optimizing routing through multiple available internet route providers.
Picard Jean L. (309 Chemin des Moulieres 06480 La Colle Sur Loup FRX), Method and system for routing information between nodes in a communication network.
Sidi Eli,ILX ; Pongranz Shlomi,ILX ; Somech Ovad,ILX ; Raab Ilan,ILX ; Bielous Yaron,ILX, Method for economically sub-optimizing interactions in data-communications network environments, and a device according to the method.
Fox Richard H. (Sunnyvale CA) Galloway Brett D. (Campbell CA 4), Method for translating internet protocol addresses to other distributed network addressing schemes.
Cohen, Richard Alan; Flockhart, Andrew Derek; Foster, Robin H.; Maximets, Mila, Methods and apparatus for analysis of load-balanced multi-site call processing systems.
Schwaller, Peter James; Bellinghausen, Joan Marie; Borger, Dana Scott; Hicks, Jeffrey Todd; Joyce, Steven Thomas; McCorry, Mark Eric; Selvaggi, Christopher David; Zelek, Mark Clarence, Methods, systems and computer program products for network performance testing through active endpoint pair based testing and passive application monitoring.
Anderson Michael H. (Moorpark CA), Multi-user, on-demand video storage and retrieval system including video signature computation for preventing excessive.
Krum Harry A. (Indialantic FL) Gotsa Felix L. (Miami FL) McKenna Dennis (Clearwater FL) Patterson Gary (Largo FL) Clairmont Jan M. (Palm Bay FL) Winters John L. (Melbourne FL) Cunningham Howard L. (S, Multidrop data concentrator communication network.
Nagami Kenichi,JPX ; Ami Junko,JPX ; Katsube Yasuhiro,JPX ; Saito Takeshi,JPX ; Esaki Hiroshi,JPX, Network interconnection apparatus, network node apparatus, and packet transfer method for high speed, large capacity in.
Northcutt J. Duane (Sunnyvale CA) Berry David T. (Sunnyvale CA), Network video server system receiving requests from clients for specific formatted data through a default channel and es.
Cutler ; Jr. Victor H. (Mesa AZ) Richetta Peter (Tempe AZ) Young Kenneth P. (Columbia MD) Davieau Gerald J. (Eldersburg MD), Packet routing system and method therefor.
van Tetering Johannes A. M. (Zevenbergen NLX) Denissen Frank L. (Boom BEX), Performance measurement system for a telecommunication path and device used therein.
Wheeler, Christopher D.; Ronen, Ophir; Black, Benjamin J.; McMillin, Michael; Carlson, John, Private network access point router for interconnecting among internet route providers.
Kitajima Hiroyuki (Yokohama JPX) Ohmachi Kazuhiko (Yokohama JPX), Processing request allocator for assignment of loads in a distributed processing system.
Kataria, Deepak; Logothetis, Dimitris; Srinivasan, Santhanam; Veeraraghavan, Malathi, Quality of service based path selection for connection-oriented networks.
Dietz, Russell S.; Maixner, Joseph R.; Koppenhaver, Andrew A., Re-using information from data transactions for maintaining statistics in network monitoring.
Eadline Douglas J. (Bethlehem PA), Run-time system having nodes for identifying parallel tasks in a logic program and searching for available nodes to exec.
Grove, Adam J.; Kharitonov, Michael; Tumarkin, Alexei, SYSTEM AND METHOD FOR HIGH-PERFORMANCE DELIVERY OF WEB CONTENT USING HIGH-PERFORMANCE COMMUNICATIONS PROTOCOL BETWEEN THE FIRST AND SECOND SPECIALIZED INTERMEDIATE NODES TO OPTIMIZE A MEASURE OF COMM.
Hooper Donald F. (Shrewsbury MA) Goldman Matthew S. (Marlborough MA) Bixby Peter C. (Westborough MA) Krishnamoorthy Suban (Shrewsbury MA), Segmented video on demand system.
Arora Sanjeev (Berkeley CA) Knight ; Jr. Thomas F. (Belmont MA) Leighton Frank T. (Newton Center MA) Maggs Bruce M. (Princeton NJ) Upfal Eliezer (Palo Alto CA), Switching networks with expansive and/or dispersive logical clusters for message routing.
Garcia-Luna-Aceves, J. Joaquin; Spohn, Marcelo; Beyer, David A., System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks.
Eggers Derek C. (4217 Highland Rd. ; Suite 275 Pontiac MI 48054) Holben David V. (4217 Highland Rd. ; Suite 275 Pontiac MI 48054) Robinson Mark E. (1080 Cliff Dr. Lapeer MI 48446), System for random access to an audio video data library with independent selection and display at each of a plurality of.
Caro Marshall A. (43 Little Neck Rd. Southampton NY 11968-4311), System for shared remote access of multiple application programs executing in one or more computers.
Zombek, James M.; Sobchak, Richard K.; Bonefas, Rudy G., System, method and computer program product for providing server discovery services during a startup sequence.
Barker, Kenneth James; Bass, Brian Mitchell; Calvignac, Jean Louis; Heddes, Marco C.; Siegel, Michael Steven; Trombley, Michael Raymond; Verplanken, Fabrice Jean, VLSI network processor and methods.
Cohen Jason M. (20 Skookwams Ct. West Islip NY 11795), Video communications system having a remotely controlled central source of video and audio data.
Hooper Donald F. (Shrewsbury MA) Goldman Matthew S. (Marlborough MA) Bixby Peter C. (Westborough MA) Krishnamoorthy Suban (Shrewsbury MA), Video on demand with memory accessing and or like functions.
Coddington Carl D. (Accokeek MD) Craig Bernard J. (Nokesville VA) Litteral Larry A. (Manassas VA) Richard ; III Arthur A. (Springfield VA) Gold Jeffrey B. (Silver Spring MD) Klika ; Jr. Donald C. (Fa, Video-on-demand services using public switched telephone network.
Karam, Mansour J.; Finn, Sean P.; Baldonado, Omar C.; Lloyd, Michael A.; Madden, Herbert S.; McGuire, James G., Method and apparatus for characterizing the quality of a network path.
Balonado, Omar C.; Finn, Sean P.; Karam, Mansour J.; Lloyd, Michael A.; Madan, Herbert S.; McGuire, James G.; Villaverde, Jose-Miguel Pulido, Method and apparatus for coordinating routing parameters via a back-channel communication medium.
Balonado, Omar C.; Finn, Sean P.; Karam, Mansour J.; Lloyd, Michael A.; Madan, Herbert S.; McGuire, James G.; Villaverde, Jose-Miguel Pulido, Method and apparatus for performance and cost optimization in an internetwork.
Lloyd, Michael A.; Baldonado, Omar C.; Finn, Sean P.; Karam, Mansour J.; McGuire, James G.; Madan, Herbert S., Method and apparatus for the assessment and optimization of network traffic.
Lloyd, Michael A.; Baldonado, Omar C.; Finn, Sean P.; Karam, Mansour J.; McGuire, James G.; Madan, Herbert S., Method and apparatus for the assessment and optimization of network traffic.
Garvey, Sean P.; O'Keefe, Stephen T.; Edgar, William S.; Birch, John G.; Duvvur, Akilesh V.; Hix, Gary R.; Spencley, Philip T.; Winner, Gerald T.; Sharib, Matthew G.; Echaniz, John F., Method and system for determining a management complexity factor for delivering services in an environment.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.