• DocumentCode
    1667519
  • Title

    Optimal call admission in circuit-switched networks

  • Author

    Julka, Vibhor ; Cassandras, Christos G.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
  • Volume
    3
  • fYear
    1994
  • Firstpage
    2077
  • Abstract
    A fundamental issue arising in networks supporting voice traffic is that of call admission: the decision to accept or reject a new voice call. In this paper, we consider the optimal call admission problem in a circuit-switched tandem N-node network with fixed routing, i.e., all routes between source/destination (S/D) have been predetermined. Each S/D pair can be viewed as a circuit with the ith circuit. A call routed on circuit i is termed a type i call. We assume homogeneous bandwidth at each node, where the bandwidth is such that we can multiplex n voice calls on any circuit. In this paper we consider a state-dependent threshold based call admission policy. We propose an online´approach to determine the optimal threshold values so as to optimise the network performance
  • Keywords
    multiplexing; optimisation; scheduling; telecommunication traffic; telephone traffic; voice communication; circuit-switched networks; multiplexing; optimal call admission; source allocation; source/destination routing; tandem N-node network; threshold based call admission policy; transceiver assignment; voice traffic; Bandwidth; Circuits; Costs; Intelligent networks; Laboratories; Minimization; Routing; Stochastic processes; Throughput; Transceivers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1994., Proceedings of the 33rd IEEE Conference on
  • Conference_Location
    Lake Buena Vista, FL
  • Print_ISBN
    0-7803-1968-0
  • Type

    conf

  • DOI
    10.1109/CDC.1994.411430
  • Filename
    411430