@article{maeng_ozdemir_guvenc_sichitiu_dutta_mushi_2023, title={AERIQ: SDR-Based LTE I/Q Measurement and Analysis Framework for Air-to-Ground Propagation Modeling}, ISSN={["1095-323X"]}, DOI={10.1109/AERO55745.2023.10115787}, abstractNote={In this paper, we introduce AERIQ: a software-defined radio (SDR) based I/Q measurement and analysis framework for wireless signals for aerial experimentation. AERIQ is integrated into controllable aerial vehicles, it is flexible, repeatable, and provides raw I/Q samples for post-processing the data to extract various key parameters of interest (KPIs) over a 3D volume. Using SDRs, we collect I/Q data with unmanned aerial vehicles (UAVs) flying at various altitudes in a radio dynamic zone (RDZ) like outdoor environment, from a 4G LTE eNB that we configure to operate at 3.51 GHz. Using the raw I/Q samples, and using Matlab's LTE Toolbox, we provide a step-by-step description for frequency offset estimation/correction, synchronization, cell search, channel estimation, and reference signal received power (RSRP). We provide various representative results for each step, such as RSRP measurements and corresponding analytical approximation at different UAV altitudes, coherence bandwidth and coherence time of the channel at different UAV altitudes and link distances, and kriging based 3D RSRP interpolation. The collected raw data as well as the software developed for obtaining and post-processing such data are provided publicly for potential use by other researchers. AERIQ is also available in emulation and testbed environments for external researchers to access and use as part of the NSF AERPAW platform at NC State University.}, journal={2023 IEEE AEROSPACE CONFERENCE}, author={Maeng, S. J. and Ozdemir, O. and Guvenc, I. and Sichitiu, M. L. and Dutta, R. and Mushi, M.}, year={2023} }
 @article{brockelsby_dutta_2023, title={Archipelago: A Hybrid Multi-Node Campus SDN Architecture}, ISSN={["2162-3414"]}, DOI={10.1109/ICIN56760.2023.10073492}, abstractNote={Computer networks must evolve, to become agile and policy driven, in support of flexibility and enhanced cybersecurity. With this research, we expand upon our prior work to realize these goals with SDN and discuss a multi-node hybrid SDN architecture called Archipelago.}, journal={2023 26TH CONFERENCE ON INNOVATION IN CLOUDS, INTERNET AND NETWORKS AND WORKSHOPS, ICIN}, author={Brockelsby, William and Dutta, Rudra}, year={2023} }
 @article{brockelsby_dutta_2023, title={Augmenting Campus Wireless Architectures with SDN}, ISSN={["2325-2626"]}, DOI={10.1109/ICNC57223.2023.10074202}, abstractNote={Campus wireless networks have become mission-critical as mobility and digital paradigms, such as the Internet of Things (IoT), have become more pervasive. In this work, we review the characteristics of typical campus 802.11 wireless architectures and develop an approach for collecting traffic within this context in support of analyzing contemporary traffic patterns within wireless networks. We then determine if characteristic traffic patterns within the wireless domain support the development of a hybrid Software-Defined Networking (SDN) architecture to augment traditional wireless infrastructure in support of policy-driven networking.}, journal={2023 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS, ICNC}, author={Brockelsby, William and Dutta, Rudra}, year={2023}, pages={137–142} }
 @article{gurses_funderburk_kesler_powell_rahman_ozdemir_mushi_sichitiu_guvenc_dutta_et al._2023, title={Demonstration of Joint SDR/UAV Experiment Development in AERPAW}, ISSN={["2155-7578"]}, DOI={10.1109/MILCOM58377.2023.10356351}, abstractNote={The Aerial Experimentation and Research Platform for Advanced Wireless (AERPAW) is an outdoor testbed providing the experimenters access to programmable radios and programmable vehicles. A key aspect of AERPAW is its experiment development environment. This demo introduces potential users to the main capabilities of AERPAW’s development environment. The demo exercises the main three flexible testbed capabilities, namely the ability of an experimenter to choose a wireless radio setup, a vehicle setup, and to set up traffic. The experiment is then executed live, and the collected data is post-processed and displayed.}, journal={MILCOM 2023 - 2023 IEEE MILITARY COMMUNICATIONS CONFERENCE}, author={Gurses, Anil and Funderburk, Mark and Kesler, John and Powell, Keith and Rahman, Talha F. and Ozdemir, Ozgur and Mushi, Magreth and Sichitiu, Mihail L. and Guvenc, Ismail and Dutta, Rudra and et al.}, year={2023} }
 @article{maeng_ozdemir_guvenc_sichitiu_mushi_dutta_2023, title={LTE I/Q Data Set for UAV Propagation Modeling, Communication, and Navigation Research}, volume={61}, ISSN={["1558-1896"]}, DOI={10.1109/MCOM.005.2200784}, abstractNote={Unmanned aerial vehicles (UAVs) have recently been gaining considerable attention due to their vast range of potential applications. To facilitate UAV use cases involving beyond visual line of sight (BVLOS), cellular networks have emerged as ground connectivity points, enabling remote control and payload communication for UAV links. However, the availability of limited datasets obstructs the study of cellular technology coverage for UAV flights at different altitudes and the development of machine learning (ML) techniques for improving UAV communication and navigation. In this article, we introduce raw LTE in-phase and quadrature (I/Q) sample data sets obtained from physical field experiments of the NSF AERPAW experimentation platform. A UAV equipped with a software-defined radio (SDR) was flown at altitudes ranging from 30 m to 110 m, collecting raw I/Q samples from an SDR-based LTE base station operating at 3.51 GHz. We have implemented a standardized metadata format that can be used to replicate the results obtained from the collected datasets. The post-processing of raw I/Q samples is described and representative results are provided. In the end, we give examples of potential uses of the provided dataset, post-processing sample code, and I/Q collection sample experiment code by other ML, wireless, and UAV researchers.}, number={9}, journal={IEEE COMMUNICATIONS MAGAZINE}, author={Maeng, Sung Joon and Ozdemir, Ozgur and Guvenc, Ismail and Sichitiu, Mihail L. and Mushi, Magreth and Dutta, Rudra}, year={2023}, month={Sep}, pages={90–96} }
 @article{maeng_ozdemir_nandakumar_guvenc_sichitiu_dutta_mushi_2023, title={Spectrum Activity Monitoring and Analysis for Sub-6 GHz Bands Using a Helikite}, ISSN={["2155-2487"]}, DOI={10.1109/COMSNETS56262.2023.10041314}, abstractNote={In this paper, we report sub-6 GHz spectrum measurement results at multiple ground fixed nodes and a helikite flying at altitudes up to 500 feet. Measurements are carried out at the NSF AERPAW platform in Raleigh, NC. We first describe our measurement methodology using software defined radios (SDRs) and explain the details of the measurement environment. Subsequently, we analyze the impact of terrain, measurement altitude, measurement frequency, and the time of the day on spectrum measurements for various different sub-6 GHz bands. In particular, we present spectrum occupancy results from various different LTE bands first in a rural environment, and then in an urban campus environment. Results show that for both environments, measured power at a given spectrum band increases with altitude up to 500 feet. On the other hand, in the urban environment, an abrupt increase in the aggregate received power is observed in all considered bands as the helikite rises above the buildings, when compared with the more gradual increase of the received power in same bands for the rural environment.}, journal={2023 15TH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS & NETWORKS, COMSNETS}, author={Maeng, S. J. and Ozdemir, O. and Nandakumar, H. N. and Guvenc, I. and Sichitiu, M. L. and Dutta, R. and Mushi, M.}, year={2023} }
 @article{joshi_dutta_2022, title={A Reinforcement Approach for Detecting P2P Botnet Communities in Dynamic Communication Graphs}, ISSN={["1550-3607"]}, DOI={10.1109/ICC45855.2022.9838876}, abstractNote={Peer-to-peer (P2P) botnets use decentralized command and control networks that make them resilient to disruptions. The P2P botnet overlay networks manifest structures in mutual-contact graphs, also called communication graphs, formed using network traffic information. It has been shown that these structures can be detected using community detection techniques from graph theory. These previous works, however, treat the communication graphs and the P2P botnet structures as static. In reality, communication graphs are dynamic as they represent the continuously changing network traffic flows. Similarly, the P2P botnets also evolve with time, as new bots join and existing bots leave either temporarily or permanently. In this paper we address the problem of detecting such evolving P2P botnet communities in dynamic communication graphs. We propose a reinforcement-based approach, suitable for large communication graphs, that improves precision and recall of P2P botnet community detection in dynamic communication graphs.}, journal={IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022)}, author={Joshi, Harshvardhan P. and Dutta, Rudra}, year={2022}, pages={56–61} }
 @article{funderburk_kesler_sridhar_sichitiu_guvenc_dutta_zajkowski_marojevic_2022, title={AERPAW Vehicles: Hardware and Software Choices}, DOI={10.1145/3539493.3539583}, abstractNote={AERPAW (Aerial Experimentation and Research Platform for Advanced Wireless) is an advanced wireless research platform centered around fully programmable radios and fully programmable vehicles. In this paper we detail the vehicle aspects of the testbed, including the AERPAW UAVs, UGVs, as well as the hardware and software choices made by the team, as well as our experience earned in the past few years.}, journal={PROCEEDINGS OF THE 2022 EIGHTH WORKSHOP ON MICRO AERIAL VEHICLE NETWORKS, SYSTEMS, AND APPLICATIONS, DRONET 2022}, author={Funderburk, Mark and Kesler, John and Sridhar, Keshav and Sichitiu, Mihail L. and Guvenc, Ismail and Dutta, Rudra and Zajkowski, Thomas and Marojevic, Vuk}, year={2022}, pages={37–42} }
 @article{samal_dutta_guvenc_sichitiu_floyd_zajkowski_2022, title={Automating Operator Oversight in an Autonomous, Regulated, Safety-Critical Research Facility}, ISSN={["1095-2055"]}, DOI={10.1109/ICCCN54977.2022.9868858}, abstractNote={The deployment at scale of Unmanned Aerial Systems have become increasingly imminent in the last few years, even as concerns regarding the dependability and predictability of their command and control channels remain fully to be addressed. The intersection of ground-to-air wireless communications, aerial networking, and trajectory control has become a research area of sharp interest. The validation of such research, beyond the theoretical/simulation stage, requires a facility that is both realistic, and admits of potentially risky or unsafe operation, while in the end guaranteeing personnel and equipment safety. The AERPAW project is an ambitious project, funded by the PAWR program of the US NSF, to create a remote accessible research platform for a research facility to enable such validation. To enable remote usage of such a testbed, yet provide the researcher with complete experimental freedom, the AERPAW facility includes a combination of architectural mechanisms that balance freedom of experimentation with regulatory compliance and safety. In this paper, we articulate the challenges and considerations of designing such mechanisms, and present the architectural features of AERPAW that attempt to realize these lofty goals.}, journal={2022 31ST INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN 2022)}, author={Samal, Tripti and Dutta, Rudra and Guvenc, Ismail and Sichitiu, Mihail L. and Floyd, Brian and Zajkowski, Thomas}, year={2022} }
 @article{samal_dutta_2022, title={Communication in a Drone-Platoon using Geographic Routing}, DOI={10.1145/3539493.3539580}, abstractNote={Aerial networking has been the subject of growing research with the rising possibility of Unmanned Aerial Vehicles or drones being used in a broad variety of contexts and a broad range of environments. One of the important problems has been perceived as that of routing for internal communication within a platoon of drones, in the face of time-varying and a large range of possible positioning of various drones within a platoon. Single-route approaches, whether proactive or reactive, are susceptible to voids, as well as dynamic topology variation. Drawing on previous work, we investigate the applicability of geodiffuse pathsets, a type of geographic routing, in the aerial context. In this paper, we first study simply extending the idea to the three-dimensional context in a straightforward way. Then, we introduce a variant that may provide a potentially better alternative to the original algorithm for a combination of fast-changing platoon topologies and bulk data transfer. Our results from this initial investigation confirm that our approach is a promising one for further study and application in drone platoon networking.}, journal={PROCEEDINGS OF THE 2022 EIGHTH WORKSHOP ON MICRO AERIAL VEHICLE NETWORKS, SYSTEMS, AND APPLICATIONS, DRONET 2022}, author={Samal, Tripti and Dutta, Rudra}, year={2022}, pages={31–36} }
 @article{maeng_guvenc_sichitiu_floyd_dutta_zajkowski_ozdemir_mushi_2022, title={National Radio Dynamic Zone Concept with Autonomous Aerial and Ground Spectrum Sensors}, ISSN={["2164-7038"]}, DOI={10.1109/ICCWORKSHOPS53468.2022.9814648}, abstractNote={National radio dynamic zone (NRDZs) are intended to be geographically bounded areas within which controlled experiments can be carried out while protecting the nearby licensed users of the spectrum. An NRDZ will facilitate research and development of new spectrum technologies, waveforms, and protocols, in typical outdoor operational environments of such technologies. In this paper, we introduce and describe an NRDZ concept that relies on a combination of autonomous aerial and ground sensor nodes for spectrum sensing and radio environment monitoring (REM). We elaborate on key characteristics and features of an NRDZ to enable advanced wireless experimentation while also coexisting with licensed users. Some preliminary results based on simulation and experimental evaluations are also provided on out-of-zone leakage monitoring and real-time REMs.}, journal={2022 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS)}, author={Maeng, S. J. and Guvenc, I and Sichitiu, M. L. and Floyd, B. and Dutta, R. and Zajkowski, T. and Ozdemir, O. and Mushi, M.}, year={2022}, pages={687–692} }
 @article{yu_dutta_liu_2022, title={On Topology Design for the Quantum Internet}, volume={36}, ISSN={["1558-156X"]}, DOI={10.1109/MNET.001.2200170}, abstractNote={Imagine a Quantum Internet where people can freely establish physically secure communication channels or migrate quantum programs between anywhere in the world. What would it look like? Despite the very exciting recent advances around building prototypes of quantum networks, little is known about how lab-scale prototypes can be expanded into a global infrastructure that is as capacitated, robust, and cost-efficient as the digital Internet right now. Part of the difficulty lies in our lack of understanding of how the structure of a quantum network affects its capacity and performance when serving multi-commodity quantum communication demands. This article studies the problem of designing high-performance network topologies for the quantum Internet. Utilizing abstract models of the basic quantum network operations and an optimal entanglement distribution protocol, we characterize the capacity and performance of various candidate topologies for the quantum Internet, in terms of the rate of entanglement distribution between source-destination pairs and the fidelity of entangled pairs, respectively. We discuss the implications of our preliminary results, and propose directions for further investigation. As the feasibility of largescale quantum network deployment continues to increase, we hope this article can draw attention to these macroscopic design problems, such as topology design, which potentially have a profound influence on how the entire technology evolves, just as we have observed with the digital Internet in the past decades.}, number={5}, journal={IEEE NETWORK}, author={Yu, Ruozhou and Dutta, Rudra and Liu, Jianqing}, year={2022}, pages={64–70} }
 @article{chatterjee_dutta_2022, title={Studying the Effect of Network Latency on an Adaptive Coordinated Path Planning Algorithm for UAV Platoons}, DOI={10.1145/3539493.3539581}, abstractNote={UAVs can be directed to perform multiple tasks efficiently without human intervention. This is especially useful in tasks that require group coordination since UAVs can exchange information and alter their trajectories based on dynamic data. Thus, communication in multi-UAV platoons, with the goal of mission-oriented trajectory planning, is an area of considerable interest. In this paper, we focus on message dependence in a group of UAVs in the course of completing a task. To this end, we chose the task of Plume Wrapping. Plume Wrapping is the problem of finding the shape and extent of hazardous airborne material. This is a practical problem in real world scenario which requires a fully autonomous UAV group. Communication between UAVs is essential to coordinate decisions. In this work, we show that an algorithm can be designed which ensures correctness while being robust to variable message delay.}, journal={PROCEEDINGS OF THE 2022 EIGHTH WORKSHOP ON MICRO AERIAL VEHICLE NETWORKS, SYSTEMS, AND APPLICATIONS, DRONET 2022}, author={Chatterjee, Baisakhi and Dutta, Rudra}, year={2022}, pages={7–12} }
 @article{mushi_joshi_dutta_guvenc_sichitiu_floyd_zajkowski_2022, title={The AERPAW Experiment Workflow - Considerations for Designing Usage Models for a Computing-supported Physical Research Platform}, ISSN={["2159-4228"]}, DOI={10.1109/INFOCOMWKSHPS54753.2022.9798061}, abstractNote={The AERPAW project is an ambitious project, funded by the PAWR program of the US NSF, to create a remote accessible research platform for a research facility with some distinct features that makes its usage model unique, and non-obvious to many researchers desirous of making use of this platform. AERPAW is primarily a physical resource (not a computing or cyber-resource) - the RF enviroment, and the airspace. Experimenters can explore them through radio transceivers and Unmanned Aerial Vehicles, both under the Experimenter’s programmatic control. Since the entire workflow of the user is through the mediation of virtual computing environments, users often tend to think of AERPAW as a computing resource, and find some of the experiment workflow counter-intuitive. In this paper, we articulate the challenges and considerations of designing an experiment workflow that balances the need for guaranteeing safe testbed operation, and providing flexible programmatic access to this unique resource.}, journal={IEEE INFOCOM 2022 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS)}, author={Mushi, Magreth and Joshi, Harshvardhan P. and Dutta, Rudra and Guvenc, Ismail and Sichitiu, Mihail L. and Floyd, Brian and Zajkowski, Thomas}, year={2022} }
 @article{chowdhury_anjinappa_guvenc_sichitiu_ozdemir_bhattacherjee_dutta_marojevic_floyd_2021, title={A Taxonomy and Survey on Experimentation Scenarios for Aerial Advanced Wireless Testbed Platforms}, volume={2021-March}, ISSN={["1095-323X"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-85111405299&partnerID=MN8TOARS}, DOI={10.1109/AERO50100.2021.9438449}, abstractNote={There are various works in the recent literature on fundamental research and experimentation on unmanned aerial vehicle (UAV) communications. On the other hand, to our best knowledge, there is no taxonomy and survey on experimentation possibilities with a software-defined aerial wireless platform. The goal of this paper is first to have a brief overview of large-scale advanced wireless experimentation platforms broadly available to the wireless research community, including also the Aerial Experimentation and Research Platform for Advanced Wireless (AERPAW). We then provide a detailed taxonomy and a comprehensive survey of experimentation possibilities that can be carried out in a platform such as AERPAW. In particular, we conceptualize and present eleven different classes of advanced and aerial wireless experiments, provide several example experiments for each class, and discuss some of the existing related works in the literature. The paper will help to develop a better understanding of the equipment and software resources that can be available for experimentation in mid-scale wireless platforms, as well as the capabilities and limitations of such platforms.}, journal={2021 IEEE AEROSPACE CONFERENCE (AEROCONF 2021)}, author={Chowdhury, Md Moin Uddin and Anjinappa, Chethan K. and Guvenc, Ismail and Sichitiu, Mihail and Ozdemir, Ozgur and Bhattacherjee, Udita and Dutta, Rudra and Marojevic, Vuk and Floyd, Brian}, year={2021} }
 @article{panicker_ozdemir_sichitiu_guvenc_dutta_marojevic_floyd_2021, title={AERPAW emulation overview and preliminary performance evaluation}, volume={194}, ISSN={["1872-7069"]}, url={https://doi.org/10.1016/j.comnet.2021.108083}, DOI={10.1016/j.comnet.2021.108083}, abstractNote={The Aerial Experimentation and Research Platform for Advanced Wireless (AERPAW) has been recently funded by the National Science Foundation (NSF)’s Platforms for Advanced Wireless Research (PAWR) program. The AERPAW platform will enable experiments with programmable radios and programmable unmanned aerial vehicles (UAVs), conducted in a safe and repeatable manner. Several architectural components are crucial for enabling the envisioned capabilities of the testbed. In this paper, after providing a high level overview of AERPAW, we first present the emulation design of AERPAW vehicles. Subsequently, we describe various different options for wireless channel emulation in AERPAW. We start with a generalized model for wireless emulation, and expand that model to packet-level emulation, I-Q level emulation, and radio-frequency (RF)-level emulation. A discussion on the trade-offs among these various different emulation possibilities is also provided.}, journal={COMPUTER NETWORKS}, publisher={Elsevier BV}, author={Panicker, Ashwin and Ozdemir, Ozgur and Sichitiu, Mihail L. and Guvenc, Ismail and Dutta, Rudra and Marojevic, Vuk and Floyd, Brian}, year={2021}, month={Jul} }
 @article{kim_reeves_dutta_2021, title={Advanced Secure DNS Name Autoconfiguration with Authentication for Enterprise IoT Network}, ISSN={["2576-6813"]}, DOI={10.1109/GLOBECOM46510.2021.9685237}, abstractNote={Internet of Things (IoT) is an intelligent infrastructure and service technology that connects objects to people for monitoring and control. The number of IoT devices is rapidly increasing in various environments. Although the DNS protocol is being applied to IoT networks to create unique identifiers, it is burdensome for users to manually create and configure a globally unique name for each device. DNS Name Autoconfiguration (DNSNA) was proposed to register the DNS name of IoT devices automatically and utilize IoT devices globally. However, DNSNA without secure authentication and authorization leads to potential threats, such as the registration of malicious IoT devices, and other IoT security attacks. In this paper, we propose an Advanced Secure DNS name autoconfiguration with Authentication and Authorization for enterprise IoT network (ASDAI). Especially, we provide the first model using the convergence of extended OAuth 2.0 and Kerberos v5. The proposed protocol supports (1) reliable device / administrator registration, (2) secure DNS name autoconfiguration, and (3) user / service authentication and authorization procedure for the heterogeneity and scalability of enterprise IoT networks.}, journal={2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)}, author={Kim, Tae Hyun and Reeves, Douglas and Dutta, Rudra}, year={2021} }
 @article{brockelsby_dutta_2021, title={Traffic Analysis in Support of Hybrid SDN Campus Architectures for Enhanced Cybersecurity}, ISSN={["2472-8144"]}, DOI={10.1109/ICIN51074.2021.9385530}, abstractNote={The scale and complexity of campus networks continues to accelerate due to recent paradigms such as the Internet of Things (IoT) resulting in a heightened awareness of the need for enhanced cybersecurity. Traditional cybersecurity approaches such as the placement of firewalls and other policy enforcement mechanisms at strategic choke points effectively divide the network into zones and are unable to regulate intrazone host-to-host communication. This traditional approach introduces significant risk as there is little in place to prevent the horizontal propagation of malware or other unwanted traffic within a given zone. In this paper we explore approaches for improving cybersecurity in campus networks by analyzing contemporary campus traffic patterns and propose several architectural enhancements in light of these patterns which introduce strategically placed hardware or hardware-accelerated software data planes which are evaluated from performance and effectiveness perspectives.}, journal={2021 24TH CONFERENCE ON INNOVATION IN CLOUDS, INTERNET AND NETWORKS AND WORKSHOPS (ICIN)}, author={Brockelsby, William and Dutta, Rudra}, year={2021} }
 @article{marojevic_guvenc_dutta_sichitiu_floyd_2020, title={Advanced Wireless for Unmanned Aerial Systems: 5G Standardization, Research Challenges, and AERPAW Architecture}, volume={15}, url={https://doi.org/10.1109/MVT.2020.2979494}, DOI={10.1109/MVT.2020.2979494}, abstractNote={The 5G mobile communications systems merge traditionally separate communications and networking systems and services to effectively support a myriad of heterogeneous applications. Researchers and industry working groups are investigating the integration of aerial nodes, shared spectrum techniques, and new network architectures, which are gradually being introduced into standards. This article discusses relevant standardization efforts for the integration of unmanned aerial systems (UASs) into 5G and the requirements for an aerial wireless testbed. We introduce the aerial experimentation and research platform for advanced wireless (AERPAW) and, specifically, its architecture, which is designed for enabling experimental research in controlled yet production-like environments. Sample research projects and trials show the critical R&D needs, broad scope, and impact that such a platform can have on technology evolution, regulation, and standardization as well as future services.}, number={2}, journal={IEEE Vehicular Technology Magazine}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Marojevic, Vuk and Guvenc, Ismail and Dutta, Rudra and Sichitiu, Mihail L. and Floyd, Brian A.}, year={2020}, month={Jun}, pages={22–30} }
 @article{brockelsby_dutta_2020, title={Performance Implications of Problem Decomposition Approaches for SDN Pipelines}, ISSN={["2576-6813"]}, DOI={10.1109/GLOBECOM42002.2020.9322392}, abstractNote={Software defined networking (SDN) allows organizations to modify networks programmatically to implement custom forwarding behavior and to react to changing conditions. While there are many approaches available to implement SDN those that leverage forwarding table abstractions such as OpenFlow and P4 require developers to decompose problems into one or more tables associated with a definable pipeline. This paper explores tradeoffs between table depth and pipeline length associated with different problem decomposition options by analyzing the performance impact on hardware and software data planes including software data planes leveraging hardware acceleration through the use of SmartNICs.}, journal={2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)}, author={Brockelsby, William and Dutta, Rudra}, year={2020} }
 @inbook{dutta_harai_2020, title={Traffic Grooming}, url={https://doi.org/10.1007/978-3-030-16250-4_14}, DOI={10.1007/978-3-030-16250-4_14}, abstractNote={ZusammenfassungA particular thread of research in optical networking that is concerned with the efficient assignment of traffic demands to available network bandwidth became known as traffic grooming in the mid-1990s. Initially motivated by the distinctly different network characteristics of optical and electronic communication channels, the area focused on how subwavelength traffic components were to be mapped to wavelength communication channels, such that the need to convert traffic back to the electronic domain at intermediate network nodes, for the purpose of differential routing, was minimized. Over time, it broadened to include joint considerations with other network design goals and constraints. It was influenced in turn by existing technology limitations, and in turn served to influence continuing technology trends. Traffic grooming has had a significant effect on both the research and practice of transport networking. It continues to be a meaningful area not just in historical terms, but as a wealth of techniques that can be called upon for considering the traffic engineering problem afresh as each new development at the optical layer, or change in economic realities of networking equipment or traffic requirements, redefines the conditions of that problem.}, booktitle={Springer Handbook of Optical Networks}, publisher={Springer International Publishing}, author={Dutta, Rudra and Harai, Hiroaki}, year={2020}, pages={513–534} }
 @article{miyazawa_harai_udechukwu_dutta_2018, title={Designing and experimentally demonstrating automatic OPS/OCS/OpenFlow network control driven by ChoiceNet provider}, volume={36}, ISSN={["1572-8188"]}, DOI={10.1007/s11107-018-0769-5}, number={1}, journal={PHOTONIC NETWORK COMMUNICATIONS}, author={Miyazawa, Takaya and Harai, Hiroaki and Udechukwu, Robinson and Dutta, Rudra}, year={2018}, month={Aug}, pages={43–55} }
 @article{mushi_dutta_2018, title={Human Factors in Network Reliability Engineering}, volume={26}, ISSN={["1573-7705"]}, DOI={10.1007/s10922-017-9440-1}, number={3}, journal={JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT}, author={Mushi, Magreth and Dutta, Rudra}, year={2018}, month={Jul}, pages={686–722} }
 @article{he_dai_ning_dutta_2017, title={A Leader-Follower Controlled Markov Stopping Game for Delay Tolerant and Opportunistic Resource Sharing Networks}, volume={35}, ISSN={["1558-0008"]}, DOI={10.1109/jsac.2017.2659581}, abstractNote={In various resource sharing networks, opportunistic resources with dynamic quality are often present for the users to exploit. As many user tasks are delay-tolerant, this favorably allows the network users to wait for and access the opportunistic resource at the time of its best quality. For such delay-tolerant and opportunistic resource sharing networks, the resource accessing strategies developed in the literature suffer from three limitations. First, they mainly focused on single-user scenarios, whereas the competition from other users is ignored. Second, the influence from the resource seller who may take actions to manipulate the resource sharing procedure is not considered. Third, the impact of the actions from both the network users and the resource seller on the resource quality dynamics is not considered either. To overcome these limitations, a leader–follower controlled Markov stopping game (LF-C-MSG) is developed in this paper. The derived Stackelberg equilibrium strategy of the LF-C-MSG can be used to guide the behaviors of both the network users and the resource seller for better performance and resource utilization efficiency. Two exemplary applications of the proposed LF-C-MSG are presented, along with corresponding numerical results to verify the effectiveness of the proposed framework.}, number={3}, journal={IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS}, author={He, Xiaofan and Dai, Huaiyu and Ning, Peng and Dutta, Rudra}, year={2017}, month={Mar}, pages={615–627} }
 @article{bhat_udechukwu_dutta_rouskas_2017, title={Network service orchestration in heterogeneous 5G networks using an open marketplace}, volume={6}, ISSN={2047-4954 2047-4962}, url={http://dx.doi.org/10.1049/IET-NET.2017.0058}, DOI={10.1049/IET-NET.2017.0058}, abstractNote={Network service orchestration across heterogeneous networks needs an open marketplace where the services advertised by the providers in different domains can be purchased for short-term or long-term time scales. The authors present two design paradigms and evaluate two corresponding prototypes which provide a framework for network services to be purchased. They 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. They present a network service orchestration algorithm which is advertised as a network service in the marketplace.}, number={6}, journal={IET Networks}, publisher={Institution of Engineering and Technology (IET)}, author={Bhat, Shireesh and Udechukwu, Robinson and Dutta, Rudra and Rouskas, George N.}, year={2017}, month={Nov}, pages={149–156} }
 @inproceedings{bhat_udechukwu_dutta_rouskas_2017, title={On service composition algorithm for open marketplaces of network services}, DOI={10.1109/eucnc.2017.7980657}, abstractNote={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. By providing a semantic language for advertising services and offering choice for the composed service(s) we provide a level playing field for the providers and alternatives for the users to choose from based on their requirement. This is similar to the services offered in the cloud, but without the provider monopoly or the limitation of having to select from limited options.}, booktitle={2017 european conference on networks and communications (eucnc)}, author={Bhat, S. and Udechukwu, R. and Dutta, Rudra and Rouskas, G. N.}, year={2017} }
 @article{jin_he_dai_dutta_ning_2017, title={Towards Privacy-Aware Collaborative Security: A Game-Theoretic Approach}, DOI={10.1109/pac.2017.32}, abstractNote={With the rapid development of sophisticated attack techniques, individual security systems that base all of their decisions and actions of attack prevention and response on their own observations and knowledge become incompetent. To cope with this problem, collaborative security in which a set of security entities are coordinated to perform specific security actions is proposed in literature. In collaborative security schemes, multiple entities collaborate with each other by sharing threat evidence or analytics to make more effective decisions. Nevertheless, the anticipated information exchange raises privacy concerns, especially for those privacy-sensitive entities. In order to obtain a quantitative understanding of the fundamental tradeoff between the effectiveness of collaboration and the entities' privacy, a repeated two-layer single-leader multi-follower game is proposed in this work. Based on our game-theoretic analysis, the expected behaviors of both the attacker and the security entities are derived and the utility-privacy tradeoff curve is obtained. In addition, the existence of Nash equilibrium (NE) for the collaborative entities is proven, and an asynchronous dynamic update algorithm is proposed to compute the optimal collaboration strategies of the entities. Furthermore, the existence of Byzantine entities is considered and its influence is investigated. Finally, simulation results are presented to validate the analysis.}, journal={2017 1ST IEEE SYMPOSIUM ON PRIVACY-AWARE COMPUTING (PAC)}, author={Jin, Richeng and He, Xiaofan and Dai, Huaiyu and Dutta, Rudra and Ning, Peng}, year={2017}, pages={72–83} }
 @inproceedings{he_dai_ning_dutta_2016, title={A A multi-player Markov stopping game for delay-tolerant and opportunistic resource sharing networks}, DOI={10.1109/infocom.2016.7524350}, abstractNote={Opportunistic resources are often present in various resource sharing networks for the users to exploit, but their qualities often change over time. Fortunately, many user tasks are delay-tolerant, which offers the network users a favorable degree of freedom in waiting for and accessing the opportunistic resource at the time of its best quality. For such delay-tolerant and opportunistic resource sharing networks (DT-ORS-Net), the corresponding optimal accessing strategies developed in existing literature mainly focus on the single-user scenarios, while the potential competition from other peer users in practical multi-user DT-ORS-Net is often ignored. Considering this, a multi-player Markov stopping game (M-MSG) is developed in this work, and the derived Nash equilibrium (NE) strategy of this M-MSG can guide network users to properly handle the potential competition from other peers and thus exploit the time diversity of the opportunistic resource more effectively, which in turn further improves the resource utilization efficiency. Applications in the cloud-computing and the mobile crowdsourcing networks are demonstrated to verify the effectiveness of the proposed method, and simulation results show that using the NE strategy of the proposed M-MSG can provide substantial performance gain as compared to using the conventional single-user optimal one.}, booktitle={IEEE INFOCOM 2016 - the 35th annual IEEE international Conference on Computer Communications}, author={He, X. F. and Dai, Huaiyu and Ning, P. and Dutta, Rudra}, year={2016} }
 @inproceedings{bhat_udechukwu_dutta_rouskas_2016, title={Inception to application: A GENI based prototype of an Open Marketplace for Network Services}, DOI={10.1109/infcomw.2016.7562244}, abstractNote={Choice-based network architecture enables users the power to choose services from a set of network service offerings from multiple providers within a marketplace. To facilitate marketplace alternatives and enable fine-grain service composition, a common service specification should represent a general-extensible design for describing a service. This allows users to discover, negotiate, and purchase network services from service providers using service advertisements in the marketplace. We have successfully developed a ChoiceNet prototype 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. Our implementation showcases the integration of two contrasting payment models for the procurement of contractual agreements for network services. Successful agreements results in the provisioning of the advertised network services. This demo helps in visualizing the network service life cycle as seen by the Marketplace.}, booktitle={2016 ieee conference on computer communications workshops (infocom wkshps)}, author={Bhat, S. and Udechukwu, R. and Dutta, Rudra and Rouskas, G. N.}, year={2016} }
 @inproceedings{udechukwu_bhat_dutta_rouskas_2016, title={Language of choice: On embedding choice-related semantics in a realizable protocol}, DOI={10.1109/sarnof.2016.7846760}, abstractNote={Choice-based future Internet architectures, in which choice is offered for fine-grained network services to different traffic flows, have been proposed in the literature. Such choice-based architectures have been envisioned in literature as realizing an economy of networking services that can give rise to a beneficial ecosystem of providers and consumers over time. Such an architecture would use an economy plane to allow service providers and customers to exchange information about available service alternatives, complete purchase and payment interactions, and use purchased services. While samples of such semantics have been proposed in these previous works, embedding them in specific realizations by defining messages to be exchanged and their syntax is a separate challenge, in which the needs for efficiency, ease of implementation, and extensibility, all need to be balanced. In this paper, we present the design of a possible embedding of the entities, and a functionally complete set of interactions, comprising a choice-based architecture. Further, to show the practical realizability of this embedding, we report on a prototype built on the GENI environment, and our experience in confronting real-world design issues. The prototype showcases new service models for value-added transport in such an architecture.}, booktitle={2016 ieee 37th sarnoff symposium}, author={Udechukwu, R. and Bhat, S. and Dutta, Rudra and Rouskas, G.}, year={2016}, pages={31–36} }
 @article{modiano_dutta_qian_2016, title={Special Issue on Survivable and Resilient Communication Networks and Services}, volume={24}, ISSN={["1573-7705"]}, DOI={10.1007/s10922-016-9378-8}, number={3}, journal={JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT}, author={Modiano, Eytan and Dutta, Rudra and Qian, Yi}, year={2016}, month={Jul}, pages={445–448} }
 @article{he_dai_shen_ning_dutta_2016, title={Toward Proper Guard Zones for Link Signature}, volume={15}, ISSN={["1558-2248"]}, DOI={10.1109/twc.2015.2498621}, abstractNote={Motivated by information-theoretic security, link signature (LS)-based security mechanisms exploit the ample channel characteristics between wireless devices for security establishment. Nevertheless, LS is originated from wireless environments and hence may exhibit potential vulnerabilities that can be exploited by adversary in the vicinity. As to this, it is widely believed in existing literature on LS that, a half-wavelength guard zone is sufficient to decorrelate the adversary channel from the legitimate one and thereby secures the legitimate LS. However, such an assumption may not hold universally - in some environments, high channel correlations have been observed for much larger spatial separations. Considering this, a comprehensive understanding of channel correlation in different wireless environments is needed for more confident deployment of LS-based security mechanisms. To this end, various well-established channel correlation models are investigated in this work. A set of important physical factors that have significant influence on LS security are identified, and with the obtained insights, extensive simulations are conducted to explore suitable guard zone sizes for LS in several typical indoor and outdoor environments. Experimental results based on universal software radio peripheral (USRP) platforms and GNURadio are also presented to further support the analysis.}, number={3}, journal={IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS}, author={He, Xiaofan and Dai, Huaiyu and Shen, Wenbo and Ning, Peng and Dutta, Rudra}, year={2016}, month={Mar}, pages={2104–2117} }
 @inproceedings{he_dai_ning_dutta_2015, title={A A stochastic multi-channel spectrum access game with incomplete information}, DOI={10.1109/icc.2015.7249082}, abstractNote={To ensure continuous functioning and satisfactory performance, a wireless communication system has to not only learn and adapt to the unknown and ever-changing wireless environment, but also strategically deal with the usually unfamiliar peers. Incomplete information stochastic game (SG) is a promising model for the corresponding analysis and strategy design. In this work, an exemplary multi-channel spectrum access game (SAG) with unknown environment dynamics and limited information of the other player is considered to illustrate the proposed solution for the corresponding incomplete information SG. To find the best communication strategy in the face of uncertainty, a joint reinforcement learning and type identification algorithm is developed, which is provably convergent under certain technical conditions. Numerical results show that using the proposed algorithm, a wireless user can gradually achieve the same performance as that in the corresponding complete information game.}, booktitle={2015 ieee international conference on communications (icc)}, author={He, X. F. and Dai, Huaiyu and Ning, P. and Dutta, Rudra}, year={2015}, pages={4799–4804} }
 @inproceedings{chen_wolf_griffioen_ascigil_dutta_rouskas_bhat_baldin_calvert_2015, title={Design of a protocol to enable economic transactions for network services}, DOI={10.1109/icc.2015.7249175}, abstractNote={Deployment of innovative new networking services requires support by network providers. Since economic motivation plays an important role for network providers, it is critical that a network architecture intrinsically considers economic relationships. We present the design of a protocol that associates access to network services with economic contracts. We show 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. We present results that show the effectiveness of the proposed protocol and thus demonstrate a first step toward realizing an economy plane for the Internet.}, booktitle={2015 ieee international conference on communications (icc)}, author={Chen, X. M. and Wolf, T. and Griffioen, J. and Ascigil, O. and Dutta, Rudra and Rouskas, G. and Bhat, S. and Baldin, I. and Calvert, K.}, year={2015}, pages={5354–5359} }
 @article{he_dai_ning_dutta_2015, title={Dynamic IDS Configuration in the Presence of Intruder Type Uncertainty}, ISSN={["2334-0983"]}, DOI={10.1109/glocom.2015.7417158}, abstractNote={Intrusion detection systems (IDSs) assume increasingly importance in past decades as information systems become ubiquitous. Despite the abundance of intrusion detection algorithms developed so far, there is still no single detection algorithm or procedure that can catch all possible intrusions; also, simultaneously running all these algorithms may not be feasible for practical IDSs due to resource limitation. For these reasons, effective IDS configuration becomes crucial for real-time intrusion detection. However, the uncertainty in the intruder's type and the (often unknown) dynamics involved with the target system pose challenges to IDS configuration. Considering these challenges, the IDS configuration problem is formulated as an incomplete information stochastic game in this work, and a new algorithm, Bayesian Nash-Q learning, that combines conventional reinforcement learning with a Bayesian type identification procedure is proposed. Numerical results show that the proposed algorithm can identify the intruder's type with high fidelity and provide effective configuration.}, journal={2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)}, author={He, Xiaofan and Dai, Huaiyu and Ning, Peng and Dutta, Rudra}, year={2015} }
 @inproceedings{joshi_dhanasekaran_dutta_2015, title={Impact of software obfuscation on susceptibility to return-oriented programming attacks}, DOI={10.1109/sarnof.2015.7324662}, abstractNote={Software obfuscation is a commonly used technique to protect software, especially against reverse-engineering attacks. It is a form of security through obscurity and is commonly used for intellectual property and Digital Rights Management protection. However, this increase of security may come at the expense of increased vulnerabilities in another direction, hitherto unsuspected. In this paper, we propose and investigate the hypothesis that some of the most popular obfuscation techniques, including changing the control flow graph and substituting simpler instruction sequences with complex instructions, may make the obfuscated binary more vulnerable to Return-Oriented Programming (ROP) based attacks. ROP is a comparatively recent technique used to exploit buffer-overflow vulnerabilities. We analyze the ROP gadgets present in both obfuscated and un-obfuscated versions of well known binaries. We show that the number of ROP gadgets in a binary significantly increase after obfuscation, and it can potentially make ROP-based exploits easier.}, booktitle={2015 36th ieee sarnoff symposium}, author={Joshi, H. P. and Dhanasekaran, A. and Dutta, Rudra}, year={2015}, pages={161–166} }
 @article{pathak_dutta_mohapatra_2015, title={On Availability-Performability Tradeoff in Wireless Mesh Networks}, volume={14}, ISSN={["1558-0660"]}, DOI={10.1109/tmc.2014.2329845}, abstractNote={It is understood from past decade of research that a wireless multi-hop network can achieve maximum network throughput only when its nodes operate at a minimum common transmission power level that ensures network connectivity (availability). This point of optimality where maximum availability and throughput is guaranteed in an interference-optimal network has been the basis of numerous design problems in wireless networks. In this paper, we claim that when performability (availability weighted performance) is considered as opposed to average case throughput performance, there does not exist a transmission power (or node density) that can maximize both availability and performability. Since the current mesh networks are expected to deliver carrier-grade services to its users, the availability-performability tradeoff presented in this paper holds a special importance. While availability metric is a necessary one for any networking system intended to provide continuous service, past research has shown a strong correlation between performability and quality of user experience in case of wireless networks. The contributions of the paper are as follows: (1) We first define availability and performability in the context of wireless mesh networks, and then develop efficient algorithms on the basis of intelligent state sampling that can calculate both the quantities with reasonable accuracy. (2) We apply the evaluation methods to two existing mesh networks (GoogleWiFi and PoncaCityMesh) to demonstrate that their current design can not guarantee a reasonable level of availability or performability. (3) Using hundreds of hours of simulations, we analyze the impact of two basic deployment factors (node density and transmission power) on availability and performability. We outline numerous novel results that emerge due to joint availability-performability analysis including the observation about availability-performability tradeoff.}, number={3}, journal={IEEE TRANSACTIONS ON MOBILE COMPUTING}, author={Pathak, Parth H. and Dutta, Rudra and Mohapatra, Prasant}, year={2015}, month={Mar}, pages={606–618} }
 @inproceedings{udechukwu_dutta_2015, title={Service definition semantics for optical services on a choice-based network}, DOI={10.1109/ondm.2015.7127281}, abstractNote={Optical networks continue to provide the high-performance, high-bandwidth substrate of the planetary communication networks. The rapidly increasing and changing variety of demands placed on such networks requires that optical networks be increasingly agile and responsive to end-consumer traffic needs. Because of multiple levels of aggregation, the optical core is generally less responsive to changing needs at access levels. We have previously proposed that providing architectural mechanisms that allow the provider to inform the customer of available alternatives enables a co-optimization of network resources jointly by customers and providers, leading to better performance for the customer while utilizing resources more efficiently for the provider. In this paper, we show how optical switching capabilities may be abstracted as services to enable the automatic composability that is required for such a system. We have successfully demonstrated a proof-of-concept prototype of this architecture in the GENI environment, which we briefly describe.}, booktitle={2015 International Conference on Optical Network Design and Modeling (ONDM)}, author={Udechukwu, R. and Dutta, Rudra}, year={2015}, pages={98–103} }
 @article{mukherjee_dutta_ramamurthy_datta_das_2015, title={Special Issue: Selected Papers from the Sixth International IEEE Conference on Advanced Networks and Telecommunication Systems (IEEE ANTS 2012)}, volume={18}, ISSN={1573-4277}, url={http://dx.doi.org/10.1016/J.OSN.2015.08.001}, DOI={10.1016/J.OSN.2015.08.001}, journal={Optical Switching and Networking}, publisher={Elsevier BV}, author={Mukherjee, Biswanath and Dutta, Rudra and Ramamurthy, Byrav and Datta, Debasish and Das, Goutam}, year={2015}, month={Nov}, pages={151–152} }
 @inproceedings{mushi_murphy-hill_dutta_2015, title={The The human factor: A challenge for network reliability design}, DOI={10.1109/drcn.2015.7149000}, abstractNote={Computer and communication networks form part of the critical infrastructure of planetary society, and much work has gone into making the technology for such networks reliable. However, such networks have to be administered and managed by human administrators. The process of such administration, as it becomes increasingly complex, itself poses a challenge to protocols and systems designed to enhance network reliability. Several studies of highly reliable systems have shown that human operator error can account for 20-70% of system failures, and as the system become more reliable, the human factor gains increasing significance. Nevertheless, efforts to design reliability measures have remained largely disjoint from considerations of the human process of network administration. In this position paper, we describe some preliminary effort to examine the question of whether such joint consideration can be useful. We employ the first stages of a Grounded Theory approach to study network administration and management workflows in order to understand their impact in network reliability. Based on our study, we advance the proposition that the future of network reliability engineering must actively address the human process of system administration and management and concommittant misconfigurations.}, booktitle={2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)}, author={Mushi, M. and Murphy-Hill, E. and Dutta, Rudra}, year={2015}, pages={115–118} }
 @article{babaoglu_dutta_2014, title={A GENI Meso-Scale Experiment of a Verification Service}, DOI={10.1109/gree.2014.13}, abstractNote={In this work, we demonstrate the real world results of a verification service that verifies the performance of a set of network providers by measuring the user flows, using GENI experimental facility. We first give an overview of the architectural components and their interactions to enable such a verification capability. We then give the experiment setup details followed by the numerical results for various network measurement metrics and the evaluation of these results.}, journal={2014 THIRD GENI RESEARCH AND EDUCATIONAL EXPERIMENT WORKSHOP (GREE)}, author={Babaoglu, Ahmet Can and Dutta, Rudra}, year={2014}, pages={65–68} }
 @article{wolf_griffioen_calvert_dutta_rouskas_baldin_nagurney_2014, title={ChoiceNet: Toward an Economy Plane for the Internet}, volume={44}, ISSN={["1943-5819"]}, DOI={10.1145/2656877.2656886}, abstractNote={The Internet has been a key enabling technology for many new distributed applications and services. However, the deployment of new protocols and services in the Internet infrastructure itself has been sluggish, especially where economic incentives for network providers are unclear. In our work, we seek to develop an "economy plane" for the Internet that enables network providers to offer new network-based services (QoS, storage, etc.) for sale to customers. The explicit connection between economic relationships and network services across various time scales enables users to select among service alternatives. The resulting competition among network service providers will lead to overall better technological solutions and more competitive prices. In this paper, we present the architectural aspects of our ChoiceNet economy plane as well as some of the technological problems that need to be addressed in a practical deployment.}, number={3}, journal={ACM SIGCOMM COMPUTER COMMUNICATION REVIEW}, author={Wolf, Tilman and Griffioen, James and Calvert, Ken and Dutta, Rudra and Rouskas, George and Baldin, Ilya and Nagurney, Anna}, year={2014}, month={Jul}, pages={58–65} }
 @inproceedings{dutta_rouskas_baldiney_2013, title={Converging choice and service in future commodity optical networks using traffic grooming}, DOI={10.1109/icton.2013.6602954}, abstractNote={The problem of providing an agile, energy-aware, flexible optical network architecture is one of the challenges in optical networking in the coming decade. A key element in this challenge is the balancing of the benefits to customer and provider, and creating an agile system capable of reflecting both provider and customer interests on an ongoing basis as network conditions change. In this paper, we 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.}, booktitle={2013 15th international conference on transparent optical networks (icton 2013)}, author={Dutta, Rudra and Rouskas, G. and Baldiney, I.}, year={2013} }
 @book{pathak_dutta_2013, title={Designing for network and service continuity in wireless mesh networks}, DOI={10.1007/978-1-4614-4627-9}, abstractNote={“Designing for Network and Service Continuity in Wireless Mesh Networks” describes performance predictability of the new wireless mesh network paradigm, and describes considerations in designing netwo}, publisher={New York: Springer}, author={Pathak, P. H. and Dutta, Rudra}, year={2013} }
 @article{wang_iyer_dutta_rouskas_baldine_2013, title={Network Virtualization: Technologies, Perspectives, and Frontiers}, volume={31}, ISSN={["1558-2213"]}, DOI={10.1109/jlt.2012.2213796}, abstractNote={Network virtualization refers to a broad set of technologies. Commercial solutions have been offered by the industry for years, while more recently the academic community has emphasized virtualization as an enabler for network architecture research, deployment, and experimentation. We review the entire spectrum of relevant approaches with the goal of identifying the underlying commonalities. We offer a unifying definition of the term “network virtualization” and examine existing approaches to bring out this unifying perspective. We also discuss a set of challenges and research directions that we expect to come to the forefront as network virtualization technologies proliferate.}, number={4}, journal={JOURNAL OF LIGHTWAVE TECHNOLOGY}, author={Wang, Anjing and Iyer, Mohan and Dutta, Rudra and Rouskas, George N. and Baldine, Ilia}, year={2013}, month={Feb}, pages={523–537} }
 @article{pathak_dutta_2012, title={Centrality-based power control for hot-spot mitigation in multi-hop wireless networks}, volume={35}, ISSN={["1873-703X"]}, DOI={10.1016/j.comcom.2012.01.023}, abstractNote={When shortest path routing is employed in large scale multi-hop wireless networks such as sensor networks, nodes located near the center of the network have to perform disproportionate amount of relaying for others. Nodes in such traffic hot-spots deplete their batteries faster than others due to their high relay load. These traffic hot-spots also adversely affect the network capacity due to increased congestion in the regions. To solve the problem, various divergent routing schemes are used which route the data on center-avoiding divergent routing paths. Though they achieve better load balancing, overall relaying is increased significantly due to their longer routing paths. In this paper, we propose power control as a way for balancing relay load and mitigating hot-spots in wireless sensor networks. Using a heuristic based on the concept of centrality, we show that if we increase the power levels of only the nodes which are expected to relay more packets, significant relay load balancing can be achieved even with shortest path routing. Different from divergent routing schemes, such load balancing strategy is applicable to any arbitrary topology and traffic pattern. With extensive simulations, we show that centrality based power control can drastically increase the network lifetime of sensor networks. We compare its performance with other divergent routing schemes and multiple battery level assignment strategy. Also, it is shown that centrality based power control results into better throughput capacity in many different topologies.}, number={9}, journal={COMPUTER COMMUNICATIONS}, author={Pathak, Parth H. and Dutta, Rudra}, year={2012}, month={May}, pages={1074–1085} }
 @article{wolf_griffioen_calvert_dutta_rouskas_baldine_nagurney_2012, title={Choice as a Principle in Network Architecture}, volume={42}, ISSN={["1943-5819"]}, DOI={10.1145/2377677.2377703}, abstractNote={There has been a great interest in defining a new network architecture that can meet the needs of a future Internet. One of the main challenges in this context is how to realize the many different technical solutions that have developed in recent years in a single coherent architecture. In addition, it is necessary to consider how to ensure economic viability of architecture solutions. In this work, we discuss how to design a network architecture where choices at different layers of the protocol stack are explicitly exposed to users. This approach ensures that innovative technical solutions can be used and rewarded, which is essential to encourage wide deployment of this architecture.}, number={4}, journal={ACM SIGCOMM COMPUTER COMMUNICATION REVIEW}, author={Wolf, Tilman and Griffioen, Jim and Calvert, Ken and Dutta, Rudra and Rouskas, George and Baldine, Ilia and Nagurney, Anna}, year={2012}, month={Oct}, pages={105–106} }
 @inproceedings{deuskar_pathak_dutta_2012, title={Packet aggregation based back-pressure scheduling in multi-hop wireless networks}, DOI={10.1109/wcnc.2012.6213972}, abstractNote={The back-pressure based scheduling policy originally proposed by Tassiulas et al. in [1] has shown the potential of solving many fairness and network utilization related problems of wireless multi-hop networks. Recently, the scheduling policy has been adapted in random medium access protocols such as CSMA/CA using prioritization of MAC layer transmissions. Here, MAC priorities are used to provide differentiated services to nodes depending on their queue backlogs. Even though these schemes work well in experiments to emulate back-pressure scheduling, they perform poorly with realistic Internet-type traffic where there is a large variation in packet sizes. In this paper, we propose packet aggregation based back-pressure scheduling which aggressively increases the rates at which back-logged queues are served. Different from other aggregation schemes, the presented scheme utilizes the back-pressure principles for determining when and how much aggregation is performed. We show that this results into increased service rates of back-logged queues which in turn results into high network throughput and utilization. We verify our scheme using simulations and testbed experiments, and show that it achieves significant performance improvements as compared to the original scheme.}, booktitle={2012 ieee wireless communications and networking conference (wcnc)}, author={Deuskar, G. and Pathak, P. H. and Dutta, Rudra}, year={2012}, pages={1263–1268} }
 @article{mukherjee_dutta_sivalingam_vokkarane_jukan_2012, title={Special Issue: Selected Papers from the Fourth International IEEE Symposium on Advanced Networks and Telecommunication Systems (IEEE ANTS 2010)}, volume={9}, ISSN={["1573-4277"]}, DOI={10.1016/j.osn.2012.01.001}, number={2}, journal={OPTICAL SWITCHING AND NETWORKING}, author={Mukherjee, Biswanath and Dutta, Rudra and Sivalingam, Krishna and Vokkarane, Vinod and Jukan, Admela}, year={2012}, month={Apr}, pages={145–146} }
 @article{touch_baldine_dutta_finn_ford_jordan_massey_matta_papadopoulos_reiher_et al._2011, title={A Dynamic Recursive Unified Internet Design (DRUID)}, volume={55}, ISSN={["1872-7069"]}, DOI={10.1016/j.comnet.2010.12.016}, abstractNote={The Dynamic Recursive Unified Internet Design (DRUID) is a future Internet design that unifies overlay networks with conventional layered network architectures. DRUID is based on the fundamental concept of recursion, enabling a simple and direct network architecture that unifies the data, control, management, and security aspects of the current Internet, leading to a more trustworthy network. DRUID’s architecture is based on a single recursive block that can adapt to support a variety of communication functions, including parameterized mechanisms for hard/soft state, flow and congestion control, sequence control, fragmentation and reassembly, compression, encryption, and error recovery. This recursion is guided by the structure of a graph of translation tables that help compartmentalize the scope of various functions and identifier spaces, while relating these spaces for resource discovery, resolution, and routing. The graph also organizes persistent state that coordinates behavior between individual data events (e.g., coordinating packets as a connection), among different associations (e.g., between connections), as well as helping optimize the recursive discovery process through caching, and supporting prefetching and distributed pre-coordination. This paper describes the DRUID architecture composed of these three parts (recursive block, translation tables, persistent state), and highlights its goals and benefits, including unifying the data, control, management, and security planes currently considered orthogonal aspects of network architecture.}, number={4}, journal={COMPUTER NETWORKS}, author={Touch, Joe and Baldine, Ilia and Dutta, Rudra and Finn, Gregory G. and Ford, Bryan and Jordan, Scott and Massey, Dan and Matta, Abraham and Papadopoulos, Christos and Reiher, Peter and et al.}, year={2011}, month={Mar}, pages={919–935} }
 @article{pathak_dutta_2011, title={A Survey of Network Design Problems and Joint Design Approaches in Wireless Mesh Networks}, volume={13}, ISSN={["1553-877X"]}, DOI={10.1109/surv.2011.060710.00062}, abstractNote={Over the last decade, the paradigm of Wireless Mesh Networks (WMNs) has matured to a reasonably commonly understood one, and there has been extensive research on various areas related to WMNs such as design, deployment, protocols, performance, etc. The quantity of research being conducted in the area of wireless mesh design has dramatically increased in the past few years, due to increasing interest in this paradigm as its potential for the "last few miles", and the possibility of significant wireless services in metropolitan area networks. This recent work has focused increasingly on joint design problems, together with studies in designing specific aspects of the WMN such as routing, power control etc. in isolation. While excellent surveys and tutorials pertaining to WMNs exist in literature, the explosive growth of research in the area of specific design issues, and especially joint design, has left them behind. Our objective in this paper is to identify the fundamental WMN design problems of interference modeling, power control, topology control, link scheduling, and routing, and provide brief overviews, together with a survey of the recent research on these topics, with special stress on joint design methods. We believe this paper will fulfill an outstanding need in informing the interested student and researcher in getting familiar with this abundant recent research area, and starting research.}, number={3}, journal={IEEE COMMUNICATIONS SURVEYS AND TUTORIALS}, author={Pathak, Parth H. and Dutta, Rudra}, year={2011}, pages={396–428} }
 @article{subramanian_dutta_2011, title={A study of performance and scalability metrics of a SIP proxy server - a practical approach}, volume={77}, ISSN={["0022-0000"]}, DOI={10.1016/j.jcss.2010.08.006}, abstractNote={In recent years, Internet Protocol (IP) telephony has been a real alternative to the traditional Public Switched Telephone Networks (PSTN). IP telephony offers more flexibility in the implementation of new features and services. The Session Initiation Protocol (SIP) is becoming a popular signalling protocol for Voice over IP (VoIP) based applications. The SIP proxy server is a software application that provides call routing services by parsing and forwarding all the incoming SIP packets in an IP telephony network. The efficiency of this process can create large scale, highly reliable packet voice networks for service providers and enterprises. We established that the efficient design and implementation of the SIP proxy server architecture can enhance the performance characteristics of a SIP proxy server significantly. Since SIP proxy server performance can be characterised by its transaction states of each SIP session, we emulated the M/M/1 performance model of the SIP proxy server and studied some of the key performance benchmarks such as average response time to process the SIP calls, and mean number of SIP calls in the system. We showed its limitations, and then studied an alternative M/M/c based SIP proxy server performance model with enhanced performance model and studied additional key performance characteristics such as server utilisation, queue size and memory utilisation. Provided the comparative results between the predicted results with the experimental results conducted in a lab environment.}, number={5}, journal={JOURNAL OF COMPUTER AND SYSTEM SCIENCES}, author={Subramanian, Sureshkumar V. and Dutta, Rudra}, year={2011}, month={Sep}, pages={884–897} }
 @inproceedings{babaoglu_dutta_2011, title={Benefits of multi wavelength approach to converter placement to support broadcast with available wavelengths}, DOI={10.1109/glocom.2011.6134393}, abstractNote={Optical networks are widely used in communication systems. Finding optimal converter placement for broadcast on optical networks has been an important area of research. In this problem, the free wavelengths on different links of a optical network are used to support network-wide broadcast, which is useful as a control channel or other OAM tasks. Previous work has articulated the essential difficulty of this problem. In this work, we recognize that bandwidth minimization is not an appropriate goal for this problem, and by using multiple wavelengths, and replicating some transmissions, it is possible to reduce the number of converters. We show example schemas to show that the difference in the optimal number of converters can be arbitrarily large, that adopting multiple wavelength paths whose union contains cycles can strictly reduce the optimal number, and then present a heuristic algorithm for broadcast path assignment to minimize converters under the new model.}, booktitle={2011 ieee global telecommunications conference (globecom 2011)}, author={Babaoglu, A. C. and Dutta, Rudra}, year={2011} }
 @inproceedings{biswas_dutta_2011, title={Spatially diffuse pathsets for robust routing in ad hoc networks}, DOI={10.1109/glocom.2011.6133499}, abstractNote={Ad hoc wireless networks are characterized by frequent node mobility, limited power reserves and interfering transmissions. On-demand routing proves to be more successful in such networks, as it reduces the traffic overhead of sending periodic updates, but they may be susceptible to both random uncertainty in radio links, and malicious jamming. We consider a network of nodes addressed by their locations, and propose a novel routing technique that we call Petal Routing, which maximizes reliability by using pathsets, made of diverse multiple paths, in place of a single path. Petal Routing takes advantage of the broadcast nature of wireless networks to reduce the number of transmissions for multiple paths by overlapping the multiple diverse paths. Various tunable parameters built into the approach can be used to improve metrics such as delay, number of transmissions and packet delivery ratio. We evaluate the performance of our scheme using extensive simulations, and show that it is viable.}, booktitle={2011 ieee global telecommunications conference (globecom 2011)}, author={Biswas, T. and Dutta, Rudra}, year={2011} }
 @article{dutta_schupke_somemura_2011, title={Special Issue: Green Communications and Networking}, volume={8}, ISSN={["1573-4277"]}, DOI={10.1016/j.osn.2011.05.001}, number={3}, journal={OPTICAL SWITCHING AND NETWORKING}, author={Dutta, Rudra and Schupke, Dominic and Somemura, Yoh}, year={2011}, month={Jul}, pages={129–130} }
 @article{chen_rouskas_dutta_2010, title={Clustering Methods for Hierarchical Traffic Grooming in Large-Scale Mesh WDM Networks}, volume={2}, ISSN={["1943-0639"]}, DOI={10.1364/jocn.2.000502}, abstractNote={We consider a hierarchical approach for traffic grooming in large multiwavelength networks of a general topology. Inspired by similar concepts in the airline industry, we decompose the network into clusters, and select a hub node in each cluster to groom traffic originating and terminating locally. At the second level of the hierarchy, the hub nodes form a virtual cluster for the purpose of grooming intra-cluster traffic. Clustering and hierarchical grooming enables us to cope with large network sizes and facilitates the control and management of traffic and network resources. Yet, determining the size and composition of clusters so as to yield good grooming solutions is a challenging task. We identify the grooming-specific factors affecting the selection of clusters, and we develop a parameterized clustering algorithm that can achieve a desired trade-off among various goals. We also obtain lower bounds on two important objectives in traffic grooming: the number of lightpaths and wavelengths needed to carry the subwavelength traffic. We demonstrate the effectiveness of clustering and hierarchical grooming by presenting the results of experiments on two network topologies that are substantially larger than those considered in previous traffic grooming studies.}, number={8}, journal={JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING}, author={Chen, Bensong and Rouskas, George N. and Dutta, Rudra}, year={2010}, month={Aug}, pages={502–514} }
 @article{jaikumar_dutta_2010, title={Differential capacity p-Cycles: A p-Cycle variant with increased capacity efficiency}, volume={7}, ISSN={1573-4277}, url={http://dx.doi.org/10.1016/j.osn.2010.05.002}, DOI={10.1016/j.osn.2010.05.002}, abstractNote={In this paper we introduce the concept of Differential Capacity p-Cycles as an enhancement to span protecting p-Cycles. DC cycles provide increased capacity efficiency by reducing the amount of spare capacity that needs to be reserved on each link of a cycle. Our results show a small reduction in spare capacity requirement over traditional p-Cycles. We also present a joint spare and working capacity allocation formulation, as well as DC formulations for flow and Failure Independent Path Protecting cycles, that give further improved capacity efficiency at the cost of a more complicated ILP. Results of ILP formulations of DC p-Cycles are compared to regular p-Cycles.}, number={4}, journal={Optical Switching and Networking}, publisher={Elsevier BV}, author={Jaikumar, Prashant and Dutta, Rudra}, year={2010}, month={Dec}, pages={185–195} }
 @article{mukherjee_subramaniam_sivalingam_dutta_datta_mohan_2010, title={Special Issue: Selected Papers from the Third International Symposium on Advanced Networks and Telecommunication Systems (ANTS 2009)}, volume={7}, ISSN={["1573-4277"]}, DOI={10.1016/j.osn.2010.08.001}, number={4}, journal={OPTICAL SWITCHING AND NETWORKING}, author={Mukherjee, Biswanath and Subramaniam, Suresh and Sivalingam, Krishna and Dutta, Rudra and Datta, Debasish and Mohan, Seshadri}, year={2010}, month={Dec}, pages={139–140} }
 @inproceedings{pathak_dutta_2010, title={Using centrality-based power control for hot-spot mitigation in wireless networks}, DOI={10.1109/glocom.2010.5683097}, abstractNote={When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportionate amount of relaying for others. To solve the problem, various divergent routing schemes are used which route the data on center-avoiding divergent routing paths. Though they achieve better load balancing, overall relaying is increased significantly due to their longer routing paths. In this paper, we propose power control as a way for balancing relay load and mitigating hot-spots in wireless networks. Using a heuristic based on the concept of centrality, we show that if we increase the power levels of only the nodes which are expected to relay more packets, significant relay load balancing can be achieved even with shortest path routing. Different from divergent routing schemes, such load balancing strategy is applicable to any arbitrary topology. Also, it is shown that centrality based power control results into better throughput capacity in many different topologies.}, booktitle={2010 ieee global telecommunications conference globecom 2010}, author={Pathak, P. H. and Dutta, Rudra}, year={2010} }
 @article{iyer_dutta_savage_2009, title={Minimizing transceivers in optical path networks}, volume={8}, ISSN={["1536-5379"]}, DOI={10.1364/JON.8.000454}, abstractNote={The problem of routing traffic on multihop clear optical channels and deciding the virtual topology of optical channels to form on a physical network of fibers to minimize the cost of electronic switching equipment has become known as traffic grooming in optical networks. Traffic grooming is recognized as an important research area, because the joint opto-electric routing problem is a hard one, yet necessary because of the large cost of pure electronic switching. This problem has been shown to be NP-complete (nondeterminstic polynomial complete) even for very simple practical topologies such as a path network. In previous work, we have shown that at least the subproblem of routing traffic on a given virtual topology to minimize electronic switching (NP-hard for path networks with arbitrary traffic matrices) becomes polynomial when the traffic on the path is restricted to be egress traffic, that is, all traffic requests are destined for a single egress node. In that work, the objective was to minimize the raw OEO (opto-electro-optic) metric (number of bits electronically switched per second) totaled over all network nodes. Of late, it has become clear that electronic switching equipment cost is best counted in quantized units, e.g., in the number of transceiver interfaces at network nodes. In this paper, we consider the traffic grooming problem in unidirectional, WDM path networks with the goal of minimizing the number of transceivers. We conclusively show that the problem is NP-hard, even under the restriction of the egress traffic model. In the case of egress traffic, we give a simple heuristic that will never be worse than twice the optimal.}, number={5}, journal={JOURNAL OF OPTICAL NETWORKING}, author={Iyer, Prashant and Dutta, Rudra and Savage, Carla D.}, year={2009}, month={May}, pages={454–461} }
 @article{mukherjee_subramaniam_jukan_sivalingam_dutta_2009, title={Special issue: Selected papers from The Second International Symposium on Advanced Networks and Telecommunication Systems (ANTS 2008)}, volume={6}, ISSN={["1573-4277"]}, DOI={10.1016/j.osn.2009.09.002}, number={4}, journal={OPTICAL SWITCHING AND NETWORKING}, author={Mukherjee, Biswanath and Subramaniam, Suresh and Jukan, Admela and Sivalingam, Krishna and Dutta, Rudra}, year={2009}, month={Dec}, pages={225–226} }
 @article{chen_rouskas_dutta_2008, title={On Hierarchical Traffic Grooming in WDM Networks}, volume={16}, ISSN={["1558-2566"]}, DOI={10.1109/TNET.2007.906655}, abstractNote={The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any but trivial network topologies. In this work, we present an effective and efficient hierarchical traffic grooming framework for WDM networks of general topology, with the objective of minimizing the total number of electronic ports. At the first level of hierarchy, we decompose the network into clusters and designate one node in each cluster as the hub for grooming traffic. At the second level, the hubs form another cluster for grooming intercluster traffic. We view each (first- or second-level) cluster as a virtual star, and we present an efficient near-optimal algorithm for determining the logical topology of lightpaths to carry the traffic within each cluster. Routing and wavelength assignment is then performed directly on the underlying physical topology. We demonstrate the effectiveness of our approach by applying it to two networks of realistic size, a 32-node, 53-link topology and a 47-node, 96-link network. Comparisons to lower bounds indicate that hierarchical grooming is efficient in its use of the network resources of interest, namely, electronic ports and wavelengths. In addition to scaling to large network sizes, our hierarchical approach also facilitates the control and management of multigranular networks.}, number={5}, journal={IEEE-ACM TRANSACTIONS ON NETWORKING}, author={Chen, Bensong and Rouskas, George N. and Dutta, Rudra}, year={2008}, month={Oct}, pages={1226–1238} }
 @inbook{chen_dutta_rouskas_2007, title={Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks}, ISBN={9783540727293}, url={http://dx.doi.org/10.1007/978-3-540-72731-6_28}, DOI={10.1007/978-3-540-72731-6_28}, abstractNote={We present a clustering algorithm for hierarchical traffic grooming in large WDM networks. In hierarchical grooming, the network is decomposed into clusters, and one hub node in each cluster is responsible for grooming traffic from and to the cluster. Hierarchical grooming scales to large network sizes and facilitates the control and management of traffic and network resources. Yet determining the size and composition of clusters so as to yield good grooming solutions is a challenging task. We identify the grooming-specific factors affecting the selection of clusters, and we develop a parameterized clustering algorithm that can achieve a desired tradeoff among various goals.}, booktitle={Optical Network Design and Modeling}, publisher={Springer Berlin Heidelberg}, author={Chen, Bensong and Dutta, Rudra and Rouskas, George N.}, year={2007}, month={Jul}, pages={249–258} }
 @article{iyer_dutta_savage_2007, title={Complexity of path traffic grooming}, volume={6}, ISSN={["1536-5379"]}, DOI={10.1364/JON.6.001270}, abstractNote={Feature Issue on Transmission in Optically Transparent Core NetworksThe problem of efficiently designing lightpaths and routing traffic on them in hybrid electro-optic data communication networks so that optical pass-through is maximized and the electronic switching cost is minimized is known as traffic grooming and has been studied extensively. Traffic grooming is known to be an inherently difficult problem. It has been shown to be NP-complete even for path networks, a simple topology in which lightpath wavelength assignment is tractable. In this paper, we explore the borderline between tractability and intractability by considering grooming in unidirectional path networks in which all traffic requests are destined for a single egress node. Whether the complete grooming problem is NP-hard with this restriction is an open question. We show that at least the problem of routing traffic on a given virtual topology to minimize electronic switching (NP-hard for path networks with arbitrary traffic matrices) becomes polynomial on the egress model. We also show that in the egress model, if the capacity constraint is relaxed, the entire problem becomes polynomial. If, in addition, traffic requests are uniform, we provide an explicit combinatorial formula for the optimum solution as well as an algorithm that constructs a routing that achieves this optimum. For the case of finite capacity and unit traffic requests, we show how to polynomially find a feasible solution that is optimal under reasonable assumptions.}, number={11}, journal={JOURNAL OF OPTICAL NETWORKING}, author={Iyer, Prashant and Dutta, Rudra and Savage, Carla D.}, year={2007}, month={Nov}, pages={1270–1281} }
 @article{huang_dutta_2007, title={Spare capacity provisioning for quasi-static traffic}, volume={51}, ISSN={["1872-7069"]}, DOI={10.1016/j.comnet.2007.08.006}, abstractNote={Resource provisioning has for long been an important area of research in network design. The traffic grooming problem in optical networks is a design problem of aggregating sub-wavelength traffic demands onto lightpaths and lightpaths onto fiber links such that the required electronic switching capability, hence network cost, can be minimized. Because of the reconfiguration cost in optical grooming networks, a reactive resource provisioning approach may become inefficient, and result in revenue loss. In this paper, we propose an over-provisioning scheme, which pre-allocates the spare capacity of lightpaths to dynamic sub-wavelength traffic demands such that the network can be more agile in responding to traffic increment requests. For the single-link case, we formulate the problem as a non-linear programming problem, and for under reasonable assumptions, we prove the objective function is convex. We provide an exact algorithm to find the optimal solution. The problem with general topologies is then studied. We prove the NP-hardness in this case, and propose heuristics. Numerical results show our heuristics perform well.}, number={18}, journal={COMPUTER NETWORKS}, author={Huang, Shu and Dutta, Rudra}, year={2007}, month={Dec}, pages={5011–5035} }
 @article{visweswara_dutta_sichitiu_2006, title={Adaptive ad hoc self-organizing scheduling for quasi-periodic sensor network lifetime}, volume={29}, ISSN={["1873-703X"]}, DOI={10.1016/j.comcom.2006.01.037}, abstractNote={Wireless sensor networks are poised to revolutionize our abilities in sensing and controlling our environment. Power conservation is a primary research concern for these networks. Often, the single most important savings can be obtained by switching off the wireless receiver when not needed. In this paper, we describe an algorithm which allows the nodes to learn the behavior of each other by only observing the transmission behaviors, and from this derive the schedule without external help. Our approach is robust to statistical variations in the nodal transmission periods. We draw important conclusions on the effect of quasi-periodicity on the scalability of the solution. We provide results of numerical simulations that show the effectiveness of our approach.}, number={17}, journal={COMPUTER COMMUNICATIONS}, author={Visweswara, Sharat C. and Dutta, Rudra and Sichitiu, Mihail L.}, year={2006}, month={Nov}, pages={3366–3384} }
 @article{chen_rouskas_dutta_2006, title={Traffic grooming in WDM ring networks to minimize the maximum electronic port cost.}, volume={2}, number={1}, journal={Optical Switching and Networking}, author={Chen, B. and Rouskas, G. and Dutta, R.}, year={2006}, pages={1–18} }
 @article{huang_dutta_rouskas_2006, title={Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms}, volume={24}, ISSN={["1558-0008"]}, DOI={10.1109/jsac-ocn.2006.04006}, number={4}, journal={IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS}, author={Huang, Shu and Dutta, Rudra and Rouskas, George N.}, year={2006}, month={Apr}, pages={66–82} }
 @inbook{chen_rouskas_dutta_2005, title={Applying clustering techniques to general topology traffic grooming}, ISBN={0780392779}, booktitle={Proceedings of IEEE / Create-net broadnets 2005}, publisher={Piscataway, N.J.: IEEE}, author={Chen, B. and Rouskas, G. and Dutta, R.}, year={2005}, pages={308–314} }
 @inbook{sichitiu_dutta_2005, title={Benefits of multiple battery levels for the lifetime of large wireless sensor networks}, volume={3462}, ISBN={3540258094}, DOI={10.1007/11422778_133}, abstractNote={In large wireless sensor networks, the few nodes close to the monitoring station are likely to prove the bottleneck in the useful lifetime of the network. We examine a strategy of equipping these nodes with a larger share of the total initial energy (battery) than the others, and generalizing this notion to the rest of the network. We solve a design problem involving optimizing the network lifetime using no more than a given number of distinct battery levels, and verify the results from the model by direct simulation.}, booktitle={Networking 2005: Networking technologies, services, and protocols: Performance of computer and communication networks: Mobile and wireless communication systems: 4th International IFIP-TC6 Networking Conference, Waterloo, Canada, May 2-6, 2005: Proceedings (Lecture notes in computer science; 3462)}, publisher={Berlin; New York: Springer}, author={Sichitiu, Mihail L. and Dutta, Rudra}, year={2005}, pages={1440–1444} }
 @inbook{chen_dutta_rouskas_2005, title={On the application of k-center algorithms in heirarchical traffic grooming}, ISBN={0780392779}, booktitle={Proceedings of the Second International IEEE/Create-net workshop on traffic grooming}, publisher={Los Alamitos, CA: IEEE Computer Society}, author={Chen, B. and Dutta, R. and Rouskas, G.}, year={2005}, pages={167–176} }
 @article{chen_rouskas_dutta_2005, title={Traffic grooming in WDM ring networks to minimize the maximum electronic port cost}, volume={2}, ISSN={1573-4277}, url={http://dx.doi.org/10.1016/j.osn.2005.01.002}, DOI={10.1016/j.osn.2005.01.002}, abstractNote={We consider the problem of traffic grooming in WDM ring networks. Traffic grooming is a variant of the well-known logical topology design problem, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Previous studies have focused on aggregate representations of the network cost. In this work, we consider a Min–Max objective, in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of high practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We present new theoretical results which demonstrate that traffic grooming with the Min–Max objective is NP-complete even when wavelength assignment is not an issue. We also present new polynomial-time traffic grooming algorithms for minimizing the maximum electronic port cost in both unidirectional and bidirectional rings. We evaluate our algorithms through experiments with a wide range of problem instances, by varying the network size, number of wavelengths, traffic load, and traffic pattern. Our results indicate that our algorithms produce solutions which are always close to the optimal and/or the lower bound, and which scale well to large network sizes, large number of wavelengths, and high loads. We also demonstrate that, despite the focus on minimizing the maximum cost, our algorithms also perform well in terms of the aggregate electronic port cost over all ring nodes.}, number={1}, journal={Optical Switching and Networking}, publisher={Elsevier BV}, author={Chen, Bensong and Rouskas, George N. and Dutta, Rudra}, year={2005}, month={May}, pages={1–18} }
 @article{srinivasarao_dutta_2005, title={Traffic-partitioning approaches to grooming ring access networks}, volume={4}, ISSN={["1536-5379"]}, DOI={10.1364/JON.4.000602}, abstractNote={Feature Isue on Optical Access Networks (OAN) As networks have evolved in sophistication, the twin concerns of quality-of-service (QoS) and efficiency have propagated down the hierarchical levels of networking and are now considered important in access networks as well. Motivated by these two concerns, researchers have recognized traffic grooming as an increasingly important area in optical networking in recent years. Very recently, a min-max approach to network cost optimization has emerged as a new focus area. In this approach, the maximum electronic-switching capability at any network node is sought to be minimized. In this paper, we propose heuristics for traffic grooming with this objective in ring networks, which are of practical importance, especially in access network architectures. We advance two approaches, both based on the concept of partitioning the traffic matrix, but in different ways. The approaches are of complementary strength, being useful for different traffic patterns. We present numerical results validating the performance of the algorithms.}, number={9}, journal={JOURNAL OF OPTICAL NETWORKING}, author={Srinivasarao, K and Dutta, R}, year={2005}, month={Sep}, pages={602–614} }
 @article{mahalati_dutta_2004, title={Reconfiguration of traffic grooming optical networks}, ISBN={["0-7695-2221-1"]}, DOI={10.1109/broadnets.2004.72}, abstractNote={Advances in optical data transmission and optical signal routing have caused wide expectation for optical networks to form tomorrow's backbone transport. One attractive feature of these networks is the ability to reconfigure the logical topology of the network seen by higher layers with comparative ease and speed by reconfiguring optical switches, without the need to modify the physical topology of the network. On the other hand, with the current mismatch of bandwidth available from individual wavelength channels and typical bandwidth demands, it is also widely recognized that grooming of subwavelength traffic into the full-wavelength channels is an indispensable component of optical network design. The topic of reconfiguration in optical networks that carry subwavelength traffic has received comparatively little attention. In this paper, we consider this problem. Our main contributions are as follows. We discuss the common basis on which grooming effectiveness and reconfiguration efficiency can be considered, and develop a reconfiguration cost function in keeping with this consideration. We formulate the joint problem of reconfiguration and grooming precisely, and offer a heuristic as well as an exact solution method to solve this problem. In offering numerical simulation results for our algorithms, we make the important observation that a disjoint sequential consideration of the two problems leads to solutions that are very inefficient in the joint sense.}, journal={FIRST INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS, PROCEEDINGS}, author={Mahalati, R and Dutta, R}, year={2004}, pages={170–179} }
 @inbook{chen_rouskas_dutta_2004, title={Traffic Grooming in WDM Ring Networks with the Min-Max Objective}, volume={3042}, ISBN={9783540219590 9783540246930}, ISSN={0302-9743 1611-3349}, url={http://dx.doi.org/10.1007/978-3-540-24693-0_15}, DOI={10.1007/978-3-540-24693-0_15}, abstractNote={We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consider a Min-Max objective, in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We prove that traffic grooming with the Min-Max objective is NP-Complete even when wavelength assignment is not an issue. We also present a new polynomial-time algorithm for Min-Max traffic grooming. Experiments with a wide range of problem instances demonstrate that our algorithm produces solutions which are always close to the optimal and/or the lower bound, and which scale well to large network sizes, large number of wavelengths, and high loads.}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Chen, Bensong and Rouskas, George N. and Dutta, Rudra}, year={2004}, pages={174–185} }
 @inproceedings{dutta_huang_rouskas_2003, title={On optimal traffic grooming in elemental network topologies.}, volume={5285}, booktitle={Proceedings of Opticomm 2003}, author={Dutta, R. and Huang, S. and Rouskas, G.}, year={2003} }
 @inproceedings{dutta_huang_rouskas_2003, title={Traffic grooming in path, star and tree networks: complexity, bounds, and algorithms}, ISBN={1581136641}, DOI={10.1145/781027.781066}, abstractNote={We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Our contribution is two-fold. In the first part of the paper we present 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. Since routing and wavelength assignment in these two topologies is trivial, these results demonstrate that traffic grooming is itself an inherently difficult problem. Our results have implications for ring and other more general topologies, which we explore. In the second part we design practical grooming algorithms with provable properties. Specifically, for all three topologies, we obtain a series of lower and upper bounds which are increasingly tighter but have considerably higher computational requirements; the series of upper bounds forms an algorithm for the traffic grooming problem with strong performance guarantees. We also present corresponding heuristics with good performance. Our work is a first step towards a formal and systematic approach to the grooming problem in general topologies that builds upon results and algorithms for more elementary networks}, booktitle={Proceedings of the ACM Sigmetrics, International Conference on Measurement and Modeling of Computer Systems}, author={Dutta, Rudra and Huang, S and Rouskas, G.}, year={2003}, pages={298–299} }
 @article{dutta_rouskas_2002, title={On optimal traffic grooming in WDM rings}, volume={20}, ISSN={["1558-0008"]}, DOI={10.1109/49.974666}, abstractNote={We consider the problem of designing a virtual topology to minimize electronic routing, that is, grooming traffic, in wavelength routed optical rings. The full virtual topology design problem is NP-hard even in the restricted case where the physical topology is a ring, and various heuristics have been proposed in the literature for obtaining good solutions, usually for different classes of problem instances. We present a new framework which can be used to evaluate the performance of heuristics and which requires significantly less computation than evaluating the optimal solution. This framework is based on a general formulation of the virtual topology problem, and it consists of a sequence of bounds, both upper and lower, in which each successive bound is at least as strong as the previous one. The successive bounds take larger amounts of computation to evaluate, and the number of bounds to be evaluated for a given problem instance is only limited by the computational power available. The bounds are based on decomposing the ring into sets of nodes arranged in a path and adopting the locally optimal topology within each set. While we only consider the objective of minimizing electronic routing in this paper, our approach to obtaining the sequence of bounds can be applied to many virtual topology problems on rings. The upper bounds we obtain also provide a useful series of heuristic solutions.}, number={1}, journal={IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS}, author={Dutta, R and Rouskas, GN}, year={2002}, month={Jan}, pages={110–121} }
 @article{dutta_rouskas_2002, title={Traffic grooming in WDM networks: past and future}, volume={16}, ISSN={0890-8044}, url={http://dx.doi.org/10.1109/mnet.2002.1081765}, DOI={10.1109/MNET.2002.1081765}, abstractNote={Traffic grooming refers to techniques used to combine low-speed traffic streams onto high-speed wavelengths in order to minimize the networkwide cost in terms of line terminating equipment and/or electronic switching. Such techniques become increasingly important for emerging network technologies, including SONET/WDM rings and MPLS/MP/spl lambda/S backbones, for which traffic grooming is essential. In this article we formally define the traffic grooming problem, and we provide a general formulation that captures the features of a wide range of problem variants. We then present a comprehensive comparative survey of the literature that unveils the significant amount of research on this subject (the traffic grooming past). We also offer a broad set of ambitious research directions (the traffic grooming future) that are motivated by the exciting new challenges arising with the advent of MP/spl lambda/S technology.}, number={6}, journal={IEEE Network}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Dutta, R. and Rouskas, G.N.}, year={2002}, month={Nov}, pages={46–56} }
 @inproceedings{dutta_rouskas_2001, title={On optimal traffic grooming in WDM rings.}, ISBN={1581133340}, DOI={10.1145/384268.378779}, abstractNote={We consider the problem of designing a virtual topology to minimize electronic routing, that is, grooming traffic, in wavelength routed optical rings. We present a new framework consisting of a sequence of bounds, both upper and lower, in which each successive bound is at least as strong as the previous one. The successive bounds take larger amounts of computation to evaluate, and the number of bounds to be evaluated for a given problem instance is only limited by the computational power available. The bounds are based on decomposing the ring into sets of nodes arranged in a path, and adopting the locally optimal topology within each set. Our approach can be applied to many virtual topology problems on rings. The upper bounds we obtain also provide a useful series of heuristic solutions.}, booktitle={Proceedings of ACM sigmetrics/performance 2001}, author={Dutta, Rudra and Rouskas, G. N.}, year={2001}, pages={164–174} }
 @article{dutta_rouskas_2000, title={A Survey of virtual topology design algorithms for wavelength routed networks.}, volume={1}, number={1}, journal={Optical Networks Magazine}, author={Dutta, R. and Rouskas, G. N.}, year={2000}, pages={73–89} }
 @inbook{dutta_rouskas_2000, title={Design of logical topologies for wavelength routed networks.}, ISBN={0792378253}, booktitle={Optical WDM networks: Principles and practice}, publisher={Boston: Kluwer Academic Publishers}, author={Dutta, R. and Rouskas, G. N.}, editor={K. M. Sivalingam and Subramaniam, S.Editors}, year={2000}, pages={79–102} }
 @inbook{dutta_savage, title={A Note on the complexity of converter placement supporting broadcast in WDM optical networks}, ISBN={0971625336}, booktitle={2005 International Conference on Telecommunication Systems, Modeling and Analysis}, author={Dutta, R. and Savage, C.}, pages={23–31} }
 @inproceedings{chen_rouskas_dutta, title={A framework for hierarchical traffic grooming in WDM networks of general topology}, booktitle={2nd International Conference on Broadband Networks (Broadnets 2005)}, author={Chen, B. S. and Rouskas, G. N. and Dutta, R.}, pages={167-} }
 @inproceedings{rouskas_baldine_calvert_dutta_griffioen_nagurney_wolf, title={ChoiceNet: Network innovation through choice}, booktitle={2013 17th International Conference on Optical Networking Design and Modeling (ONDM)}, author={Rouskas, G. N. and Baldine, I. and Calvert, K. and Dutta, R. and Griffioen, J. and Nagurney, A. and Wolf, T.}, pages={1–6} }
 @inproceedings{jaikumar_dutta, title={Differential capacity p-Cycles: A p-cycle variant with increased capacity efficiency}, booktitle={2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS 2009)}, author={Jaikumar, P. and Dutta, R.}, pages={97–99} }
 @inproceedings{pathak_dutta, title={Impact of power control on capacity of large scale wireless mesh networks}, booktitle={2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS 2009)}, author={Pathak, P. H. and Dutta, R.}, pages={79–81} }
 @inbook{huang_dutta, title={On optimal single link allocation of spare capacity for dynamic traffic grooming.}, ISBN={0971625336}, booktitle={2005 International Conference on Telecommunication Systems, Modeling and Analysis}, author={Huang, S. and Dutta, R.}, pages={255–264} }
 @inproceedings{chen_dutta_rouskas, title={On the application of k-center algorithms to hierarchical traffic grooming}, booktitle={2nd International Conference on Broadband Networks (Broadnets 2005)}, author={Chen, B. S. and Dutta, R. and Rouskas, G. N.}, pages={295-} }
 @inbook{iyer_dutta_savage, title={On the complexity of path traffic grooming.}, ISBN={0780392779}, booktitle={Proceedings of the Second International IEEE/Create-net workshop on traffic grooming}, publisher={Los Alamitos, CA: IEEE Computer Society}, author={Iyer, P. and Dutta, R. and Savage, C. D.}, pages={295–301} }
 @article{ramamurthy_dutta_mukherjee_sivaraman, title={Optical switching and networking}, volume={10}, number={4}, journal={Optical Switching and Networking}, author={Ramamurthy, B. and Dutta, R. and Mukherjee, B. and Sivaraman, V.}, pages={463–464} }
 @inbook{hsu_dutta, title={Providing end-to-end delay requirements in heterogeneous networks using zone delay assignment}, ISBN={0955062403}, booktitle={Proceedings of the Third International Conference on the Modeling and Evaluation of Heterogeneous Networks}, publisher={Piscataway, N.J.: IEEE}, author={Hsu, C-C. and Dutta, R.}, pages={56/1–5610} }
 @inproceedings{huang_dutta, title={Research problems in dynamic traffic grooming in optical networks}, booktitle={Proceedings of the first international workshop on traffic grooming}, author={Huang, S. and Dutta, R.} }
 @inbook{tiyachate_dutta, title={Subwavelength traffic protection without sacrificing grooming performance}, ISBN={9747990865}, booktitle={Proceedings of the 4th International Conference on Optical Communications}, publisher={Piscataway, N.J.: IEEE}, author={Tiyachate, R. and Dutta, R.}, pages={151–154} }
 @inproceedings{dutta_rouskas, title={Topology design in WDM rings to minimize electronic routing: efficient comutation of tight bounds.}, booktitle={Proceedings of the 38th Allerton Conference on Communication, Control and Computing}, author={Dutta, R. and Rouskas, G. N.}, pages={1284–1293} }
 @inbook{srinivasarao_dutta, title={Traffic-partitioning approaches to grooming ring networks}, ISBN={0769524508}, booktitle={Proceedings of Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, Papeete, Tahiti, 23-28 October 2005}, publisher={Los Alamitos, CA: IEEE Computer Society}, author={Srinivasarao, K. and Dutta, R.}, editor={P. Dini and Lorenz, P.Editors}, pages={6.1–66} }