[go: up one dir, main page]

Aringhieri et al., 2005 - Google Patents

Comparing metaheuristic algorithms for sonet network design problems

Aringhieri et al., 2005

View PDF
Document ID
13955444598374187286
Author
Aringhieri R
Dell’Amico M
Publication year
Publication venue
Journal of Heuristics

External Links

Snippet

This paper considers two problems that arise in the design of optical telecommunication networks when a ring-based topology is adopted, namely the SONET Ring Assignment Problem and the Intraring Synchronous Optical Network Design Problem. We show that …
Continue reading at iris.unito.it (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
    • 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
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H04L41/5041—Service implementation
    • 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
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/08—Configuration management of network or network elements
    • H04L41/0803—Configuration setting of network or network elements
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges

Similar Documents

Publication Publication Date Title
Resendel et al. GRASP with path-relinking: Recent advances and applications
Gambardella et al. Ant colonies for the quadratic assignment problem
Corominas et al. Response time variability
Aringhieri et al. Comparing metaheuristic algorithms for sonet network design problems
CN111447266B (en) Mobile edge calculation model based on chain and service request and scheduling method thereof
Resende et al. GRASP and path-relinking: Recent advances and applications
Skrzypczyk et al. An architecture for meeting quality-of-service requirements in multi-user quantum networks
CN109167637B (en) Key pool filling resource determination method, apparatus, device and readable storage medium
Oliva et al. Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
Ghasemi et al. Asynchronous coded caching with uncoded prefetching
Xu et al. Tabu search for dynamic routing communications network design
Bacciottini et al. Redip: Ranked entanglement distribution protocol for the quantum internet
Chetty et al. Dynamic decomposition of service function chain using a deep reinforcement learning approach
Hertz et al. A new ant algorithm for graph coloring
Paschalidis et al. Energy optimized topologies for distributed averaging in wireless sensor networks
Rolland et al. Queueing delay guarantees in bandwidth packing
Kim et al. A doubly distributed genetic algorithm for network coding
JP2015029223A (en) Method and device for determining transmission trial order to a plurality of links, node, and program
Li et al. Receptive field-based segmentation for distributed CNN inference acceleration in collaborative edge computing
Cen et al. A Fast Heuristic Entanglement Distribution Algorithm for Quantum Repeater Chains
Fortz et al. A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
Voß Capacitated minimum spanning trees
US8831226B2 (en) Method for key update based on the amount of communication in wireless sensor networks having hierarchy structure
Bastos et al. GRASP with path-relinking for the SONET ring assignment problem
Bacciottini et al. A configurable protocol for quantum entanglement distribution to end nodes