[go: up one dir, main page]

Santoro et al., 1985 - Google Patents

Labelling and implicit routing in networks

Santoro et al., 1985

View PDF
Document ID
3016910532226185374
Author
Santoro N
Khatib R
Publication year
Publication venue
The computer journal

External Links

Snippet

The routing problem in networks is solved by either maintaining at every node detailed routing information for all destinations (explicit routing) or by exploiting the information implicit in an a-priori labelling of nodes and links (implicit routing). Efficient implicit routing …
Continue reading at academic.oup.com (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/5619—Network Node Interface, e.g. tandem connections, transit switching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H04L12/46—Interconnection of networks
    • H04L12/4604—LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462—LAN interconnection over a bridge based backbone
    • H04L12/4625—Single bridge functionality, e.g. connection of two networks over a single bridge
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H04L12/42—Loop networks
    • 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
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • 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/02—Topology update or discovery
    • 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/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing

Similar Documents

Publication Publication Date Title
Santoro et al. Labelling and implicit routing in networks
JP2755344B2 (en) Packet switched communication network, method of generating spanning tree, and method and apparatus for transmitting extended information packet
Van Leeuwen et al. Interval routing
US6011780A (en) Transparant non-disruptable ATM network
US6714552B1 (en) Communications network
EP2880826A1 (en) Label distribution and route installation in a loop-free routing topology using routing arcs
Cidon et al. New models and algorithms for future networks
Eiselt et al. Location of facilities on a network subject to a single‐edge failure
Xue End-to-end data paths: quickest or most reliable?
WO1997029605A1 (en) A wireless atm switched local area network supporting mobility of mobile terminals
Chow et al. RREACT: A distributed network restoration protocol for rapid restoration of active communication trunks
Awerbuch et al. On buffer-economical store-and-forward deadlock prevention
Jia et al. Multicast routing, load balancing, and wavelength assignment on tree of rings
Segall Advances in verifiable fail-safe routing procedures
Nisse et al. Distributed computing of efficient routing schemes in generalized chordal graphs
US20040170130A1 (en) Spontaneous topology discovery in a multi-node computer system
CN1135801C (en) Routing method for signaling No.7 network management system
Wu et al. A new preplanned self-healing scheme for multicast ATM network
Wong et al. Distributed and fail-safe routing algorithms in toroidal-based metropolitan area networks
Pan A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
Yener et al. Fault-tolerant convergence routing
Bhandari et al. Fault-Tolerant Convergance Routing
KR970008942B1 (en) Method of distributing traffic in artificial intelligence network
Kos et al. Topological planning of communication networks
Chiu et al. Fault-tolerant routing strategy in hypercube systems