Filters








12,561 Hits in 5.5 sec

A layered broadband switching architecture with physical or virtual path configurations

M.B. Gursoy, J.Y. Hui, N. Moayeri, R.D. Yates
1991 IEEE Journal on Selected Areas in Communications  
In one example, physical path setup is shown to require roughly 50% more bandwidth than virtual path setup.  ...  Two path setup methods, namely physical and virtual path setup, are described.  ...  Besides bandwidth efficiency, the issues of complexity and flexibility should also be considered for comparing virtual versus physical path networks.  ... 
doi:10.1109/49.108679 fatcat:fiyjfi6mnvbificdollwxz7on4

Accelerating HPC codes on Intel(R) Omni-Path Architecture networks: From particle physics to Machine Learning [article]

Peter Boyle, Michael Chuvelev, Guido Cossu, Christopher Kelly, Christoph Lehner, Lawrence Meadows
2017 arXiv   pre-print
We discuss practical methods to ensure near wirespeed performance from clusters with either one or two Intel(R) Omni-Path host fabric interfaces (HFI) per node, and Intel(R) Xeon Phi(TM) 72xx (Knight's  ...  We find a significant improvement in performance robustness when memory is obtained using carefully allocated 2MB "huge" virtual memory pages, implying that either non-standard allocation routines should  ...  We wish to thank James Southern, Eng Lim Goh, Daniel Faraj at SGI for useful conversations, and the provision of benchmarks on SGI ICE-XA systems.  ... 
arXiv:1711.04883v1 fatcat:up2ogazio5c6xa7zkt6nrt7voy

All-path bridging: Path exploration as an efficient alternative to path computation in bridging standards

Guillermo Ibanez, Elisa Rojas
2013 2013 IEEE International Conference on Communications Workshops (ICC)  
, to build switched networks of big size organized as a single IP subnet (to avoid management of IP addresses, rapidly changing in virtualized servers), while allowing full utilization of infrastructure  ...  This means significant complexity both in terms of computation and control message exchange and they also need additional loop control mechanisms because link state database may temporarily be not consistent  ... 
doi:10.1109/iccw.2013.6649434 dblp:conf/icc/IbanezR13 fatcat:surv7pcgijfexmud26mmgbwxgm

Mapping a Pipelined Data Path onto a Network-on-Chip

Stephan Kubisch, Claas Cornelius, Ronald Hecht, Dirk Timmermann
2007 2007 International Symposium on Industrial Embedded Systems  
This is done in the light of preliminary investigations for the redesign of an existing packet processing system because that system's current architecture exhibits drawbacks regarding performance and  ...  In this paper, we discuss the level of QoS needed in a specific NoC for a packet processing application.  ...  An a i,j drawn with a dotted line is a control path with a bandwidth constraint of up to 350 Mbit/s in the worst case (bursts of minimal frames).  ... 
doi:10.1109/sies.2007.4297333 dblp:conf/sies/KubischCHT07 fatcat:mjezkhue35dcfftlzmro6pq5pm

Traffic analysis for multiparty videoconferencing in virtual path-based ATM networks

Gang Feng, Tak-Shing Peter Yum
2000 International Journal of Communication Systems  
We "rst address several conference management issues in the VP-based ATM network, including the bandwidth allocation strategies, routing rule, call admission policy and speaker change management.  ...  However, Kelly's model requires the enumeration of all the possible paths in the networks. Therefore, for any non-trivial network, this model cannot lead to numerical solutions.  ...  Routing Let there be a conference bridge which performs the functions of routing, admission control, and the management of the change of active nodes.  ... 
doi:10.1002/(sici)1099-1131(200002)13:1<79::aid-dac409>3.0.co;2-i fatcat:6j473tzvqfcfrh3qpo2qe4k64q

Traffic analysis for multiparty videoconferencing in virtual path‐based ATM networks

Gang Feng, Tak‐Shing Peter Yum
2000 International Journal of Communication Systems  
We "rst address several conference management issues in the VP-based ATM network, including the bandwidth allocation strategies, routing rule, call admission policy and speaker change management.  ...  However, Kelly's model requires the enumeration of all the possible paths in the networks. Therefore, for any non-trivial network, this model cannot lead to numerical solutions.  ...  Routing Let there be a conference bridge which performs the functions of routing, admission control, and the management of the change of active nodes.  ... 
doi:10.1002/(sici)1099-1131(200002)13:1<79::aid-dac409>3.3.co;2-9 fatcat:764idom5tbazbhuy3hyodxkys4

Analysis Study of Path Rerouting And Handover Schemes for WATM/LEO Satellite Networks

A. HASSAN, A. ALMOGAZY, H. HEFNAWY
2006 The International Conference on Electrical Engineering  
The final stage is data flow control, where the delivery of the data from the old connection path to the new connection path is maintained according to agreed-upon service guarantees.  ...  The analysis of this case study creates a new vision for design implementation aspects, which improve the delay and QOS performance of the rerouting and handoff methods used in integrated WATM /LEO satellite  ...  By provisioning some bandwidth using virtual channel (VC) or virtual path reservation between neighboring base stations, chaining can be accomplished quickly (since the crossover switch will not be involved  ... 
doi:10.21608/iceeng.2006.33533 fatcat:ob6erfrehjafdej3ri2cixz6ey

Virtual path control for ATM networks with call level quality of service guarantees

N. Anerousis, A.A. Lazar
1998 IEEE/ACM Transactions on Networking  
The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks.  ...  Finally, we apply the algorithm to three sample networks and study several of its performance characteristics.  ...  The algorithm maximizes the network revenue under the above set of constraints and works independently of the number of traffic classes in the network, the admission control policy used in every link,  ... 
doi:10.1109/90.664270 fatcat:htlnwmzudjaozdimfsepv7opdu

Your Data Center Is a Router: The Case for Reconfigurable Optical Circuit Switched Paths

Guohui Wang, David G. Andersen, Michael Kaminsky, Michael Kozuch, T. S. Eugene Ng, Konstantina Papagiannaki, Madeleine Glick, Lily B. Mummert
2009 ACM Workshop on Hot Topics in Networks  
Acknowledgments We would like to thank Richard Gass and Michael Ryan, of Intel Labs Pittsburgh, for their help with the setup of the experiments.  ...  paths have become high-bandwidth.  ...  Figure 4 shows the architecture of the optical path management system.  ... 
dblp:conf/hotnets/WangAKKNPGM09 fatcat:wnaqhmbs4rda3cduj34txavh5y

Dynamic inter-SLA resource sharing in path-oriented differentiated services networks

Yu Cheng, Weihua Zhuang
2006 IEEE/ACM Transactions on Networking  
The recently proposed SLA management scheme based on virtual partitioning (Bouillet et al., 2002) allows overloaded SLAs to exploit the spare capacity of underloaded SLAs for efficient resource utilization  ...  , however, at the the cost of possible SLA violation of the underloaders.  ...  The authors are grateful to the anonymous reviewers for their constructive comments and suggestions which helped to improve the quality of this paper.  ... 
doi:10.1109/tnet.2006.876199 fatcat:hpvwttixszdvjhalrn2gabjsda

MILPFlow: A toolset for integration of computational modelling and deployment of data paths for SDN

Lucio A. Rocha, Fabio L. Verdi
2015 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM)  
SDN is a paradigm that proposes the separation of data forwarding plane from the data control plane.  ...  In this paper, we propose the integration between computational modelling and the deployment of data paths for SDN.  ...  ACKNOWLEDGMENT The authors gratefully acknowledge the contribution of CAPES, FAPESP and CNPq, Brazilian funding agencies.  ... 
doi:10.1109/inm.2015.7140367 dblp:conf/im/RochaV15 fatcat:vzzpmksizzamta4lsavzrrpinu

Joint Energy Efficient and QoS-aware Path Allocation and VNF Placement for Service Function Chaining [article]

Mohammad M. Tajiki, Stefano Salsano, Luca Chiaraviglio, Mohammad Shojafar, Behzad Akbari
2018 arXiv   pre-print
Service Function Chaining (SFC) allows the forwarding of a traffic flow along a chain of Virtual Network Functions (VNFs, e.g., IDS, firewall, and NAT).  ...  The performance of the proposed algorithms are numerically evaluated over a real-world topology and various network traffic patterns.  ...  The authors would like to thank Francesco Giacinto Lavacca and Vincenzo Eramo for their support on the evaluation of our algorithms in comparison with the ASR algorithm.  ... 
arXiv:1710.02611v7 fatcat:j5qvw3m3szberoo5lc252oyim4

Path based p-cycles for resilient MPLS network design

Jing Zhang, Richard J. Harris
2015 2015 International Telecommunication Networks and Applications Conference (ITNAC)  
The studies are also performed regarding changes in performance with regard to the number of eligible cycles.  ...  Failure-Independent Path-Protecting (FIPP) p-cycles are a path based extension of the well-known p-cycles and inherit the attractive properties of ring-like recovery speed and mesh-like capacity efficiency  ...  In this way, more assured control can be placed over paths with a global view of reservations and bandwidth availability.  ... 
doi:10.1109/atnac.2015.7366783 dblp:conf/itnac/ZhangH15 fatcat:7qsa36dmhnd4vm2vnl3iccx5na

SLM Simulation and MonteCarlo Path Tracing for Computer-Generated Holograms

Juan Magallón, Alfonso Blesa, Francisco Serón
2021 SN Computer Science  
AbstractComputer holography is a growing research field that must pay attention to two main issues concerning computing effort: the visualization of a 3D virtual scene with photo-realistic quality and  ...  a feasible estimation of computing time costs.  ...  Our goal is also to use configurable virtual SLMs, such as the one proposed, to perform a computational approach to achieve photo-realistic computer-generated holograms using Monte Carlo path-tracing methods  ... 
doi:10.1007/s42979-021-00632-6 fatcat:youotzgfcfginolji2ubmj4zbm

Path selection in user-controlled circuit-switched optical networks

Wojciech Golab, Raouf Boutaba
2008 Optical Switching and Networkning Journal  
Specifically, we discuss variations of the least cost and widest path problems that address two unique aspects of the user-controlled environment.  ...  We also show the benefit of breaking ties in shortest path computations in a manner that reduces harmful fragmentation of capacity.  ...  on Lightpaths Users can perform a variety of management operations on lightpaths.  ... 
doi:10.1016/j.osn.2008.02.001 fatcat:j3jjuzrfsjhxpb7pozzkb3a5zu
« Previous Showing results 1 — 15 out of 12,561 results