메뉴 건너뛰기




Volumn 23, Issue 2, 2005, Pages 304-320

Resource allocation in communication networks using abstraction and constraint satisfaction

Author keywords

Abstraction; Constraint satisfaction; Constraint based routing; Quality of service (QoS) routing; Resource allocation

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); QUALITY OF SERVICE; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; WAVELENGTH DIVISION MULTIPLEXING;

EID: 13844297595     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2004.839377     Document Type: Article
Times cited : (5)

References (24)
  • 2
    • 0002416734 scopus 로고
    • Analysis of shortest-path routing algorithms in a dynamic network environment
    • Z. Wang and J. Crowcroft, "Analysis of shortest-path routing algorithms in a dynamic network environment," in Proc. ACM SIGCOMM CCR, vol. 22, 1992, pp. 63-71.
    • (1992) Proc. ACM SIGCOMM CCR , vol.22 , pp. 63-71
    • Wang, Z.1    Crowcroft, J.2
  • 4
    • 0001737878 scopus 로고    scopus 로고
    • Practical applications of constraint programming
    • R. J. Wallace, "Practical applications of constraint programming," Constraints An Int. J., pp. 139-168, 1996.
    • (1996) Constraints an Int. J. , pp. 139-168
    • Wallace, R.J.1
  • 6
    • 0001259317 scopus 로고
    • An optimization problem related to balancing loads on SONET rings
    • S. Cosares and I. Saniee, "An optimization problem related to balancing loads on SONET rings," Telecommun. Syst., vol. 3, pp. 165-181, 1994.
    • (1994) Telecommun. Syst. , vol.3 , pp. 165-181
    • Cosares, S.1    Saniee, I.2
  • 7
    • 0013039914 scopus 로고    scopus 로고
    • Optimal resource allocation for path restoration in mesh-type self-healing networks
    • M. Herzberg, D. J. Wells, and A. Herschtal, "Optimal resource allocation for path restoration in mesh-type self-healing networks," Int. Teletraffic Congr. (ITC), vol. 15, pp. 351-360, 1997.
    • (1997) Int. Teletraffic Congr. (ITC) , vol.15 , pp. 351-360
    • Herzberg, M.1    Wells, D.J.2    Herschtal, A.3
  • 8
    • 0742283316 scopus 로고    scopus 로고
    • A comparison of heuristics for telecommunications traffic routing
    • New York: Wiley
    • J. W. Mann and G. D. Smith, "A comparison of heuristics for telecommunications traffic routing," in Modem Heuristic Search Methods. New York: Wiley, 1996, pp. 235-254.
    • (1996) Modem Heuristic Search Methods , pp. 235-254
    • Mann, J.W.1    Smith, G.D.2
  • 9
    • 13844262523 scopus 로고    scopus 로고
    • A framework for the development of telecommunications network planning, design and optimization applications
    • Swisscom
    • B. T. Messmer, "A framework for the development of telecommunications network planning, design and optimization applications," Tech. Rep. FE520.020 78.00 F, 1997. Swisscom.
    • (1997) Tech. Rep. , vol.FE520.020 78.00 F
    • Messmer, B.T.1
  • 10
    • 0030246198 scopus 로고    scopus 로고
    • Quality-of-service routing for supporting multimedia applications
    • Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE J. Sel. Areas Commun., vol. 14, no. 7, pp. 1228-1234, 1996.
    • (1996) IEEE J. Sel. Areas Commun. , vol.14 , Issue.7 , pp. 1228-1234
    • Wang, Z.1    Crowcroft, J.2
  • 11
    • 0032206931 scopus 로고    scopus 로고
    • An overview of quality of service routing for next-generation high-speed networks: Problems and solutions
    • Nov./Dec.
    • S. Chen and K. Nahrstedt, "An overview of quality of service routing for next-generation high-speed networks: Problems and solutions," IEEE Netw., pp. 64-79, Nov./Dec. 1998.
    • (1998) IEEE Netw. , pp. 64-79
    • Chen, S.1    Nahrstedt, K.2
  • 12
    • 0031998589 scopus 로고    scopus 로고
    • The bandwidth allocation problem in the ATM network model is NP-complete
    • S. Vedantham and S. S. Iyengar, "The bandwidth allocation problem in the ATM network model is NP-complete," Inform. Process. Lett., vol. 65, pp. 179-182, 1998.
    • (1998) Inform. Process. Lett. , vol.65 , pp. 179-182
    • Vedantham, S.1    Iyengar, S.S.2
  • 15
    • 0031389386 scopus 로고    scopus 로고
    • Interchangeability supports abstraction and reformulation for multidimensional constraint satisfaction
    • E. C. Freuder and D. Sabin, "Interchangeability supports abstraction and reformulation for multidimensional constraint satisfaction," in Proc. 15th Nat. Conf. Artif. Intell, 1997, pp. 191-196.
    • (1997) Proc. 15th Nat. Conf. Artif. Intell , pp. 191-196
    • Freuder, E.C.1    Sabin, D.2
  • 16
    • 13844263996 scopus 로고    scopus 로고
    • New York: Springer-Verlag, Jul., Proc. 4th Int. Symp. Abstraction, Reformulation and Approximation
    • B. Y. Choueiry and T. Walsh, Eds., Lecture Notes in Artificial Intelligence 1864. New York: Springer-Verlag, Jul. 2000, Proc. 4th Int. Symp. Abstraction, Reformulation and Approximation.
    • (2000) Lecture Notes in Artificial Intelligence , vol.1864
    • Choueiry, B.Y.1    Walsh, T.2
  • 17
    • 84949498896 scopus 로고    scopus 로고
    • A dynamic hierarchy of intelligent agents for network management
    • New York: Springer-Verlag, Proc. 2nd Int. Workshop Intell. Agents Telecommun. Applicat
    • C. Frei and B. Fallings, "A dynamic hierarchy of intelligent agents for network management," in Lecture Notes in Artificial Intelligence 1437. New York: Springer-Verlag, 1998, Proc. 2nd Int. Workshop Intell. Agents Telecommun. Applicat., pp. 1-16.
    • (1998) Lecture Notes in Artificial Intelligence , vol.1437 , pp. 1-16
    • Frei, C.1    Fallings, B.2
  • 18
    • 0019067870 scopus 로고
    • Increasing tree search efficiency for constraint satisfaction problems
    • R. M. Haralick and G. L. Elliott, "Increasing tree search efficiency for constraint satisfaction problems." Artif. Intell., vol. 14, pp. 263-313, 1980.
    • (1980) Artif. Intell. , vol.14 , pp. 263-313
    • Haralick, R.M.1    Elliott, G.L.2
  • 19
    • 0001372340 scopus 로고
    • Hybrid algorithms for the constraint satisfaction problem
    • P. Prosser, "Hybrid algorithms for the constraint satisfaction problem," Comput. Intell., vol. 9, no. 3, pp. 268-299, 1993.
    • (1993) Comput. Intell. , vol.9 , Issue.3 , pp. 268-299
    • Prosser, P.1
  • 20
    • 0031077567 scopus 로고    scopus 로고
    • Wavelength requirements in arbitrarily connected wavelength-routed optical networks
    • Feb.
    • S. Baroni and P. Bayvel, "Wavelength requirements in arbitrarily connected wavelength-routed optical networks," IEEE/OSA J. Lightwave Technol, vol. 15, no. 2, pp. 242-251, Feb. 1997.
    • (1997) IEEE/OSA J. Lightwave Technol , vol.15 , Issue.2 , pp. 242-251
    • Baroni, S.1    Bayvel, P.2
  • 21
    • 0029386683 scopus 로고
    • Routing and wavelength assignment in all-optical networks
    • Oct.
    • R. Ramaswami and K. N. Sivarajan, "Routing and wavelength assignment in all-optical networks," IEEE/ACM Trans. Netw., vol. 3, pp. 489-500, Oct. 1995.
    • (1995) IEEE/ACM Trans. Netw. , vol.3 , pp. 489-500
    • Ramaswami, R.1    Sivarajan, K.N.2
  • 24
    • 0000668582 scopus 로고
    • Mobile software agents for control in telecommunications networks
    • Apr.
    • S. Appleby and S. Steward, "Mobile software agents for control in telecommunications networks," British Telecom. Technol. J., vol. 12, no. 2, pp. 104-113, Apr. 1994.
    • (1994) British Telecom. Technol. J. , vol.12 , Issue.2 , pp. 104-113
    • Appleby, S.1    Steward, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.