EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"path computation"
Narrow search

Narrow search

Year of publication
Subject
All
5-axis machining 1 Algorithm Selection 1 Disjoint Paths 1 Intent Based Routing 1 Next Generation Optical Networks 1 ONOS 1 Optical Path Computation 1 Optimal Path Selection 1 Path Computation Element 1 Path Computation Procedure 1 Quality of Transmission 1 Resource Allocation 1 SDH/SONET Technology 1 SDN 1 SRC architecture 1 Service Provisioning 1 Software Defined Optical Network 1 Transport Networks 1 cloud-networking 1 inverse kinematical transformation 1 jerk 1 path computation 1 singularity 1 tool path computation 1
more ... less ...
Online availability
All
Undetermined 2 Free 1
Type of publication
All
Article 3 Book / Working Paper 1
Type of publication (narrower categories)
All
Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
English 2 Undetermined 2
Author
All
Altmann, Jorn 1 Cho, Hyunhun 1 Gil, Joon-Min 1 Grandguillaume, Laureen 1 Hassan, A. Mohammad 1 Jeong, Young-Sik 1 Lavernhe, Sylvain 1 Nagarajan, V. 1 Park, Jinhyung 1 Park, Jong Hyuk 1 Selvaraj, P. 1 Tournier, Christophe 1
more ... less ...
Institution
All
Technology Management, Economics and Policy Program (TEMEP), Seoul National University 1
Published in...
All
International Journal of Business Data Communications and Networking (IJBDCN) 1 International journal of production research 1 Sustainability 1 TEMEP Discussion Papers 1
Source
All
RePEc 2 ECONIS (ZBW) 1 Other ZBW resources 1
Showing 1 - 4 of 4
Cover Image
Need of Algorithm Selection in Next Generation Optical Networks
Selvaraj, P.; Nagarajan, V. - In: International Journal of Business Data Communications … 14 (2018) 1, pp. 81-92
scenario, the intents of the application layer must be accounted in the path computation. There is no single path computation … algorithm selection was identified. The authors have phrased this intent specific lightpath provisioning problem as the path … computation algorithm selection problem. An algorithm selection methodology was proposed with the study of the least congested …
Persistent link: https://www.econbiz.de/10012043286
Saved in:
Cover Image
An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking
Cho, Hyunhun; Park, Jinhyung; Gil, Joon-Min; Jeong, … - In: Sustainability 7 (2015) 5, pp. 5413-5430
Legacy networks do not open the precise information of the network domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new network requirements,...
Persistent link: https://www.econbiz.de/10011274554
Saved in:
Cover Image
A tool path patching strategy around singular point in 5-axis ball-end milling
Grandguillaume, Laureen; Lavernhe, Sylvain; Tournier, … - In: International journal of production research 54 (2016) 23/24, pp. 7480-7490
Persistent link: https://www.econbiz.de/10011566612
Saved in:
Cover Image
Disjoint Paths Pair Computation Procedure for SDH/SONET Networks
Hassan, A. Mohammad; Altmann, Jorn - Technology Management, Economics and Policy Program … - 2013
carriers to find new ways of automatic service provisioning. Despite the introduction of numerous path computation procedures … requirements. Furthermore, the existing disjoint path computation procedures do not always find the best possible path between two … nodes. In this paper, we propose a path computation procedure capable of addressing the SDH/SONET multiplexing requirements …
Persistent link: https://www.econbiz.de/10010837126
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...