Works (213)
Updated: April 8th, 2024 05:15
2024 journal article
Fast and scalable all-optical network architecture for distributed deep learning
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 16(3), 342–357.
TL;DR:
This work proposes an optical distributed deep learning architecture (ODDL) that utilizes a fast yet scalable all-optical network architecture to accelerate distributed training, and proposes an efficient distributed control scheme that incurs minimal delay overhead.
(via Semantic Scholar)
Sources: ORCID, Web Of Science, NC State University Libraries
Added: March 1, 2024
2023 journal article
A symmetry-free spectrum allocation heuristic for elastic optical networks
OPTICAL SWITCHING AND NETWORKING, 49.
author keywords: Spectrum allocation; Optical network design; First-fit algorithm; Elastic optical networks; Symmetry-free allocation
Sources: Web Of Science, ORCID, NC State University Libraries
Added: June 12, 2023
2023 journal article
Symmetry-Free Algorithm for Spectrum Allocation: Parallel Implementations and Evaluation [Invited]
Journal of Optical Communications and Networking, 15(10), E40–E50.
author keywords: Resource management; Routing; Optimized production technology; Space exploration; Network topology; Topology; Optical fiber networks
TL;DR:
This work presents two strategies for parallelizing the execution of RFF, and indicates that RFF explores a vast number of symmetry-free solutions, and for moderate-sized networks, it takes mere seconds to yield solutions that are either optimal or very close to the lower bound.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries, ORCID, Web Of Science
Added: June 26, 2023
2022 journal article
Recursive first fit: a highly parallel optimal solution to spectrum allocation
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 14(3), 165–176.
TL;DR:
It is shown how some SA problem instances may be decomposed into smaller instances that may be solved independently without loss of optimality, and an optimality property of the well-known first-fit (FF) heuristic is proved.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: March 7, 2022
2021 journal article
Crosstalk-Aware Shared Backup Path Protection in Multi-Core Fiber Elastic Optical Networks
JOURNAL OF LIGHTWAVE TECHNOLOGY, 39(10), 3025–3036.
author keywords: Crosstalk; Optical fiber networks; Optical crosstalk; Resource management; Routing; Optical fibers; Heuristic algorithms; Inter-core crosstalk; MCF-EON; RCSA; SBPP; survivability
TL;DR:
This article considers the design of MCF-EONs with shared-backup path protection (SBPP), one of the most efficient techniques for protecting network traffic, and tackles the crosstalk-aware routing, core, and spectrum assignment (CA-RCSA) problem with the objective of jointly minimizing the network spectrum resources used and the total inter-core crosStalk.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: June 10, 2021
2021 article
Parameterized Exhaustive Routing with First Fit for RSA Problem Variants
2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM).
Sources: Web Of Science, NC State University Libraries
Added: May 23, 2022
2020 article
A Scalable Solution to Network Design Problems: Decomposition with Exhaustive Routing Search
2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM).
TL;DR:
A new decomposition method is presented that optimally decouples resource allocation from routing, making it possible to tackle each of these aspects separately, and a recursive branch-and-bound algorithm is developed to search the routing space exhaustively, yet in a scalable manner.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: October 26, 2021
2020 journal article
Congestion Minimization for Service Chain Routing Problems With Path Length Considerations
IEEE-ACM TRANSACTIONS ON NETWORKING, 28(6), 2643–2656.
author keywords: Routing; Heuristic algorithms; Minimization; Network function virtualization; Resource management; IEEE transactions; Noise measurement; Network function virtualization; virtual network functions; NFV orchestration; online algorithm; resource allocation
TL;DR:
This work presents a simple yet effective online algorithm in which the routing decision is irrevocably made without prior knowledge of future requests, and proves that this ratio is asymptotically optimal.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science; OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: January 11, 2021
2020 journal article
Minimizing Inter-Core Crosstalk Jointly in Spatial, Frequency, and Time Domains for Scheduled Lightpath Demands in Multi-Core Fiber-based Elastic Optical Network
JOURNAL OF LIGHTWAVE TECHNOLOGY, 38(20), 5595–5607.
author keywords: Crosstalk; Optical fiber networks; Heuristic algorithms; Routing; Resource management; Time-domain analysis; Inter-core crosstalk; RSCTA; MCF-based EON; scheduled lightpath demand
TL;DR:
This article develops approaches to schedule simultaneous light paths onto non-adjacent MCF cores so as to reduce inter-core crosstalk between these lightpaths, and develops an integer linear programming (ILP) model, as well as an auxiliary graph (AG) based heuristic algorithm, which jointly optimize spectrum resource utilization and reduce the lightpath inter- core crosStalk.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: October 12, 2020
2020 journal article
Recursive algorithm for selecting optimum routing tables to solve offline routing and spectrum assignment problem
AIN SHAMS ENGINEERING JOURNAL, 11(2), 273–280.
author keywords: RSA; Exhaustive routing search; RSA decomposition
TL;DR:
A new recursive decomposition approach for the RSA problem in optical networks that decouples the routing from the spectrum assignment part of the problem and may be more generally applied to any network design problem whose solution involves a search over both a routing and a resource allocation space.
(via Semantic Scholar)
doi.org (publisher)
Sources: Web Of Science, NC State University Libraries
Added: June 22, 2020
2020 chapter
Routing and Wavelength (Spectrum) Assignment
In B. Mukherjee, I. Tomkos, M. Tornatore, P. Winzer, & Y. Zhao (Eds.), Springer Handbook of Optical Networks (pp. 447–484).
Ed(s): B. Mukherjee, I. Tomkos, M. Tornatore, P. Winzer & Y. Zhao
TL;DR:
Several WA algorithms and strategies that have produced efficient designs in practical networks are covered, including Spectrum assignment, where the amount of spectrum allocated to a connection can be variable.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2020 article
Service Chain Rerouting for NFV Load Balancing
2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM).
TL;DR:
A new service chain reconfiguration framework to achieve load balancing in an NFV environment under varying levels of support from the underlying infrastructure is proposed and it is shown that the framework can achieve an approximation ratio of O(lnm/ln lnm) with high probability for the service chain request rerouting problem.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: October 26, 2021
2019 journal article
A large-scale nesting ring multi-chip architecture for manycore processor systems
OPTICAL SWITCHING AND NETWORKING, 31, 183–192.
author keywords: ONoC; Large-scale; Routing algorithm; Resource reservation
TL;DR:
An optimized architecture for integrating a large number of cores into chips with a novel control strategy, including a contention resolution scheme and a resource reservation scheme is proposed for large scale ONoCs.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(OpenAlex)
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: January 14, 2019
2019 journal article
A machine learning approach to mitigating fragmentation and crosstalk in space division multiplexing elastic optical networks
OPTICAL FIBER TECHNOLOGY, 50, 99–107.
author keywords: Space division multiplexing elastic optical networks; Spectrum fragmentation; Machine learning; Crosstalk
TL;DR:
This paper uses an Elman neural network to forecast traffic demands, and uses a two-dimensional rectangular packing model to allocate spectrum so as to decrease unnecessary spectrum fragmentation and increase resource utilization in SDM-EONs.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: June 4, 2019
2019 journal article
Editorial
IEEE Networking Letters, 1(1), 1–1.
Source: ORCID
Added: June 21, 2023
2018 journal article
A spectral clustering approach to network-aware virtual request partitioning
COMPUTER NETWORKS, 139, 70–80.
TL;DR:
This study develops a spectral clustering-based partitioning scheme that outperforms existing partitioning schemes in terms of inter-cluster traffic minimization and presents a polynomial-time greedy algorithm for this problem.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2018 journal article
Lightpath Management in SDN-Based Elastic Optical Networks With Power Consumption Considerations
Journal of Lightwave Technology, 36(9), 1650–1660.
TL;DR:
This paper uses traffic prediction techniques for centralized lightpath management that leverages the capabilities of software defined networking (SDN) technology to eliminate unnecessary lightpath termination and re-establishment operations, and in turn decrease switching power consumption within the network.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(OpenAlex)
Source: ORCID
Added: June 21, 2023
2018 journal article
On time dependent routing algorithms for open marketplaces of path services with support for in-advance path reservation
COMPUTER NETWORKS, 138, 201–212.
TL;DR:
This work defines the problem of finding multi-criteria time-constrained paths, and presents algorithms to construct these paths and also provides support for in-advance path reservation.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2018 article
SDN Enabled Restoration With Triggered Precomputation in Elastic Optical Inter- Datacenter Networks
Xiong, Y., Li, Y., Zhou, B., Wang, R., & Rouskas, G. N. (2018, January). JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, Vol. 10, pp. 24–34.
author keywords: Elastic optical networks (EONs); Inter-datacenter; Layered auxiliary graph; Restoration; Software defined networking; Triggered precomputation
TL;DR:
This paper extends the controller functionality and OpenFlow protocol for software-defined elastic optical inter-datacenter network architectures and develops a fast restoration strategy with triggered precomputation (FR-TP) that achieves fast failure recovery with minimal resource overhead.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2017 journal article
Network service orchestration in heterogeneous 5G networks using an open marketplace
IET Networks, 6(6), 149–156.
TL;DR:
The authors present two design paradigms and evaluate two corresponding prototypes which provide a framework for network services to be purchased and compare the two prototypes from the point of view of how effective they are in addressing some of the challenges posed by heterogeneous 5G networks namely programmability, scalability and innovation.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science; OpenAlex)
Sources: Crossref, NC State University Libraries
Added: February 20, 2020
2017 journal article
On Distance-Adaptive Routing and Spectrum Assignment in Mesh Elastic Optical Networks
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 9(5), 456–465.
author keywords: Distance-adaptive routing and spectrum assignment; Elastic optical networks; Multiprocessor scheduling; Network design; Spectrum assignment
TL;DR:
This paper first shows that the DA-RSA problem in networks of general topology is a special case of a well-studied multiprocessor scheduling problem and builds upon the list of scheduling concepts to develop a computationally efficient solution approach that is effective in utilizing the available spectrum resources.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2017 conference paper
On service composition algorithm for open marketplaces of network services
2017 european conference on networks and communications (eucnc).
TL;DR:
Network service composition provided as a service in an Open Marketplace enables users to obtain customized end-to-end composed service(s) using the services advertised by the providers in the marketplace using a semantic language for advertising services.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2016 journal article
Distance-adaptive routing and spectrum assignment in rings
IET Networks, 5(3), 64–70.
TL;DR:
The authors first show that the distance-adaptive routing and spectrum assignment (DA-RSA) problem is a special case of a multiprocessor scheduling problem, and develop a suite of efficient and effective DA-Rsa algorithms for ring networks, that build upon list scheduling concepts.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2016 conference paper
Exploiting SDN principles for extremely fast restoration in elastic optical datacenter Networks
2016 ieee global communications conference (globecom).
TL;DR:
The experimental results demonstrate that the proposed scheme can achieve fast recovery with low blocking probability while maintaining high spectrum efficiency, and compared with existing restoration schemes, average recovery time is improved by up to 28%.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2016 journal article
Hybrid offset-time and burst assembly algorithm (H-OTBA) for delay sensitive applications over optical burst switching networks
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 29(2), 251–261.
author keywords: OBS; burst assembly; offset-time; contstant bit rate; real time applications
TL;DR:
Simulation results demonstrate that the proposed hybrid offset‐time and burst assembly algorithm, H‐OTBA, has effectively reduced end‐to‐end delay for CBR traffic compared with current solutions.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2016 conference paper
Inception to application: A GENI based prototype of an Open Marketplace for Network Services
2016 ieee conference on computer communications workshops (infocom wkshps).
TL;DR:
A ChoiceNet prototype is successfully developed which rectifies some of the shortcomings of the earlier prototypes and demonstrates a contractual agreement between multiple network service providers to realize multiple end-to-end application scenarios using the common service specification within the GENI environment.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2016 conference paper
Language of choice: On embedding choice-related semantics in a realizable protocol
2016 ieee 37th sarnoff symposium, 31–36.
TL;DR:
This paper presents the design of a possible embedding of the entities, and a functionally complete set of interactions, comprising a choice-based architecture, and reports on a prototype built on the GENI environment, and the experience in confronting real-world design issues.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2016 conference paper
Network-aware virtual request partitioning based on spectral clustering
2016 25th international conference on computer communications and networks (icccn).
TL;DR:
This study develops a spectral clustering-based partitioning scheme that produces good solutions in a reasonable amount of time and outperforms existing partitioning schemes in terms of inter-cluster traffic minimization.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2016 conference paper
Offline distance-adaptive routing and spectrum assignment in mesh elastic optical networks
2016 ieee global communications conference (globecom).
TL;DR:
This paper first shows that the DA-RSA problem in networks of general topology is a special case of a well-studied multiprocessor scheduling problem, and builds upon list scheduling concepts to develop a computationally efficient solution approach that is effective in utilizing the available spectrum resources.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2016 article
On Routing Algorithms for Open Marketplaces of Path Services
2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC).
TL;DR:
This work defines the problem of finding multi-criteria time-constrained paths in this context, and presents a dynamic programming algorithm that constructs Pareto-optimal paths.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2016 article
Performance Evaluation of Multi-Core, Multi-Threaded SIP Proxy Servers (SPS)
2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC).
TL;DR:
This study investigates the impact of the Linux scheduler's load-balancing algorithm on the performance of multi-threaded OpenSIPS (an open source SIP proxy server, SPS), and shows how to configure the various scheduler parameters as a function of the number of CPU cores to achieve a significant improvement in SPS performance.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2016 journal article
Special issue on advances in availability and survivability in optical networks
Optical Switching and Networking, 19, 41.
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2015 conference paper
Design of a protocol to enable economic transactions for network services
2015 ieee international conference on communications (icc), 5354–5359.
TL;DR:
The design of a protocol that associates access to network services with economic contracts is presented, and it is shown how this protocol can be realized in fundamentally different ways, using out-of- band signaling and in-band signaling, based on two different prototype implementations.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2015 article
Offline Distance-Adaptive Routing and Spectrum Assignment (DA-RSA) in Rings
2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM).
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2015 journal article
On Routing and Spectrum Assignment in Rings
JOURNAL OF LIGHTWAVE TECHNOLOGY, 33(1), 151–160.
author keywords: Approximation algorithms; multiprocessor scheduling; optical fiber networks; routing and spectrum assignment; routing and wavelength assignment; spectrum assignment; wavelength assignment
TL;DR:
The complexity of the routing and spectrum assignment problem in ring networks is derived and new constant-ratio approximation algorithms with a ratio that is strictly smaller than the best known ratio to date are developed.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2015 conference paper
On the impact of scheduler settings on the performance of multi-threaded SIP servers
2015 ieee international conference on communications (icc), 6175–6180.
TL;DR:
This is the first study that takes into account the scheduler parameters in improving the performance of the SPS, and indicates that network operators may increase server capacity without additional capital expenditures by applying insightful configuration changes to scheduler policy.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2015 journal article
QoS-aware ant-based route, wavelength and timeslot assignment algorithm for optical burst switchednetworks
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 26(11), 1265–1277.
TL;DR:
An ant‐based route, wavelength and timeslot allocation algorithm is proposed to address high burst loss in OBS and improve the overall network performance and results show that the proposed algorithm outperforms SP in terms of burst loss ratio and delay.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2015 conference paper
Spectrum assignment in mesh elastic optical networks
24th international conference on computer communications and networks icccn 2015.
TL;DR:
It is shown that spectrum assignment in networks of general topology is a special case of scheduling multiprocessor tasks on dedicated processors, and efficient and effective algorithms for mesh and chain networks that build upon list scheduling concepts are developed.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2015 conference paper
Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms
2015 International Conference on Computing, Networking and Communications (ICNC), 642–647.
TL;DR:
It is proved that, under the shortest path assumption, the SA problem can be solved in polynomial time in small rings, and constant-ratio approximation algorithms for large rings are developed.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2014 journal article
ChoiceNet: Toward an Economy Plane for the Internet
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 44(3), 58–65.
TL;DR:
This paper presents the architectural aspects of the ChoiceNet economy plane as well as some of the technological problems that need to be addressed in a practical deployment.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2014 journal article
Hierarchical traffic grooming: A tutorial
COMPUTER NETWORKS, 69, 147–156.
author keywords: Traffic grooming; Hierarchical grooming; Network design
TL;DR:
A survey of traffic grooming schemes for optical networks that make use of architectures, algorithms and design techniques that impose a hierarchical structure on the network topology is presented.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2014 journal article
Multipoint Control Protocol With Look-Ahead for Wavelength Division Multiplexed Ethernet Passive Optical Network
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 6(2), 104–113.
author keywords: Look-ahead operation; Multipoint control protocol; Passive optical network
TL;DR:
The look-ahead enhanced MPCP achieves significant performance gains across a wide range of traffic loads and opens up new opportunities for the design of sophisticated dynamic bandwidth algorithms to support advanced quality of service capabilities.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2014 journal article
Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective
Journal of Optical Communications and Networking, 6(8), 754.
TL;DR:
This work shows that the spectrum assignment (SA) problem in mesh networks transforms to the problem of scheduling multiprocessor tasks on dedicated processors, and develops new constant-ratio approximation algorithms for the SA problem in chains when the number of links is fixed.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 26, 2023
2014 review
Spectrum management techniques for elastic optical networks: A survey
[Review of ]. OPTICAL SWITCHING AND NETWORKING, 13, 34–48.
author keywords: Elastic optical networks; Spectrum management; Routing and spectrum assignment
TL;DR:
A range of spectrum management techniques for elastic optical networks are reviewed and classified, including offline and online routing and spectrum assignment (RSA), distance-adaptive RSA, fragmentation-aware RSA, traffic grooming, and survivability.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2013 conference paper
Converging choice and service in future commodity optical networks using traffic grooming
2013 15th international conference on transparent optical networks (icton 2013).
TL;DR:
This paper articulate how the traditional optical networking research area of traffic grooming may be combined with recent advances in Internet architecture, specifically a proposed Future Internet architecture called ChoiceNet, and empowered by the recently emerged concept of software defined networking to make some key contributions to this problem.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2013 journal article
Hybrid FRR/p-cycle design for link and node protection in MPLS networks
AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 67(6), 470–478.
author keywords: Multi-protocol label switching; Fast reroute; Pre-configure cycle
TL;DR:
A suite of hybrid protection schemes for MPLS networks that combine the well-known p -cycle method with FRR technology are presented, which allow network operators to leverage a large existing body of p - cycle design techniques.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2013 journal article
Network Virtualization: Technologies, Perspectives, and Frontiers
JOURNAL OF LIGHTWAVE TECHNOLOGY, 31(4), 523–537.
Contributors: I. Baldine, R. Dutta n , M. Iyer*, n & A. Wang*
author keywords: Network architecture; network virtualization
TL;DR:
A unifying definition of the term “network virtualization” is offered and existing approaches are examined to bring out this unifying perspective.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science; OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2013 journal article
Traffic grooming in optical networks: Decomposition and partial linear programming (LP) relaxation
Journal of Optical Communications and Networking, 5(8), 825–835.
TL;DR:
A new (to the authors' knowledge) solution approach is proposed that decomposes the traffic grooming problem into two subproblems that are solved sequentially: 1) the virtual topology and traffic routing (VTTR) subproblem, which does not take into account physical topology constraints, and 2) the routing and wavelength assignment subproblem.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2012 conference paper
A fast path-based ILP formulation for offline RWA in mesh optical networks
2012 ieee global communications conference (globecom), 2990–2995.
TL;DR:
This work introduces the concept of symmetric RWA solutions and presents a new ILP formulation to construct optimally such solutions and demonstrates that the new formulation achieves a decrease of up to two orders of magnitude in running time compared to existing formulations.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2012 journal article
Choice as a Principle in Network Architecture
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 42(4), 105–106.
Contributors: I. Baldine*, K. Calvert *, R. Dutta n , J. Griffioen *, A. Nagurney *, n , T. Wolf *
author keywords: Design; network architecture; innovation; economics
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science; OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2012 article
TOWARD SPECIALIZED UNDERGRADUATE TELECOMMUNICATION ENGINEERING EDUCATION IN THE US
El-Bawab, T. S., Esfandiari, M., Rouskas, G., Jayasumana, A., Kincaid, M., Effenberger, F., … Baniewicz, P. (2012, September). IEEE COMMUNICATIONS MAGAZINE, Vol. 50, pp. 14–16.
TL;DR:
From audio to radio signals, electro-mechanic to electronic technologies, analog to digital systems, and electronic to photonic devices; telecommunications has witnessed tremendous progress on numerous fronts.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2012 journal article
TOWARD SPECIALIZED UNDERGRADUATE TELECOMMUNICATION ENGINEERING EDUCATION IN THE US
Ieee Communications Magazine, 50(9), 14–16.
Source: ORCID
Added: June 21, 2023
2011 journal article
A Dynamic Recursive Unified Internet Design (DRUID)
COMPUTER NETWORKS, 55(4), 919–935.
Contributors: I. Baldine, R. Dutta n , G. Finn, B. Ford *, S. Jordan *, D. Massey*, A. Matta*, C. Papadopoulos *
author keywords: Network architecture; Future internet; Recursive networks; Dynamic stacks
TL;DR:
The DRUID architecture composed of a single recursive block, translation tables, persistent state is described, and its goals and benefits are highlighted, including unifying the data, control, management, and security planes currently considered orthogonal aspects of network architecture.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2011 journal article
A practical fair queuing scheduler: Simplification through quantization
COMPUTER NETWORKS, 55(10), 2392–2406.
author keywords: Packet scheduling; Fair queuing; Tiered service
TL;DR:
TSFQ is presented, a new scheduler that exploits certain properties of Internet traffic to speed up the bottleneck operations related to virtual time computation and packet sorting and it is believed that, for network operators, deploying TSFQ scheduling has the potential to enhance their ability to offer and guarantee a wide range of services.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2011 journal article
Anomalous Loss Performance for Mixed Real-Time and TCP Traffic in Routers With Very Small Buffers
IEEE-ACM TRANSACTIONS ON NETWORKING, 19(4), 933–946.
Contributors: n , V. Sivaraman* & A. Vishwanath *
author keywords: Anomalous loss performance; mixed TCP and real-time traffic; optical packet switched (OPS) networks; routers with very small buffers
TL;DR:
This study is the first to consider interactions between real-time and TCP traffic in very small (potentially all-optical) buffers and informs router manufacturers and network operators of the factors to consider when dimensioning such small buffer sizes for desired performance balance.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2011 journal article
CAUSES OF FOURTH AGED PATIENTS HOSPITALIZATION IN AN INTERNAL MEDICINE HOSPITAL CLINIC
European Journal of Internal Medicine, 22, S108–S109.
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2011 journal article
Demonstration of QoS-Aware Video Streaming over a Metro-Scale Optical Network Using a Cross-Layer Architectural Design
2011 Optical Fiber Communication Conference and Exposition (Ofc/Nfoec) and the National Fiber Optic Engineers Conference.
Contributors: I. Baldine, B. Bathula, K. Bergman, C. Chen, R. Dutta, D. Gurkan, C. Lai, D. Majumder
Source: ORCID
Added: June 21, 2023
2011 journal article
Elsevier OSN is Sad to Announce the Loss of Fabio Neri, co-Editor-in-Chief of the Journal, Distinguished Professor and Researcher
Optical Switching and Networking, 8(4), 286–287.
Sources: Crossref, ORCID, NC State University Libraries
Added: August 28, 2020
2011 journal article
Fast Exact ILP Decompositions for Ring RWA
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 3(7), 577–586.
Contributors: Z. Liu*, * & E. Yetginer
author keywords: Integer linear programming (ILP); Ring networks; Routing and wavelength assignment (RWA)
TL;DR:
A novel and extremely fast technique for obtaining, in a few seconds using commodity CPUs, optimal solutions to instances of maximum size SONET rings with any number of wavelengths; such instances cannot be tackled with classical formulations without vast investments in computational resources and time.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2011 conference paper
On optimal tiered structures for network service bundles
2011 ieee global telecommunications conference (globecom 2011).
TL;DR:
This work considers the problem of determining optimal tiering structures for service bundles using tools from economics and utility theory, and provides insight into the selection and pricing of Internet tiered services.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2011 journal article
Online algorithms for advance resource reservations
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 71(7), 963–973.
Contributors: C. Castillo*, K. Harfoush n & n
author keywords: Grid computing; Advance reservations; Scheduling; Resource allocation; Resource management
TL;DR:
This work uses concepts from computational geometry to present a framework for tackling the resource fragmentation, and for formulating a suite of scheduling strategies, and develops efficient implementations of the scheduling algorithms that scale to large Grids.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2010 journal article
A new framework for GLIF Interdomain Resource Reservation Architecture (GIRRA)
ANNALS OF TELECOMMUNICATIONS, 65(11-12), 723–737.
Contributors: A. Jukan *, G. Karmous-Edwards*, S. Polito* & n
author keywords: Inter-domain networking; Security; Path computation; GLIF; Middleware
TL;DR:
A new architectural framework called Global Lambda Integrated Facility (GLIF) Interdomain Resource Reservation Architecture (GIRRA), which focuses on the inter-dependence between different challenges of inter-domain path provision, and it is built around already existing solutions for intra-domain resource provisioning.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2010 journal article
An economic model for pricing tiered network services
ANNALS OF TELECOMMUNICATIONS, 65(3-4), 147–161.
Contributors: Q. Lv n & n
author keywords: Tiered services; Price structure; Economic model
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2010 journal article
Clustering Methods for Hierarchical Traffic Grooming in Large-Scale Mesh WDM Networks
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2(8), 502–514.
Contributors: B. Chen, R. Dutta* & *
author keywords: Optical networking; Traffic grooming; Network design; Resource provisioning; Hierarchical grooming; Routing; Control plane algorithms; Large networks
TL;DR:
The grooming-specific factors affecting the selection of clusters are identified, a parameterized clustering algorithm is developed that can achieve a desired trade-off among various goals, and the effectiveness of clustering and hierarchical grooming is demonstrated.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2009 journal article
Considerations for Sizing Buffers in Optical Packet Switched Networks
Ieee Infocom 2009 - Ieee Conference on Computer Communications, Vols 1-5, 1323–1331.
Contributors: Ieee, n , V. Sivaraman * & A. Vishwanath
TL;DR:
This study develops a Markov chain model that allows analytical computation of loss, and opens the doors to an analytical understanding of how various factors affect the anomaly, and shows that larger diversity in packet size between TCP and real-time traffic increases the severity of the anomaly.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2009 journal article
ERONs: Dynamic Lightpath Networking via Overlay Control of Static Optical Connections
Ondm: 2009 International Conference on Optical Network Design and Modeling, 1–6.
Source: ORCID
Added: June 21, 2023
2009 journal article
Edge-Reconfigurable Optical Networks (ERONs): Rationale, Network Design, and Evaluation
Journal of Lightwave Technology, 27(12), 1837–1845.
Contributors: L. Battestilli n , G. Karmous-Edwards n, D. Reeves n, n , P. Vegesna n & A. Vishwanath n
author keywords: Dynamic circuits; network design; optical networks
TL;DR:
An algorithm for creating an ERON from an existing topology of static lightpaths is developed, and simulation results that quantify the benefits of ERONs, in terms of the number of light Paths that are needed when compared to a static configuration of independent and dedicated circuits are presented.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries, Crossref
Added: August 6, 2018
2009 book
TL;DR:
A broad perspective is provided, with topics including innovations at the physical/transmission layer in wired and wireless media, as well as the support for new switching and routing paradigms at the device and sub-system layer.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2009 journal article
On Bandwidth Tiered Service
IEEE-ACM TRANSACTIONS ON NETWORKING, 17(6), 1780–1793.
author keywords: Directional p-median; dynamic programming; optimization; Tiered service
TL;DR:
This work provides a systematic framework for reasoning about and tackling algorithmically the general problem of service tier selection, and has applications to a number of networking contexts, including access networks and core networks.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2008 journal article
A Hierarchical Model for Multigranular Optical Networks
2008 5th International Conference on Broadband Communications, Networks and Systems (Broadnets 2008), 444–451.
Contributors: R. Dutta n, Ieee, M. Iyer & n
TL;DR:
This algorithm focuses on lowering the number of wavelengths W and ports over the network while being conceptually simple, scalable, and consistent with the way networks are operated and controlled in practice.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2008 journal article
A New Internet Architecture to Enable Software Defined Optics and Evolving Optical Switching Models
2008 5th International Conference on Broadband Communications, Networks and Systems (Broadnets 2008), 71–76.
Contributors: I. Baldine, R. Dutta n, Ieee &
TL;DR:
This paper provides an update on the current status of the SILO architecture and the prototype software implementation and introduces the concept of ldquosoftware defined opticsrdquo (SDO) to refer to the emerging intelligent and programmable optical layer.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2008 journal article
Edge Reconfigurable Optical Network (ERON): Enabling Dynamic Sharing of Static Lightpaths
2008 5th International Conference on Broadband Communications, Networks and Systems (Broadnets 2008), 332–334.
Contributors: L. Battestilli n, Ieee, G. Karmous-Edwards, D. Reeves n, n , P. Vegesna n, A. Vishwanath n
TL;DR:
This paper describes the key concepts involved in the design of an efficient ERON network combined with routing and reservation algorithms to assure low blocking probabilities and describes the management and control architecture and protocols required to provide end-user/application control of the dynamic lightpaths.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2008 chapter book
Grooming Mechanisms in SONET/SDH and Next-Generation SONET/SDH
TL;DR:
The move to optical transmission systems was accompanied by a move to a synchronous architecture, which means that SONET/SDH performs multiplexing in a strictly time division multiplexed, and the distinctions between the two are not important.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 26, 2023
2008 chapter
Hierarchical Traffic Grooming
In R. Dutta, A. E. Kamal, & G. N. Rouskas (Eds.), Optical Networks (pp. 73–88).
TL;DR:
Hierarchical traffic grooming techniques for networks with a special topology are surveyed in Section 1.2.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2008 chapter book
Introduction
Sources: Crossref, NC State University Libraries
Added: June 26, 2023
2008 journal article
On Hierarchical Traffic Grooming in WDM Networks
IEEE-ACM TRANSACTIONS ON NETWORKING, 16(5), 1226–1238.
author keywords: Hierarchical traffic grooming; K-center; optical networks; wavelength division multiplexing (WDM)
TL;DR:
Comparisons to lower bounds indicate that hierarchical grooming is efficient in its use of the network resources of interest, namely, electronic ports and wavelengths.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2008 book
TL;DR:
This paper will concern you to try reading traffic grooming for optical networks as one of the reading material to finish quickly.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2007 journal article
A practical and efficient implementation of WF(2)Q+
2007 Ieee International Conference on Communications, Vols 1-14, 172–176.
TL;DR:
A new implementation of WF2Q+ is presented in which both the number of packet sorting operations and the computation of the virtual time function are independent of the number n of flows.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: ORCID
Added: June 21, 2023
2007 chapter
A unified software architecture to enable cross-layer design in the future Internet
In Proceedings - 16th International Conference on Computer Communications and Networks, Vols 1-3 (pp. 26–32).
Source: ORCID
Added: June 21, 2023
2007 chapter
Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks
In Optical Network Design and Modeling (pp. 249–258).
TL;DR:
This work identifies the grooming-specific factors affecting the selection of clusters, and develops a parameterized clustering algorithm that can achieve a desired tradeoff among various goals.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2007 journal article
Framework for tiered service in MPLS networks
Infocom 2007, Vols 1-5, 1577–1585.
TL;DR:
This work provides a theoretical framework for reasoning about and tackling algorithmically the general problem of service tier selection as a p-median problem under a new directional distance measure, and develops efficient algorithms for a number of important variants.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2007 journal article
Generalized wavelength sharing policies for absolute QoS guarantees in OBS networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 25(4), 93–104.
Contributors: n & L. Yang n
author keywords: optical burst switching; wavelength division multiplexing; resource sharing policies; quality of service
TL;DR:
A parameterized model for wavelength sharing is presented which provides for isolation among different traffic classes while also making efficient use of wavelength capacity through statistical multiplexing and a heuristic to optimize the policy parameters for a single link of an OBS network is developed.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2007 journal article
Optimal wavelength sharing policies in OBS networks subject to QoS constraints
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 25(9), 40–49.
Contributors: n & L. Yang *
author keywords: optical burst switching (OBS) networks; wavelength reservations; quality of service; Markov decision process; randomized threshold policies
TL;DR:
This work employs Markov decision process (MDP) theory to obtain optimal wavelength sharing policies for two performance objectives, namely, maximization of weighted network throughput and minimization of the loss rate of best-effort traffic, while meeting the QoS guarantees.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2007 journal article
TDM emulation in packet-switched networks
2007 Ieee International Conference on Communications, Vols 1-14, 1911–1916.
TL;DR:
This work studies the problem of designing a tiered-service network that allocates bandwidth in multiples of a basic bandwidth unit, and can enjoy many of the benefits of a TDM network, but without the associated data plane rigidities.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2007 journal article
The SILO architecture for services integration, control, and optimization for the future Internet
2007 Ieee International Conference on Communications, Vols 1-14, 1899–1904.
Contributors: I. Baldine, A. Bragg*, R. Dutta n, Ieee, & D. Stevenson*
TL;DR:
This position paper takes a holistic view of network design, allowing applications to work synergistically with the network architecture and physical layers to select the most appropriate functional blocks and tune their behavior so as to meet the application's needs within resource availability constraints.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Source: ORCID
Added: June 21, 2023
2007 journal article
The directional p-median problem: Definition, complexity, and algorithms
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 179(3), 1097–1108.
Contributors: L. Jackson n, n & M. Stallmann n
author keywords: directional p-median problem; traffic quantization; vector quantization
TL;DR:
This paper treats the p-median problem under a new distance measure, the directional rectilinear distance, which requires the assigned supply point for a given demand point to lie above and to the right of it, and presents an efficient heuristic to solve it.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2006 journal article
Adaptive path selection in OBS networks
Journal of Lightwave Technology, 24(8), 3002–3011.
Contributors: * & L. Yang n
TL;DR:
The authors investigate the concept of adaptive path selection in optical burst-switched networks and its potential to reducing the overall burst drop probability and present a suite of path selection strategies, each utilizing a different type of information regarding the link congestion status, and evaluate them using simulation.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2006 conference paper
Dynamic wavelength sharing policies for absolute QoS in OBS networks
Globecom 2006 - 2006 ieee global telecommunications conference.
TL;DR:
This work considers the problem of providing absolute QoS guarantees to multiple classes of users of an OBS network in terms of the end-to-end burst loss and employs Markov decision process (MDP) theory to develop wavelength sharing policies that maximize throughput while meeting the QoS guarantee.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: NC State University Libraries
Added: August 6, 2018
2006 chapter
Optical Packet Switching (OPS)
In K. Sivalingam & S. Subramanian (Eds.), Optical Networks (pp. 797–843).
Ed(s): K. Sivalingam & S. Subramanian
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2006 journal article
Traffic grooming in WDM ring networks to minimize the maximum electronic port cost.
Optical Switching and Networking, 2(1), 1–18.
Source: NC State University Libraries
Added: August 6, 2018
2006 journal article
Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 24(4), 66–82.
author keywords: optical; networks; networking; traffic grooming; virtual topology
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2005 journal article
A detailed analysis and performance comparison of wavelength reservation schemes for optical burst switched networks
PHOTONIC NETWORK COMMUNICATIONS, 9(3), 311–335.
Contributors: n & J. Teng n
author keywords: optical burst switching; wavelength reservation; just-in-time signaling
TL;DR:
The major finding is that, under reasonable assumptions regarding the current and future state-of-the-art in optical switch and electronic hardware technologies, the simplicity of JIT and JIT+ seem to outweigh any performance benefits of Horizon and JET.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2005 journal article
An Intra- and Inter-Domain Routing Architecture for Optical Burst Switched (OBS) Networks
2nd International Conference on Broadband Networks (Broadnets 2005), 150-+.
TL;DR:
An intra- and inter-domain routing architecture for just-in-time (JIT) optical burst switched networks and distinguishes between routing for bursts and ancillary signaling messages ("data plane routing"), and routing for other management and control messages ("control plane routing").
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2005 chapter
Applying clustering techniques to general topology traffic grooming
In Proceedings of IEEE / Create-net broadnets 2005 (pp. 308–314). Piscataway, N.J.: IEEE.
Source: NC State University Libraries
Added: August 6, 2018
2005 journal article
Editorial
Optical Switching and Networking, 1(1), 1–2.
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2005 chapter
On the application of k-center algorithms in heirarchical traffic grooming
In Proceedings of the Second International IEEE/Create-net workshop on traffic grooming (pp. 167–176). Los Alamitos, CA: IEEE Computer Society.
Source: NC State University Libraries
Added: August 6, 2018
2005 chapter
Path Switching in OBS Networks
In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems (Vol. 3462, pp. 406–418).
TL;DR:
This work presents a suite of path switching strategies, each utilizing a different type of information regarding the link congestion status, and evaluates them using simulation, demonstrating that, in general, path switching outperforms shortest path routing.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 6, 2018
2005 chapter
Path switching in OBS networks
In Networking 2005: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems (Vol. 3462, pp. 406–418).
Source: ORCID
Added: June 21, 2023
2005 chapter
Scheduling Algorithms for Unicast, Multicast, and Broadcast
In K. Sivalingam & S. Subramanian (Eds.), The International Series in Engineering and Computer Science (pp. 171–188).
Ed(s): K. Sivalingam & S. Subramanian
TL;DR:
This chapter presents a survey of algorithms for scheduling packet traffic in broadcast optical WDM networks with an emphasis on scheduling techniques for providing best-effort service as well as guaranteed service for both unicast and multi-destination traffic.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2005 journal article
Selected papers from Optical Network Design and Modeling (ONDM) 2005 conference
Optical Switching and Networking, 2(4), 199–200.
TL;DR:
This issue of OSN contains six papers that were presented in preliminary form at the 9th Conference on Optical Network Design and Modeling (ONDM 2005), held in Milan, Italy, on February 7–9, 2005, and comprised 12 technical sessions and a poster session.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2005 journal article
Selected papers from the BROADNETS 2004 Optical Networking Symposium
Optical Switching and Networking, 2(2), 71.
TL;DR:
This invention provides fungicidal compositions comprising as an active ingredient a compound having the general formula (I) or a stereoisomer thereof, wherein one of X and Y represents hydrogen and the other represents the group in which R is hydrogen, methyl or ethyl.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2005 journal article
Traffic engineering approach to path selection in optical burst switching networks
Journal of Optical Networking, 4(11), 759–777.
TL;DR:
This work takes a traffic engineering approach to path selection in OBS networks with the objective of balancing the traffic across the network links to reduce congestion and to improve overall performance.
(via Semantic Scholar)
Sources: ORCID, NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2005 journal article
Traffic grooming in WDM ring networks to minimize the maximum electronic port cost
Optical Switching and Networking, 2(1), 1–18.
TL;DR:
This work presents new theoretical results which demonstrate that traffic grooming with the Min-Max objective is NP-complete even when wavelength assignment is not an issue, and presents new polynomial-time traffic grooming algorithms for minimizing the maximum electronic port cost in both unidirectional and bidirectional rings.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2005 journal article
Wavelength selection in OBS networks using traffic engineering and priority-based concepts
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 23(8), 1658–1669.
Contributors: n & J. Teng n
author keywords: optical burst switching (OBS); traffic engineering; wavelength assignment
TL;DR:
It is indicated that, in the absence of full conversion capabilities, intelligent choices in assigning wavelengths to bursts at the source can have a profound effect on the burst drop probability in an OBS network.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2004 journal article
A study of path protection in large-scale optical networks
PHOTONIC NETWORK COMMUNICATIONS, 7(3), 267–278.
author keywords: survivability; large-scale optical networks; topology design
TL;DR:
It is found that, using shared path protection schemes, it is possible to build cost-effective survivable networks that provide rich connectivity among client nodes with only a modest additional amount of resources over a network with no survivability properties.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2004 journal article
Light-tree routing under optical power budget constraints [Invited]
Journal of Optical Networking, 3(5), 282.
TL;DR:
This work defines a new constrained light-tree routing problem by introducing a set of constraints on the source-destination paths to account for the power losses at the optical layer, and develops a suite of corresponding routing algorithms.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2004 chapter
Optical Network Engineering
In S. Dixit (Ed.), IP over WDM (pp. 299–327).
Ed(s): S. Dixit
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2004 chapter
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
In Lecture Notes in Computer Science (Vol. 3042, pp. 174–185).
TL;DR:
It is proved that traffic grooming with the Min-Max objective is NP-Complete even when wavelength assignment is not an issue and a new polynomial-time algorithm is presented which produces solutions which are always close to the optimal and the lower bound.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2003 journal article
A simulation study of optical burst switching and access protocols for WDM ring networks
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 41(2), 143–160.
author keywords: optical burst switching; ring; MAN; access protocols
TL;DR:
This work considers a wavelength division multiplexing metro ring architecture with optical burst switching with five different burst switching access protocols, and their performance and fairness is evaluated by simulation.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2003 article
Access protocols for optical burst-switched ring networks
Xu, L. S., Perros, H. G., & Rouskas, G. N. (2003, January). INFORMATION SCIENCES, Vol. 149, pp. 75–81.
author keywords: optical burst switching; ring; MAN; access protocols
TL;DR:
This paper considers a WDM metro ring architecture with optical burst switching with several access protocols proposed and their performance is analyzed by simulation.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2003 journal article
Computing call-blocking probabilities in leo satellite constellations
IEEE Transactions on Vehicular Technology, 52(3), 622–636.
author keywords: call blocking; handoffs; low earth orbit (LEO) satellite constellations
TL;DR:
An analytical model for computing call- blocking probabilities in a low Earth orbit (LEO) satellite network that carries voice calls and derives an upper and lower bound for the link-blocking probabilities that can be computed efficiently.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries, Crossref
Added: August 6, 2018
2003 journal article
Jumpstart just-in-time signaling protocol: a formal description using extended finite state machines
Optical Engineering, 42(2), 568–585.
Contributors: I. Baldine, M. Cassada, H. Perros, , D. Stevenson & A. Zaim
TL;DR:
An eight-tuple extended finite state machine (EFSM) model is applied to formally specify the protocol for a just-in-time (JIT) signaling scheme running over a core dense wavelength division multiplexing (DWDM) network that utilizes optical burst switches (OBSs).
(via Semantic Scholar)
Sources: ORCID, NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2003 journal article
Multicast and QoS in the Jumpstart Architecture for WDM Burst-Switched Networks
Optical Networks, 4(6), 68–80.
Source: NC State University Libraries
Added: July 22, 2023
2003 chapter
On optimal traffic grooming in elemental network topologies
In Opticomm 2003: Optical Networking and Communications (Vol. 5285, pp. 13–24).
Contributors: R. Dutta n, S. Huang n, n , A. Somani & Z. Zhang
TL;DR:
This work settles the complexity of traffic grooming in path and star networks by proving that a number of variants of the problem are computationally hard, and designs practical grooming algorithms with provable properties for all three topologies.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2003 conference paper
On optimal traffic grooming in elemental network topologies.
Proceedings of Opticomm 2003, 5285.
Source: NC State University Libraries
Added: August 6, 2018
2003 journal article
On the physical and logical topology design of large-scale optical networks
Journal of Lightwave Technology, 21(4), 904–915.
Contributors: H. Perros, & Y. Xin
Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018
2003 journal article
Optical layer multicast: Rationale, building blocks, and challenges
IEEE NETWORK, 17(1), 60–65.
TL;DR:
The underlying principles and essential components for a practical optical multicast service are examined and a set of key research challenges are presented along with a survey of the literature.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2003 journal article
Optimal quantization of periodic task requests on multiple identical processors
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 14(8), 795–806.
Contributors: L. Jackson n & n
author keywords: multiprocessor scheduling; periodic tasks scheduling; quantization
TL;DR:
This work defines the periodic task quantization problem with deterministic input (PTQ-D) and presents an optimal polynomial time dynamic programming solution, and presents a fast online algorithm that schedules quantized periodic tasks.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2003 chapter
Performance analysis of an edge optical burst switching node with a large number of wavelengths
In Providing Quality of Service in Heterogeneous Environments, Vols 5a and 5b: Vol. 5A-B (pp. 891–900).
Source: ORCID
Added: June 21, 2023
2003 chapter
Routing and Wavelength Assignment in Optical WDM Networks
In J. Proakis (Ed.), Wiley Encyclopedia of Telecommunications.
Ed(s): J. Proakis
TL;DR:
The routing and wavelength assignment (RWA) problem in optical networks employing wavelength division multiplexing (WDM) technology is discussed, and both point-to-point and multicast traffic demands are considered.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 2, 2023
2003 conference paper
Traffic grooming in path, star and tree networks: complexity, bounds, and algorithms
Proceedings of the ACM Sigmetrics, International Conference on Measurement and Modeling of Computer Systems, 298–299.
TL;DR:
This work presents a wealth of results which settle the complexity of traffic grooming in path and star networks, by proving that a number of variants of the problem are computationally intractable.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2002 chapter
A Simulation Study of Access Protocols for Optical Burst-Switched Ring Networks
In E. Gregori, M. Conti, A. T. Campbell, G. Omidyar, & M. Zukerman (Eds.), NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications (pp. 863–874).
Ed(s): E. Gregori, M. Conti, A. Campbell, G. Omidyar & M. Zukerman
TL;DR:
This paper considers a WDM metro ring architecture with optical burst switching with several access protocols proposed and their performance is analyzed by simulation.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2002 chapter
A tutorial on optical networks
In G. A. E. Gregori & S. Basagni (Eds.), Advanced lectures on networking: Networking 2002 tutorials (Vol. 2497, pp. 155–193). Berlin; New York: Springer.
Ed(s): G. E. Gregori & S. Basagni
Source: NC State University Libraries
Added: August 6, 2018
2002 journal article
Access protocols for optical burst-switched ring networks
Proceedings of the 6th Joint Conference on Information Sciences, 1287–1290.
Contributors: H. Caulfield, S. Chen, R. Duro, V. Honavar, E. Kerre, M. Lu, H. Perros, M. Romay
Source: ORCID
Added: June 21, 2023
2002 journal article
Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 20(1), 89–96.
author keywords: blocking probabilities; multicast; multiclass networks; wavelength-division multiplexing (WDM); wavelength routing
TL;DR:
An approximate analytical method is presented to compute efficiently the call-blocking probabilities in wavelength-routing networks with multiple classes of both unicast and multicast calls to decompose large networks with multicast paths into smaller subsystems with only linear paths.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2002 journal article
Computing call-blocking probabilities in LEO satellite networks: The single-orbit case
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 51(2), 332–347.
author keywords: call blocking probability; decomposition algorithms; handoffs; low-earth-orbit (LEO) satellite networks
TL;DR:
This work study the problem of carrying voice calls over a low-Earth-orbit satellite network and presents an analytical model for computing call-blocking probabilities for a single orbit of a satellite constellation and devised a method to solve the corresponding Markov process efficiently.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2002 journal article
Deterministic preemptive scheduling of real-time tasks
COMPUTER, 35(5), 72-+.
Contributors: L. Jackson* & *
TL;DR:
Algorithms for the preemptive scheduling of deterministic, real-time tasks can have applications in providing quality-of-service guarantees to packet flows in multichannel optical networks.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2002 chapter
Formal description of the jumpstart just-in-time signaling protocol using EFSM
In Opticomm 2002: Optical Networking and Communications (Vol. 4874, pp. 160–173).
TL;DR:
An eight-tuple extended finite state machine (EFSM) model is applied to formally specify the protocol for a Just-In-Time (JIT) signaling scheme running over a core dWDM network which utilizes Optical Burst Switches.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2002 chapter
Helios: A Broadcast Optical Architecture
In NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications (pp. 887–898).
TL;DR:
A new all-optical broadcast LAN architecture and an accompanying signaling protocol that allows it to achieve high throughput in a broadcast environment and the flexibility of the design allows different schedulers to be used.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(OpenAlex)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2002 chapter
JumpStart: A Just-in-Time Signaling Architecture for WDM Burst-Switched Networks
In E. Gregori, M. Conti, A. T. Campbell, G. Omidyar, & M. Zukerman (Eds.), NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications (pp. 1081–1086).
Ed(s): E. Gregori, M. Conti, A. Campbell, G. Omidyar & M. Zukerman
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2002 journal article
JumpStart: A just-in-time signaling architecture for WDM burst-switched networks
IEEE COMMUNICATIONS MAGAZINE, 40(2), 82–89.
Contributors: I. Baldine, H. Perros n, n & D. Stevenson*
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2002 journal article
MTCP: scalable TCP-like congestion control for reliable multicast
COMPUTER NETWORKS, 38(5), 553–575.
Contributors: N. Balaguru n, I. Rhee n & n
author keywords: reliable multicast; congestion control
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2002 journal article
Multi-Destination Communication in Broadcast WDM Networks: A Survey
Optical Networks, 3(1), 34–44.
Source: NC State University Libraries
Added: July 22, 2023
2002 journal article
On optimal traffic grooming in WDM rings
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 20(1), 110–121.
Contributors: R. Dutta n & n
author keywords: bounds; electronic grooming; heuristics; light-path; optical ring; SONET; traffic grooming; wavelength routing
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2002 chapter
Performance Analysis of LEO Satellite Networks
In E. Gregori, M. Conti, A. T. Campbell, G. Omidyar, & M. Zukerman (Eds.), NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications (pp. 790–801).
Ed(s): E. Gregori, M. Conti, A. Campbell, G. Omidyar & M. Zukerman
TL;DR:
An analytical model for computing call blocking probabilities in a LEO satellite network that carries voice calls is presented, and it is demonstrated that the method is accurate for a wide range of traffic patterns.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020
2002 journal article
Traffic grooming in WDM networks: past and future
IEEE Network, 16(6), 46–56.
Contributors: R. Dutta n & n
TL;DR:
A comprehensive comparative survey of the literature that unveils the significant amount of research on this subject and offers a broad set of ambitious research directions that are motivated by the exciting new challenges arising with the advent of MP/spl lambda/S technology.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries, Crossref
Added: August 6, 2018
2001 conference paper
On optimal traffic grooming in WDM rings.
Proceedings of ACM sigmetrics/performance 2001, 164–174.
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2001 chapter
On scheduling problems with applications to packet-switched optical WDM networks
In Opticomm 2001: Optical Networking and Communications (Vol. 4599, pp. 163–172).
TL;DR:
A more refined version of list scheduling is given and it is proved to be a 2-approximation algorithm for both the off-line and the on- line contexts.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2001 journal article
Techniques for optical packet switching and optical burst switching
IEEE COMMUNICATIONS MAGAZINE, 39(1), 136–142.
TL;DR:
A survey of two new technologies which are still in the experimental stage-optical packet switching and optical burst switching-and comment on their suitability for transporting IP traffic.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: Web Of Science, ORCID
Added: August 6, 2018
2001 journal article
Traffic adaptive WDM networks: A study of reconfiguration issues
JOURNAL OF LIGHTWAVE TECHNOLOGY, 19(4), 433–455.
author keywords: broadcast optical networks; Markov decision process; reconfiguration policies; wavelength-division multiplexing (WDM)
TL;DR:
This paper develops and compares reconfiguration policies to determine when to reconfigure the network, and presents an approach to carry out the network transition by describing a class of strategies that determine how to retune the optical transceivers.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2000 journal article
A Survey of virtual topology design algorithms for wavelength routed networks.
Optical Networks Magazine, 1(1), 73–89.
Source: NC State University Libraries
Added: August 6, 2018
2000 journal article
A comparison of allocation policies in wavelength routing networks
PHOTONIC NETWORK COMMUNICATIONS, 2(3), 267–295.
author keywords: wavelength division multiplexing; wavelength routing networks; call blocking probability; wavelength allocation
TL;DR:
The main conclusion of this work is that the gains obtained by employing specialized and expensive hardware can be realized cost-effectively by making more intelligent choices in software, namely, the wavelength allocation policy.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2000 article
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
Zhu, Y. H., Rouskas, G. N., & Perros, H. G. (2000, December). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 8, pp. 747–762.
author keywords: call-blocking probability; converter placement; decomposition algorithms; wavelength-division multiplexing; wavelength-routing networks
TL;DR:
An iterative path decomposition algorithm is presented to evaluate accurately and efficiently the blocking performance of such networks with and without wavelength converters to represent a simple and computationally efficient solution to the difficult problem of computing call-blocking probabilities in wavelength-routing networks.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2000 journal article
A reservation protocol for broadcast WDM networks and stability analysis
COMPUTER NETWORKS, 32(2), 211–227.
Contributors: n & V. Sivaraman*
author keywords: single-hop optical networks; wavelength division multiplexing (WDM); reservation protocols; Markov modulated Bernoulli process (MMBP)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2000 chapter
Computing blocking probabilities in multi-class wavelength routing networks
In Networking 2000: Broadband communications, high performance networking, and performance of communication networks / IFIP-TC6/European Commission International Conference, Paris, France, May 2000, proceedings (Vol. 1815, pp. 176–188). Berlin; New York: Springer.
Source: NC State University Libraries
Added: August 6, 2018
2000 journal article
Computing blocking probabilities in multiclass wavelength routing networks
ACM Transactions on Modeling and Computer Simulation, 10(2), 87–103.
TL;DR:
An approximate analytical method is presented to evaluate efficiently and accurately the call blocking probabilities in wavelength routing networks with multiple classes of calls and it is shown that path decomposition algorithms for single-class wavelengths routing networks may be readily extended to the multiclass case.
(via Semantic Scholar)
Source: Crossref
Added: June 26, 2023
2000 chapter
Design of logical topologies for wavelength routed networks.
In K. M. Sivalingam & S. Subramaniam (Eds.), Optical WDM networks: Principles and practice (pp. 79–102). Boston: Kluwer Academic Publishers.
Ed(s): . K. M. Sivalingam & S. Subramaniam
Source: NC State University Libraries
Added: August 6, 2018
2000 article
Guest editorial - Protocols and architectures for next generation optical WDM networks
Gerstel, O., Li, B., McGuire, A., Rouskas, G., Sivalingam, K. M., Zhang, Z. S., & Ramaswami, R. (2000, October). IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, Vol. 18, pp. 1805–1809.
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2000 journal article
Maximizing multicast throughput in WDM networks with tuning latencies using the virtual receiver concept
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 11(1), 63–72.
Contributors: Z. Ortiz n, H. Perros n & n
TL;DR:
This work introduces the midticcut rhroughprrt as the performance measure of interest, and presents a new technique for the transmission of multicast packets based on the concept of a Lzirninl receiver, a set of physical receivers which behave identically in terms of tuning.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2000 journal article
Scheduling combined unicast and multicast traffic in broadcast WDM networks
PHOTONIC NETWORK COMMUNICATIONS, 2(2), 135–153.
Contributors: Z. Ortiz*, H. Perros n & n
author keywords: broadcast optical networks; wavelength division multiplexing (WDM); scheduling; multicast
TL;DR:
This paper studies the performance of various strategies for scheduling a combined load of unicast and multicast traffic in a broadcast WDM network, and concludes that treating unicast traffic as a special case of multicasts with a group of size 1, produces short schedules in most cases.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
1999 chapter
Dynamic reconfiguration policies for WDM networks
In Ieee Infocom '99 - the Conference on Computer Communications, Vols 1-3, Proceedings (pp. 313–320).
TL;DR:
This is the first in-depth study of the tradeoffs involved in carrying out the reconfiguration process, and applies results from Markov decision process theory to obtain optimal reconfigurations policies for networks of large size.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: ORCID
Added: June 21, 2023
1999 chapter
MTCP: Scalable TCP-like congestion control for reliable multicast
In Ieee Infocom '99 - the Conference on Computer Communications, Vols 1-3, Proceedings (pp. 1265–1273).
TL;DR:
This work presents MTCT, a congestion control scheme for large-scale reliable multicast that incorporates several novel features, and proposes new techniques that can effectively handle instances of congestion occurring simultaneously at various parts of a multicast tree.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: ORCID
Added: June 21, 2023
1999 journal article
Performance analysis of broadcast WDM networks under IP traffic
PERFORMANCE EVALUATION, 36-7, 333–358.
Contributors: M. McKinnon*, H. Perros n & n
author keywords: optical networks; wavelength division multiplexing (WDM); discrete-time queueing networks; IP packets
TL;DR:
This work develops and analyzes approximately a queueing model of the network in order to obtain the queue-length distribution and loss probabilities at the transmitting and receiving side of nodes and is the first comprehensive performance study of optical local area networks under variable length packets.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
1999 journal article
Reconfiguration and dynamic load balancing in broadcast WDM networks
PHOTONIC NETWORK COMMUNICATIONS, 1(1), 49–64.
author keywords: broadcast optical networks; wavelength division multiplexing (WDM); reconfiguration; dynamic load balancing
TL;DR:
This paper presents a new approximation algorithm for the load balancing problem that provides for tradeoff selection, using a single parameter, between two conflicting goals, namely, the degree of load balancing and the number of transceivers that need to be retuned.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
1998 chapter
On the design of dynamic reconfiguration policies for broadcast WDM networks
In All-Optical Networking: Architecture, Control, and Management Issues (Vol. 3531, pp. 146–157).
TL;DR:
This is the first in-depth study of the tradeoffs involved in carrying out the reconfiguration process and applies results from Markov Decision Process theory to obtain optimal reconfigurations policies even for networks of large size.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
1998 journal article
Performance analysis of a photonic single-hop ATM switch architecture, with tunable transmitters and fixed frequency receivers
PERFORMANCE EVALUATION, 33(2), 113–136.
Contributors: M. McKinnon*, H. Perros n & n
author keywords: optical networks; photonic ATM switch architecture; Markov modulated Bernoulli process (MMBP); wavelength division multiplexing (WDM); discrete-time queueing networks
TL;DR:
The performance of the switch is a complex function of a number of system parameters, including the load balancing and scheduling algorithms, the number of available channels, and the buffer capacity, and it is shown that the behavior of theswitch in terms of cell-loss probability as these parameters are varied cannot be predicted without an accurate analysis.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
1997 article
Multicast routing with end-to-end delay and delay variation constraints
Rouskas, G. N., & Baldine, I. (1997, April). IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, Vol. 15, pp. 346–356.
Contributors: I. Baldine & n
author keywords: delay constrained multicast communication; multicast routing
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
1997 article
Multidestination communication over tunable-receiver single-hop WDM networks
Rouskas, G. N., & Ammar, M. H. (1997, April). IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, Vol. 15, pp. 501–511.
Contributors: M. Ammar * & n
author keywords: adaptive multicast protocols; multidestination communication; optical WDM networks
TL;DR:
One of the major contributions is the development of a suite of adaptive multicast protocols which are simple to implement, and have good performance under changing multicast traffic conditions.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
1997 article
Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies
Rouskas, G. N., & Sivaraman, V. (1997, June). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 5, pp. 359–370.
Contributors: n & V. Sivaraman n
author keywords: optical networks; packet scheduling tuning latency; wavelength-division multiplexing
TL;DR:
It is shown that it is possible to appropriately dimension the network to minimize the effects of even large values of the tuning latency, and develop heuristics which give schedules of length equal or very close to the lower bound.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
1996 chapter
Multicast routing with end-to-end delay and delay variation constraints
In Ieee Infocom '96 - Fifteenth Annual Joint Conference of the Ieee Computer and Communications Societies: Networking the Next Generation, Proceedings Vols 1-3 (pp. 353–360).
Source: ORCID
Added: June 21, 2023
1996 chapter
On the design of optimal TDM schedules for broadcast WDM networks with arbitrary transceiver tuning latencies
In Ieee Infocom '96 - Fifteenth Annual Joint Conference of the Ieee Computer and Communications Societies: Networking the Next Generation, Proceedings Vols 1-3 (pp. 1217–1224).
Source: ORCID
Added: June 21, 2023
1995 journal article
ANALYSIS AND OPTIMIZATION OF TRANSMISSION SCHEDULES FOR SINGLE-HOP WDM NETWORKS
Ieee-Acm Transactions on Networking, 3(2), 211–221.
Contributors: M. Ammar * & n
Source: ORCID
Added: June 21, 2023
1995 journal article
Dynamic Reconfiguration in Multihop WDM Networks
Journal of High Speed Networks, 4(3), 221–238.
TL;DR:
This work considers multichannel multihop lightwave networks with stations equipped with a small number of transmitters and receivers and proposes an algorithm for obtaining policies that make decisions similar to the decisions of the optimal policy.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 26, 2023
1995 journal article
ON THE PERFORMANCE OF PROTOCOLS FOR COLLECTING RESPONSES OVER A MULTIPLE-ACCESS CHANNEL
Ieee Transactions on Communications, 43(2-4), 412–420.
Contributors: M. Ammar * & n
Source: ORCID
Added: June 21, 2023
1993 journal article
ANALYSIS AND OPTIMIZATION OF TRANSMISSION SCHEDULES FOR SINGLE-HOP WDM NETWORKS
Ieee Infocom 93 : the Conference on Computer Communications, Proceedings, Vols 1-3, 1342–1349.
Contributors: M. Ammar *, Ieee &
TL;DR:
The authors define a wide variety of schedules and develop a general framework for analyzing their throughput performance for any number of available wavelengths, any tunability characteristics, and general (potentially nonuniform) traffic patterns.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
1991 journal article
ON THE PERFORMANCE OF PROTOCOLS FOR COLLECTING RESPONSES OVER A MULTIPLE-ACCESS CHANNEL
Ieee Infocom 91, the Conference on Computer Communications, Proceedings Vols 1-3, 1490–1499.
Contributors: M. Ammar *, Ieee &
TL;DR:
A generalization of the multiple access problem is considered where it is necessary to identify a subset of the ready users, not all, and a suite of protocols that can be used to achieve these objectives is investigated.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
conference paper
A framework for hierarchical traffic grooming in WDM networks of general topology
Chen, B. S., Rouskas, G. N., & Dutta, R. 2nd International Conference on Broadband Networks (Broadnets 2005), 167-.
Source: NC State University Libraries
Added: August 6, 2018
conference paper
ChoiceNet: Network innovation through choice
Rouskas, G. N., Baldine, I., Calvert, K., Dutta, R., Griffioen, J., Nagurney, A., & Wolf, T. 2013 17th International Conference on Optical Networking Design and Modeling (ONDM), 1–6.
Source: NC State University Libraries
Added: August 6, 2018
book
Internet tiered services: Theory, economics, and quality of service
Rouskas, G. N. New York : Springer.
Source: NC State University Libraries
Added: August 6, 2018
journal article
Lightpath management in SDN-based elastic optical networks with power consumption considerations
Xiong, Y., Shi, J., Yang, Y. Y., Lv, Y., & Rouskas, G. N. Journal of Lightwave Technology, 36(9), 1650–1660.
Source: NC State University Libraries
Added: August 6, 2018
conference paper
Link selection algorithms for link-based ilps and applications to RWA in mesh networks
Liu, Z. Y., & Rouskas, G. N. 2013 17th International Conference on Optical Networking Design and Modeling (ONDM), 59–64.
Source: NC State University Libraries
Added: August 6, 2018
conference paper
On optimal sizing of tiered network services
Lv, Q., & Rouskas, G. N. 27th IEEE Conference on Computer Communications (Infocom), vols 1-5, 1–5.
Source: NC State University Libraries
Added: August 6, 2018
conference paper
On the application of k-center algorithms to hierarchical traffic grooming
Chen, B. S., Dutta, R., & Rouskas, G. N. 2nd International Conference on Broadband Networks (Broadnets 2005), 295-.
Source: NC State University Libraries
Added: August 6, 2018
journal article
Scheduling-inspired spectrum assignment algorithms for mesh elastic optical networks
Fayez, M., Katib, I., Rouskas, G. N., & Faheem, H. M. Advances in Computer Communications and Networks: from Green, Mobile, Pervasive Networking to Big Data Computing, 225–244.
Source: NC State University Libraries
Added: August 6, 2018
conference paper
Secure burst control packet scheme for optical burst switching networks
Coulibaly, Y., Al-Kilany, A. A. I., Abd Latiff, M. S., Rouskas, G., Mandala, S., & Razzaque, M. A. 2015 IEEE International Broadband and Photonics Conference (IBP), 91–96.
Source: NC State University Libraries
Added: August 6, 2018
conference paper
The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective
Talebi, S., Bampis, E., Lucarelli, G., Katib, I., & Rouskas, G. N. 2014 International Conference on Optical Network Design and Modeling, 55–60.
Source: NC State University Libraries
Added: August 6, 2018
conference paper
Topology design in WDM rings to minimize electronic routing: efficient comutation of tight bounds.
Dutta, R., & Rouskas, G. N. Proceedings of the 38th Allerton Conference on Communication, Control and Computing, 1284–1293.
Source: NC State University Libraries
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
