[go: up one dir, main page]

Kelly, 1996 - Google Patents

The Clifford Paterson Lecture, 1995 Modelling communication networks, present and future

Kelly, 1996

View PDF
Document ID
5987763155036026620
Author
Kelly F
Publication year
Publication venue
Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences

External Links

Snippet

Modern communication networks are able to respond to randomly fluctuating demands and failures by allowing buffers to fill, by rerouting traffic and by reallocating resources. They are able to do this so well that, in many respects, large-scale networks appear as coherent …
Continue reading at www.cl.cam.ac.uk (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources

Similar Documents

Publication Publication Date Title
Kelly The Clifford Paterson Lecture, 1995 Modelling communication networks, present and future
Altman et al. Equilibrium, games, and pricing in transportation and telecommunication networks
Bonald et al. Insensitive bandwidth sharing in data networks
JP3789681B2 (en) Resource allocation and routing in multiservice virtual private networks.
Hyman et al. Joint scheduling and admission control for ATS-based switching nodes
Park et al. Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness
Medhi et al. Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing
Sykas et al. Simulative analysis of optimal resource allocation and routing in IBCN's
Xu et al. Tabu search for dynamic routing communications network design
Gibbens et al. Network programming methods for loss networks
Griffin et al. A TMN system for VPC and routing management in ATM networks
EP0496061A2 (en) Real-time decentralized network traffic management using a parallel algorithm
Kameda et al. A case where a paradox like Braess's occurs in the Nash equilibrium but does not occur in the Wardrop equilibrium-a situation of load balancing in distributed computer systems
Davidsson et al. Evaluating multi-agent system architectures: A case study concerning dynamic resource allocation
Arvidsson et al. On the use of agent technology for IN load control
Ding et al. Cost-minimized virtual elastic optical network provisioning with guaranteed QoS
Wang et al. An atomic routing game for multi-class communication networks with quality of service requirements
G∤ ąbowski et al. Simulation studies of communication systems with mutual overflows and threshold mechanisms
Anandalingam et al. Conflict and cooperation in designing international telecommunication networks
Gersht et al. Real-time traffic management by a parallel algorithm
Johansson et al. Four multi-agent architectures for intelligent network load management
Hwang et al. Dynamic bandwidth provisioning economy of a market-based IP QoS interconnection intServ-diffServ
Hellendoorn Fuzzy control in telecommunications
Busuioc Distributed cooperative agents for service management in communications networks
Larsson et al. A comparison between different approaches for VPC bandwidth management