SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L773:1943 0620 OR L773:1943 0639 "

Sökning: L773:1943 0620 OR L773:1943 0639

  • Resultat 1-10 av 96
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Abedifar, Vahid, et al. (författare)
  • Routing, Modulation and Spectrum Assignment in Programmable Networks based on Optical White Boxes
  • 2018
  • Ingår i: Journal of Optical Communications and Networking. - : Optical Society of America. - 1943-0620 .- 1943-0639. ; 10:9, s. 723-735
  • Tidskriftsartikel (refereegranskat)abstract
    • Elastic optical networks (EONs) can help overcome the flexibility challenges imposed by emerging heterogeneous and bandwidth-intensive applications. Among the different solutions for flexible optical nodes, optical white box switches implemented by architecture on demand (AoD) have the capability to dynamically adapt their architecture and module configuration to the switching and processing requirements of the network traffic. Such adaptability allows for unprecedented flexibility in balancing the number of required nodal components in the network, spectral resource usage, and length of the established paths. To investigate these trade-offs and achieve cost-efficient network operation, we formulate the routing, modulation, and spectrum assignment (RMSA) problem in AoD-based EONs and propose three RMSA strategies aimed at optimizing a particular combination of these performance indicators. The strategies rely on a newly proposed internal node configuration matrix that models the structure of optical white box nodes in the network, thus facilitating hardware-aware routing of connection demands. The proposed strategies are evaluated in terms of the number of required modules and the related cost, spectral resource usage, and average path length. Extensive simulation results show that the proposed RMSA strategies can achieve remarkable cost savings by requiring fewer switching modules than the benchmarking approaches, at a favorable trade-off with spectrum usage and path length.
  •  
2.
  • Ahmed, Jawwad, et al. (författare)
  • Hybrid Survivability Schemes Achieving High Connection Availability With a Reduced Amount of Backup Resources
  • 2013
  • Ingår i: Journal of Optical Communications and Networking. - : The Optical Society of America. - 1943-0620 .- 1943-0639. ; 5:10, s. A152-A161
  • Tidskriftsartikel (refereegranskat)abstract
    • Maximizing connection availability in WDM networks is critical because even small disruptions can cause huge data losses. However, there is a trade-off between the level of network survivability and the cost related to the backup resources to be provided. The 100% survivability can be achieved by dedicated path protection with multiple pre-reserved protection paths for each provisioned connection, i.e., DPP (1:N). Unfortunately, the blocking probability performance of DPP (1:N) is negatively affected by the large number of pre-reserved backup wavelengths standing-by unutilized. On the other hand, path restoration (PR)-based solutions ensure good blocking performance at the expense of lower connection availability.The work in this paper aims at finding hybrid network survivability strategies that combine the benefits of both techniques (i.e., high availability with low blocking rate). More specifically, the paper focuses on a double link failure scenario and proposes two strategies. The first one, couples dedicated path protection DPP (1:1) with path restoration (referred to as DPP + PR) to minimize the number of dropped connections. The second scheme adds up the concept of backup reprovisioning (BR), referred to as DPP + BR + PR, in order to further increase the connection availability achieved by DPP + PR. Integer Linear Programming (ILP) models for the implementation of the proposed schemes are formulated. Extensive performance evaluation conducted in a PCE-based WDM network scenario shows that DPP + BR + PR and DPP + PR can significantly lower the blocking probability value compared to DPP (1:2) without compromising too much in terms of connection availability.
  •  
3.
  •  
4.
  • Bhar, Chayan, 1988, et al. (författare)
  • Channel allocation in elastic optical networks using traveling salesman problem algorithms
  • 2019
  • Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 11:10, s. C58-C66
  • Tidskriftsartikel (refereegranskat)abstract
    • Elastic optical networks have been proposed to support high data rates in metro and core networks. However, frequency allocation of the channels (i.e., channel ordering) in such networks is a challenging problem. This requires arranging the optical channels within the frequency grid with the objective of ensuring a minimum signal-to-noise ratio (SNR). An optimal arrangement results in the highest SNR margin for the entire network. However, determining the optimal arrangement requires an exhaustive search through all possible arrangements (permutations) of the channels. The search space increases exponentially with the number of channels. This discourages an algorithm employing an exhaustive search for the optimal frequency allocation. We utilize the Gaussian noise (GN) model to formulate the frequency allocation (channel ordering) problem as a variant of the traveling salesman problem (TSP) using graph theory. Thereafter, we utilize graph-theoretic tools for the TSP from the existing literature to solve the channel ordering problem. Performance figures obtained for the proposed scheme show that it is marginally inferior to the optimal search (through all possible permutations) and outperforms any random allocation scheme. Moreover, the proposed scheme is implementable for a scenario with a large number of channels. In comparison, an exhaustive search with the GN model and split-step Fourier method simulations are shown to be feasible for a small number of channels only. It is also illustrated that the SNR decreases with an increase in bandwidth when the frequency separation is high.
  •  
5.
  • Casellas, Ramon, et al. (författare)
  • Introduction to the ONDM2020 special issue
  • 2021
  • Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 13:6, s. ONDM1-ONDM2
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
    • This JOCN special issue includes extended versions of selected papers that were presented at the 24th International Conference on Optical Network Design and Modeling (ONDM2020), which took place virtually on May 18-21, 2020. The topics covered by the papers represent clear trends in current optical networking research including filterless optical networks and their applicability in metropolitan scenarios; programmable, software-defined-networking-enabled sliceable bandwidth variable transceivers supporting multi-dimensionality; and two applications of machine learning-the cognitive reconfiguration of data-center networks in support of high-performance computing, and quality of transmission estimation for reduced margins.
  •  
6.
  • Chen, Jiajia, et al. (författare)
  • Joint Bandwidth Scheduling to Support Differentiated Services and Multiple Service Providers in 1G and 10G EPONs
  • 2009
  • Ingår i: Journal of Optical Communications and Networking. - : The Optical Society. - 1943-0620 .- 1943-0639. ; 1:4, s. 343-351
  • Tidskriftsartikel (refereegranskat)abstract
    • Dynamic bandwidth allocation (DBA) is one of the key issues for the current (1G) and next-generation (10G) Ethernet-based passive optical network (EPON) systems. We present a novel bandwidth scheduling scheme that integrates specific scheduling implementations in the optical line terminal and optical network units. This scheduling enables multiservice access with scalable quality of service support for the triple-play (video, voice, and data) services and open access. Our simulation results show that the proposed scheduling algorithm performs very well in supporting service differentiation and fair allocation of bandwidth to different service providers. A performance comparison between 1G and 10G systems is also presented. To the best of our knowledge, no detailed study of DBA in a 10G EPON can be found in the literature so far.
  •  
7.
  • Chen, Jiajia, et al. (författare)
  • Scalable Passive Optical Network Architecture for Reliable Service Delivery
  • 2011
  • Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 3:9, s. 667-673
  • Tidskriftsartikel (refereegranskat)abstract
    • A scalable and reliable architecture for both a wavelength division multiplexing passive optical network and a hybrid wavelength and time division multiplexing passive optical network with self-healing capability is presented and evaluated. Our protection scheme is compatible with a cascaded arrayed waveguide grating that can accommodate an ultra-large number of end users. A simple interconnection pattern between two adjacent optical network units (ONUs) is applied in order to provide protection for distributed fibers between a remote node and the ONUs. Therefore, the investment cost on a per-user basis can be significantly reduced. Meanwhile, the performance evaluation shows that our approach can achieve high connection availability while maintaining the support of long reach and high splitting ratio.
  •  
8.
  • Chen, Ling, et al. (författare)
  • Reliable and efficient RAR-based distributed model training in computing power network
  • 2024
  • Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 16:5, s. 527-540
  • Tidskriftsartikel (refereegranskat)abstract
    • The computing power network (CPN) is a novel network technology that integrates computing power from the cloud, edge, and terminals using IP/optical cross-layer networks for distributed computing. CPNs can provide an effective solution for distributed model training (DMT). As a bandwidth optimization architecture based on data parallelism, ring all-reduce (RAR) is widely used in DMT. However, any node or link failure on the ring can interrupt or block the requests deployed on the ring. Meanwhile, due to the resource competition of batch RAR-based DMT requests, inappropriate scheduling strategies will also lead to low training efficiency or congestion. As far as we know, there is currently no research that considers the survivability of rings in scheduling strategies for RAR-based DMT. To fill this gap, we propose a scheduling scheme for RAR-based DMT requests in CPNs to optimize the allocation of computing and wavelength resources considering the time dimension while ensuring reliability. In practical scenarios, service providers may focus on different performance metrics. We formulate an integer linear programming (ILP) model and a RAR-based DMT deployment algorithm (RDDA) to solve this problem considering four optimization objectives under the premise of the minimum blocking rate: minimum computing resource consumption, minimum wavelength resource consumption, minimum training time, and maximum reliability. Simulation results demonstrate that our model satisfies the reliability requirements while achieving corresponding optimal performance for DMT requests under four optimization objectives.
  •  
9.
  • Cheng, Yuxin, et al. (författare)
  • POTORI : A Passive Optical Top-of-Rack Interconnect Architecture for Data Centers
  • 2017
  • Ingår i: Journal of Optical Communications and Networking. - : Institute of Electrical and Electronics Engineers (IEEE). - 1943-0620 .- 1943-0639. ; 9:5, s. 401-411
  • Tidskriftsartikel (refereegranskat)abstract
    • Several optical interconnect architectures inside data centers (DCs) have been proposed to efficiently handle the rapidly growing traffic demand. However, not many works have tackled the interconnects at top-of-rack (ToR), which have a large impact on the performance of the data center networks (DCNs) and can introduce serious scalability limitations due to their high cost and power consumption. In this paper, we propose a passive optical ToR interconnect architecture (POTORI) to replace the conventional electronic packet switch (EPS) in the access tier of DCNs. In the data plane, POTORI relies on a passive optical coupler to interconnect the servers within the rack and interfaces toward the aggregation/core tiers. The POTORI control plane is based on a centralized rack controller responsible for managing the communications among the servers in the rack. We propose a cycle-based medium access control (MAC) protocol to efficiently manage the exchange of control messages and the data transmission inside the rack. We also introduce and evaluate a dynamic bandwidth allocation algorithm for POTORI, namely largest first (LF). Extensive simulation results show that, with the use of fast tunable optical transceivers, POTORI and the proposed LF strategy are able to achieve an average packet delay below 10 μs under realistic DC traffic scenarios, outperforming conventional EPSs. On the other hand, with slower tunable optical transceivers, a careful configuration of the network parameters (e.g., maximum cycle time of the MAC protocol) is necessary to obtain a good network performance in terms of the average packet delay.
  •  
10.
  • Dharmaweera, Madushanka Nishan, 1986, et al. (författare)
  • Traffic-grooming- and multipath-routing-enabled impairment-aware elastic optical networks
  • 2016
  • Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 8:2, s. 58-70
  • Tidskriftsartikel (refereegranskat)abstract
    • Traffic grooming and multipath routing are two techniques that are widely adopted to increase the performance of traditional wavelength division multiplexed networks. They have been recently applied in elastic optical networks to increase spectral efficiency. In this study, we investigate the potential gains by jointly employing the two techniques in combination with a realistic physical impairment model. To allocate resources and quantify spectral efficiency gains over existing impairment-aware schemes, we present an analytical optimization formulation for small networks and a heuristic for large networks. Through numerical simulations, we demonstrate that traffic grooming and multipath routing, together, increase spectral efficiency and reduce resource consumption over existing schemes. We show that the proposed scheme offers significant performance improvements in networks with low degrees of connectivity, high traffic loads, and long links.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 96
Typ av publikation
tidskriftsartikel (95)
forskningsöversikt (1)
Typ av innehåll
refereegranskat (88)
övrigt vetenskapligt/konstnärligt (8)
Författare/redaktör
Wosinska, Lena (20)
Wosinska, Lena, 1951 ... (19)
Chen, Jiajia (16)
Monti, Paolo, 1973- (14)
Agrell, Erik, 1965 (14)
Monti, Paolo (9)
visa fler...
Furdek Prekratic, Ma ... (9)
Natalino Da Silva, C ... (8)
Muhammad, Ajmal (7)
Furdek, Marija, 1985 ... (6)
Karlsson, Magnus, 19 ... (6)
Simeonidou, Dimitra (6)
Brandt-Pearce, Maïté (5)
Andrekson, Peter, 19 ... (5)
Zhang, Jie (3)
Furdek, Marija (3)
Wong, Elaine (3)
Cavdar, Cicek (3)
Pioro, Michal (3)
Zervas, Georgios (3)
Bhar, Chayan, 1988 (3)
Wymeersch, Henk, 197 ... (2)
Ruiz, M (2)
Keykhosravi, Kamran, ... (2)
Chen, Lei (2)
Munoz, Raul (2)
Larsson, Anders, 195 ... (2)
Forchheimer, Robert (2)
Lindgren, Anders (2)
Aleksic, Slavisa (2)
Popov, Sergei (2)
Pang, Xiaodan, Dr. (2)
Ozolins, Oskars (2)
Fiorani, Matteo, 198 ... (2)
Raffaelli, Carla (2)
Skubic, Björn (2)
He, Sailing (2)
Skorin-Kapov, Nina (2)
Gustavsson, Johan, 1 ... (2)
Li, Jun (2)
Westbergh, Petter, 1 ... (2)
Gavler, A (2)
Fumagalli, Andrea (2)
Martensson, Jonas (2)
Tornatore, M. (2)
Zhao, Yongli (2)
Li, Jun, 1988 (2)
Spadaro, Salvatore (2)
Zhu, Zuqing (2)
Szczerba, Krzysztof, ... (2)
visa färre...
Lärosäte
Kungliga Tekniska Högskolan (50)
Chalmers tekniska högskola (42)
RISE (12)
Lunds universitet (3)
Linköpings universitet (2)
Karolinska Institutet (1)
Språk
Engelska (96)
Forskningsämne (UKÄ/SCB)
Teknik (84)
Naturvetenskap (38)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy