Skip to main content

Raj Jain

Washington University in St. Louis, Computer science and engineering, Faculty Member

Followers

222

Following

2

Public Views

Raj Jain is a Fellow of IEEE, a Fellow of ACM, a Fellow of AAAS, a winner of 2017 ACM SIGCOMM Lifetime Achievement Award, 2015 A.A. Michelson Award, ACM SIGCOMM Test of Time award 2006, CDAC-ACCS Foundation Award 2009, IISc Distinguished Alumnus Award 2014, WiMAX Forum Individual Contribution Award 2008, and ranks among the top 90 in Citeseer's list of Most Cited Authors in Computer Science. Dr. Jain is currently a Professor of Computer Science and Engineering at Washington University in St. Louis. Previously, he was one of the Co-founders of Nayna Networks, Inc - a next generation telecommunications systems company in San Jose, CA. He was a Senior Consulting Engineer at Digital Equipment Corporation in Littleton, Mass and then a professor of Computer and Information Sciences at Ohio State University in Columbus, Ohio. He is the author of ``Art of Computer Systems Performance Analysis,'' which won the 1991 ``Best-Advanced How-to Book, Systems'' award from Computer Press Association. His fourth book entitled " High-Performance TCP/IP: Concepts, Issues, and Solutions," was published by Prentice Hall in November 2003. He has recently co-edited "Quality of Service Architectures for Wireless Networks: Performance Metrics and Management," published in April 2010.

less

Interests

Uploads

Papers by Raj Jain

Modeling and generation of AVC and SVC-TS mobile video traces for broadband access networks

MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems, 2010

We propose a simple model that is capable of capturing the statistical characteristics of mobile ... more We propose a simple model that is capable of capturing the statistical characteristics of mobile video traces encoded using MPEG4-Part2, AVC and SVC-TS encoding standards. The model can be adjusted to adapt to diverse workload configurations, which gives fellow researchers a great flexibility to evaluate different network traffic scenarios. We also discuss the modelbased trace generator and the challenges of its implementation. Moreover, we present the simulation results validating the model using different encoding settings. In addition to that, we provide several insights about our video modeling approach. This will help in testing, simulating and validating mobile video transmission and resource scheduling strategies over broadband wireless networks such as WiMAX and LTE..

Tokens for Anonymous Communications in the Internet

17th International Conference on Database and Expert Systems Applications (DEXA'06)

With the growth and acceptance of the Internet, there has been increased interest in maintaining ... more With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is talking to whom over a public network. This work develops a novel approach to hide the senders and the receivers of messages. Routes are chosen and frames traverse these routes. Each frame consists of a token and a node can send a message through a frame only when the corresponding token is free. The best thing about our protocol is that it poses no bandwidth overhead when there is at least some traffic while posing minimal bandwidth overhead when there is no traffic at all.

Feedback consolidation algorithms for ABR point-to-multipoint connections in ATM networks

Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169)

ABR tra c management for point-to-multipoint connections controls the source rate to the minimum ... more ABR tra c management for point-to-multipoint connections controls the source rate to the minimum rate supported by all the branches of the multicast tree. A n umber of algorithms have been developed for extending ABR congestion avoidance algorithms to perform feedback consolidation at the branch points. This paper discusses various design options and implementation alternatives for the consolidation algorithms, and proposes a number of new algorithms. The performance of the proposed algorithms and the previous algorithms is compared under a variety of conditions. Results indicate that the algorithms we propose eliminate the consolidation noise caused if the feedback is returned before all branches respond, while exhibiting a fast transient response.

Experience with ATM switch performance testing

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243)

For users to be able to compare performance of different switches, it is important to have a comm... more For users to be able to compare performance of different switches, it is important to have a common set of metrics. Examples of several such metrics and their measurements are presented in this paper. These measurements and metrics have impacted standardization efforts in this area. The key distinguishing feature of our effort is its emphasis on frame-level metrics (rather than cell-level metrics of the past). In particular, in this paper, we present definitions, methodologies, and measured results for frame latency, throughput, and maximum frame burst size (MFBS).

Overload based explicit rate switch schemes with MCR guarantees

Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370)

Dynamic resource allocation based on online traffic prediction for video streams

2010 IEEE 4th International Conference on Internet Multimedia Services Architecture and Application, IMSAA 2010, 2010

In this paper, we propose a new dynamic resource allocation (DRA) scheme to support the constantl... more In this paper, we propose a new dynamic resource allocation (DRA) scheme to support the constantly increasing online video stream traffic, especially high definition (HD) video streams. Our DRA scheme is based on online traffic prediction using seasonal time analysis. Our scheme seeks to provide accurate traffic prediction, to minimize the resource negotiation frequency, and to increase the utilization of the network resources while meeting maximum delay requirements. We validate our approach using various video traces, including our video collection of more than 50 HD video traces. We show through our results that our proposed scheme achieve up to 19.8% improvement in allocating bandwidth for short-length video traces, and up to 25% for long traces compared to the variable step-size adaptive (VSA) algorithm.

Virtual ID: A Technique for Mobility, Multi-Homing, and Location Privacy in Next Generation Wireless Networks

2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010, 2010

Cellular networking standards organizations such as the 3 rd Generation Partnership Project (3GPP... more Cellular networking standards organizations such as the 3 rd Generation Partnership Project (3GPP) are currently developing System Architecture Evolution (SAE) as their core network architecture. SAE is all-IP based. However, IP-based networks face several known issues, such as mobility, multihoming, location privacy, path preference, etc. Mobile IP (MIP) and its variants, such as Mobile IPv6 (MIPv6), Hierarchical MIP, and Proxy MIP, have been developed primarily to alleviate the mobility problem. These variation and extensions, however, still do not provide many of the features required in Next Generation Wireless Networks (NGWN). The limitations are especially due to the overloading of IP addresses as both node identity and locator. In this paper, we propose an extension to MIPv6 called Virtual ID. This concept applies the ID/Locator split idea into a Mobile IPv6 environment. Virtual ID and its extensions provide many features that would be desired in the NGWN. Since our proposed scheme is based on the standard MIPv6 and Proxy MIPv6, the scheme is fully compatible with the legacy MIPv6.

MILSA: A Mobility and Multihoming Supporting Identifier Locator Split Architecture for Naming in the Next Generation Internet

Naming and addressing are important issues for Next Generation Internet (NGI). In this paper, we ... more Naming and addressing are important issues for Next Generation Internet (NGI). In this paper, we discuss a new Mobility and Multihoming supporting Identifier Locator Split Architecture (MILSA). There are three main contributions of our solution. First, we separate trust relationships (realms) from connectivity (zones). A hierarchical identifier system for the realms and a Realm Zone Bridging Server (RZBS) infrastructure that performs the bridging function is introduced. Second, we separate the signaling and data plane functions to improve the performance and support mobility. Third, to provide transparency to the upper layer applications, identifier locator split happens in network layer. A Hierarchical URI-like Identifier (HUI) is used by the upper layers and is mapped to a locators set by HUI Mapping Sublayer (HMS) through interaction with RZBS infrastructure. Further scenarios description and analysis show the benefits of this scheme for routing scalability, mobility and multihoming.

eOCSA: An algorithm for burst mapping with strict QoS requirements in IEEE 802.16e Mobile WiMAX networks

2009 2nd IFIP Wireless Days, WD 2009, 2009

Mobile WiMAX systems based on the IEEE 802.16e standard require all downlink allocations to be ma... more Mobile WiMAX systems based on the IEEE 802.16e standard require all downlink allocations to be mapped to a rectangular region in the two dimensional subcarrier-time map. Many published resource allocation schemes ignore this requirement. It is possible that the allocations when mapped to rectangular regions may exceed the capacity of the downlink frame, and the QoS of some flows may be violated. The rectangle mapping problem is a variation of the bin or strip packing problem, which is known to be NP-complete. In a previous paper, an algorithm called OCSA (One Column Striping with nonincreasing Area first mapping) for rectangular mapping was introduced. In this paper, we propose an enhanced version of the algorithm. Similar to OCSA, the enhanced algorithm is also simple and fast to implement; however, eOCSA considers the allocation of an additional resource to ensure the QoS. eOCSA also avoids an enumeration process and so lowers the complexity to O(n 2).

Analysis of L-Band Digital Aeronautical Communication Systems: L-DACS1 and L-DACS2

<title>Protection and restoration in DWDM networks: recent developments and issues</title>

Protection using rings has been the common method of reducing downtime on SONET/SDH based telecom... more Protection using rings has been the common method of reducing downtime on SONET/SDH based telecommunication networks. With the trend towards IP over DWDM, there is a need for IP based protection and restoration mechanisms. In this paper, the mechanisms being developed at several standards organizations including OIF, IETF, and ITU are described. These mechanisms are in some sense more powerful than the previous SONET/SDH based mechanisms and protect against not only link and node failures but also against domain failures. Here domain refers to an entire region of the network. In particular, Shared Risk Group (SRG) concepts being developed at IETF and OIF is explained.

QoS-Energy aware Broadcast for Sensor Networks

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

We present QoS Geometric Broadcast Protocol (QoS-GBP), a novel broadcasting protocol for heteroge... more We present QoS Geometric Broadcast Protocol (QoS-GBP), a novel broadcasting protocol for heterogeneous wireless ad hoc and sensor networks. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. QoS-GBP is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. QoS-GBP enables a tradeoff among the need for neighborhood information (communication overhead) and the delay. QoS-GBP is scalable to the change in network size, node type, node density and topology. QoS-GBP accommodates seamlessly such network changes, including the presence of actors and mobile nodes in heterogeneous sensor networks. Through simulation evaluations, we show that QoS-GBP is very scalable and guarantees minimum delay.

Quality-based optical routing protocol

SPIE Proceedings, 2003

Optical networking, with its almost unlimited bandwidth, is the only technology that can support ... more Optical networking, with its almost unlimited bandwidth, is the only technology that can support communication new applications with high demand for bandwidth such as remote visualization, teleimmersion, collaborative e-science etc. In the optical networks presently deployed, each link is optically isolated by transponders doing O/E/O conversions. But these transponders are quite expensive and lack transparency; hence there is a strong motivation to use large all-optical networks. In all-optical networks, all routes need not have adequate signal quality. To provide reliable and transparent service, there is a strong interest in the industry for routing protocols that take into consideration the impairments of optical layer that degrade quality of the signal. We present a new routing protocol that uses information about the quality of signal to select paths in an all-optical network. Our simulations confirm that this new protocol reaches higher network utilization compared to existing ones.

A Vision of the Next Generation Internet: A Policy Oriented Perspective

International Journal of Computer Applications, 2010

The host centric design of the current Internet does not recognise data and end-users as integral... more The host centric design of the current Internet does not recognise data and end-users as integral entities of the system. The first generation of Internet has been very successful and yet business, organizations, governments are finding it difficult to enforce their policies on their networks with the same ease that they do other methods of communications and transport. Ad-Hoc solutions e.g. firewalls, NAT, middleboxes etc, that try to mitigate these issues end up providing localized myopic fixes which often hurt the basic underlying principles of the original design. We envision the future internet to be a dynamic, heterogeneous, secure, energy efficient ubiquitous network flexible enough to support innovations and policy enforcements both at the edge and the core. The first step towards the next generation is the redesign of naming and name binding mechanisms. We, therefore, propose a Policy Oriented Network Architecture (PONA) and an abstract two part protocol stack with a virtualization layer in between. We also introduce the concept of generalized communication end-points-hosts, users, data/services, instantiate the ideas with the Mapping and Negotiation layer and provide an integrated framework for the next generation Internet.

Multi-Tier Diversified Architecture for the Next Generation Internet

Proceedings of the International Conference on Cloud Computing & Virtualization 2010 CCV 2010, 2010

We propose a next generation Internet architecture that will allow natural sharing of resources a... more We propose a next generation Internet architecture that will allow natural sharing of resources among multiple organizations by dynamically reconfiguring and creating a virtual network for a particular application. Our architecture called "Internet 3.0" consists of a 3-tier object model. The bottom tier consists of a high-speed network infrastructure owned by multiple ISPs. The second tier consists of hosts owned by different organizations such as DoE, DARPA, Amazon, etc. The third tier consists of users and data objects. This is a three tiered virtualization model as compared to single tier virtualization being discussed in NSF's GENI and FIND communities. This three tiered virtualization model allows users to quickly setup a virtual cloud for any application. The users and data can easily move among the host clouds that themselves move on the infrastructure cloud. The users, data, hosts, and infrastructures are owned by different organizations that have their own policies for sharing and isolation. Also the multi-tiered virtualization concept allows each tier to recursively provide richer and more diversified set of core services to the tier above it.

A novel incrementally-deployable multi-granularity multihoming framework for the future internet

2012 IEEE Global Communications Conference (GLOBECOM), 2012

Multihoming practice in the current Internet is limited to hosts and autonomous systems (ASs). It... more Multihoming practice in the current Internet is limited to hosts and autonomous systems (ASs). It is "connectivity-oriented" without support for user or data multihoming. However, the swift migration of Internet from "connectivity-oriented" to "content-oriented" pattern urges to incorporate user and data level multihoming support in architecture designs instead of just through ad-hoc patches. In this paper, based on our previous research experience, we expand the multihoming concepts to both user and data levels based on the "multiple points of attachment" in a way similar to host multihoming. We propose a new incrementally-deployable multihoming framework by introducing a "realm" concept. The high-level user and data multihoming support can be built on top of the host and AS level multihoming in an incrementally-deployable and flexibly-assembled manner. Realms form a hierarchy of functionally dependable blocks. We define a new dimension of building block-slice which is an incrementally implementable functional unit for multihoming. Besides the long-term support for user and data multihoming, the first step deployment of the new framework is also able to address the short-term routing scalability challenge by reducing the total inter-domain routing table size gradually.

Geometric Broadcast Protocol for Heterogeneous Sensor Networks

Journal of Interconnection Networks, 2005

We present Geometric Broadcast for Heterogeneous Sensor Networks (GBS), a novel broadcasting prot... more We present Geometric Broadcast for Heterogeneous Sensor Networks (GBS), a novel broadcasting protocol for heterogeneous wireless sensor and actor networks. While broadcasting is a very energy expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. GBS is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. GBS does not need any neighborhood information and imposes very low communication overhead. GBS is scalable to the change in network size, node type, node density and topology. Furthermore it accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed, GBS takes advantage of actor nodes, and uses their resources when possible, thus reducing the energy consumption by sensor nodes. Throu...

ABR Flow Control for Multipoint Connections

IEEE Network, 1998

A survey of the research on future internet architectures

IEEE Communications Magazine, 2011

The current Internet, which was designed over 40 years ago, is facing unprecedented challenges in... more The current Internet, which was designed over 40 years ago, is facing unprecedented challenges in many aspects, especially in the commercial context. The emerging demands for security, mobility, content distribution, etc. are hard to be met by incremental changes through ad-hoc patches. New clean-slate architecture designs based on new design principles are expected to address these challenges. In this survey article, we investigate the key research topics in the area of future Internet architecture. Many ongoing research projects from United States, the European Union, Japan, China, and other places are introduced and discussed. We aim to draw an overall picture of the current research progress on the future Internet architecture.

Architectural Framework For Automatic Protection Provisioning in Dynamic Optical Rings OIF2001. 041

Outline z Background and Motivation z Optical Ring Architectures z Dynamic Provisioning z Future ... more

Modeling and generation of AVC and SVC-TS mobile video traces for broadband access networks

MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems, 2010

We propose a simple model that is capable of capturing the statistical characteristics of mobile ... more We propose a simple model that is capable of capturing the statistical characteristics of mobile video traces encoded using MPEG4-Part2, AVC and SVC-TS encoding standards. The model can be adjusted to adapt to diverse workload configurations, which gives fellow researchers a great flexibility to evaluate different network traffic scenarios. We also discuss the modelbased trace generator and the challenges of its implementation. Moreover, we present the simulation results validating the model using different encoding settings. In addition to that, we provide several insights about our video modeling approach. This will help in testing, simulating and validating mobile video transmission and resource scheduling strategies over broadband wireless networks such as WiMAX and LTE..

Tokens for Anonymous Communications in the Internet

17th International Conference on Database and Expert Systems Applications (DEXA'06)

With the growth and acceptance of the Internet, there has been increased interest in maintaining ... more With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is talking to whom over a public network. This work develops a novel approach to hide the senders and the receivers of messages. Routes are chosen and frames traverse these routes. Each frame consists of a token and a node can send a message through a frame only when the corresponding token is free. The best thing about our protocol is that it poses no bandwidth overhead when there is at least some traffic while posing minimal bandwidth overhead when there is no traffic at all.

Feedback consolidation algorithms for ABR point-to-multipoint connections in ATM networks

Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169)

ABR tra c management for point-to-multipoint connections controls the source rate to the minimum ... more ABR tra c management for point-to-multipoint connections controls the source rate to the minimum rate supported by all the branches of the multicast tree. A n umber of algorithms have been developed for extending ABR congestion avoidance algorithms to perform feedback consolidation at the branch points. This paper discusses various design options and implementation alternatives for the consolidation algorithms, and proposes a number of new algorithms. The performance of the proposed algorithms and the previous algorithms is compared under a variety of conditions. Results indicate that the algorithms we propose eliminate the consolidation noise caused if the feedback is returned before all branches respond, while exhibiting a fast transient response.

Experience with ATM switch performance testing

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243)

For users to be able to compare performance of different switches, it is important to have a comm... more For users to be able to compare performance of different switches, it is important to have a common set of metrics. Examples of several such metrics and their measurements are presented in this paper. These measurements and metrics have impacted standardization efforts in this area. The key distinguishing feature of our effort is its emphasis on frame-level metrics (rather than cell-level metrics of the past). In particular, in this paper, we present definitions, methodologies, and measured results for frame latency, throughput, and maximum frame burst size (MFBS).

Overload based explicit rate switch schemes with MCR guarantees

Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370)

Dynamic resource allocation based on online traffic prediction for video streams

2010 IEEE 4th International Conference on Internet Multimedia Services Architecture and Application, IMSAA 2010, 2010

In this paper, we propose a new dynamic resource allocation (DRA) scheme to support the constantl... more In this paper, we propose a new dynamic resource allocation (DRA) scheme to support the constantly increasing online video stream traffic, especially high definition (HD) video streams. Our DRA scheme is based on online traffic prediction using seasonal time analysis. Our scheme seeks to provide accurate traffic prediction, to minimize the resource negotiation frequency, and to increase the utilization of the network resources while meeting maximum delay requirements. We validate our approach using various video traces, including our video collection of more than 50 HD video traces. We show through our results that our proposed scheme achieve up to 19.8% improvement in allocating bandwidth for short-length video traces, and up to 25% for long traces compared to the variable step-size adaptive (VSA) algorithm.

Virtual ID: A Technique for Mobility, Multi-Homing, and Location Privacy in Next Generation Wireless Networks

2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010, 2010

Cellular networking standards organizations such as the 3 rd Generation Partnership Project (3GPP... more Cellular networking standards organizations such as the 3 rd Generation Partnership Project (3GPP) are currently developing System Architecture Evolution (SAE) as their core network architecture. SAE is all-IP based. However, IP-based networks face several known issues, such as mobility, multihoming, location privacy, path preference, etc. Mobile IP (MIP) and its variants, such as Mobile IPv6 (MIPv6), Hierarchical MIP, and Proxy MIP, have been developed primarily to alleviate the mobility problem. These variation and extensions, however, still do not provide many of the features required in Next Generation Wireless Networks (NGWN). The limitations are especially due to the overloading of IP addresses as both node identity and locator. In this paper, we propose an extension to MIPv6 called Virtual ID. This concept applies the ID/Locator split idea into a Mobile IPv6 environment. Virtual ID and its extensions provide many features that would be desired in the NGWN. Since our proposed scheme is based on the standard MIPv6 and Proxy MIPv6, the scheme is fully compatible with the legacy MIPv6.

MILSA: A Mobility and Multihoming Supporting Identifier Locator Split Architecture for Naming in the Next Generation Internet

Naming and addressing are important issues for Next Generation Internet (NGI). In this paper, we ... more Naming and addressing are important issues for Next Generation Internet (NGI). In this paper, we discuss a new Mobility and Multihoming supporting Identifier Locator Split Architecture (MILSA). There are three main contributions of our solution. First, we separate trust relationships (realms) from connectivity (zones). A hierarchical identifier system for the realms and a Realm Zone Bridging Server (RZBS) infrastructure that performs the bridging function is introduced. Second, we separate the signaling and data plane functions to improve the performance and support mobility. Third, to provide transparency to the upper layer applications, identifier locator split happens in network layer. A Hierarchical URI-like Identifier (HUI) is used by the upper layers and is mapped to a locators set by HUI Mapping Sublayer (HMS) through interaction with RZBS infrastructure. Further scenarios description and analysis show the benefits of this scheme for routing scalability, mobility and multihoming.

eOCSA: An algorithm for burst mapping with strict QoS requirements in IEEE 802.16e Mobile WiMAX networks

2009 2nd IFIP Wireless Days, WD 2009, 2009

Mobile WiMAX systems based on the IEEE 802.16e standard require all downlink allocations to be ma... more Mobile WiMAX systems based on the IEEE 802.16e standard require all downlink allocations to be mapped to a rectangular region in the two dimensional subcarrier-time map. Many published resource allocation schemes ignore this requirement. It is possible that the allocations when mapped to rectangular regions may exceed the capacity of the downlink frame, and the QoS of some flows may be violated. The rectangle mapping problem is a variation of the bin or strip packing problem, which is known to be NP-complete. In a previous paper, an algorithm called OCSA (One Column Striping with nonincreasing Area first mapping) for rectangular mapping was introduced. In this paper, we propose an enhanced version of the algorithm. Similar to OCSA, the enhanced algorithm is also simple and fast to implement; however, eOCSA considers the allocation of an additional resource to ensure the QoS. eOCSA also avoids an enumeration process and so lowers the complexity to O(n 2).

Analysis of L-Band Digital Aeronautical Communication Systems: L-DACS1 and L-DACS2

<title>Protection and restoration in DWDM networks: recent developments and issues</title>

Protection using rings has been the common method of reducing downtime on SONET/SDH based telecom... more Protection using rings has been the common method of reducing downtime on SONET/SDH based telecommunication networks. With the trend towards IP over DWDM, there is a need for IP based protection and restoration mechanisms. In this paper, the mechanisms being developed at several standards organizations including OIF, IETF, and ITU are described. These mechanisms are in some sense more powerful than the previous SONET/SDH based mechanisms and protect against not only link and node failures but also against domain failures. Here domain refers to an entire region of the network. In particular, Shared Risk Group (SRG) concepts being developed at IETF and OIF is explained.

QoS-Energy aware Broadcast for Sensor Networks

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

We present QoS Geometric Broadcast Protocol (QoS-GBP), a novel broadcasting protocol for heteroge... more We present QoS Geometric Broadcast Protocol (QoS-GBP), a novel broadcasting protocol for heterogeneous wireless ad hoc and sensor networks. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. QoS-GBP is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. QoS-GBP enables a tradeoff among the need for neighborhood information (communication overhead) and the delay. QoS-GBP is scalable to the change in network size, node type, node density and topology. QoS-GBP accommodates seamlessly such network changes, including the presence of actors and mobile nodes in heterogeneous sensor networks. Through simulation evaluations, we show that QoS-GBP is very scalable and guarantees minimum delay.

Quality-based optical routing protocol

SPIE Proceedings, 2003

Optical networking, with its almost unlimited bandwidth, is the only technology that can support ... more Optical networking, with its almost unlimited bandwidth, is the only technology that can support communication new applications with high demand for bandwidth such as remote visualization, teleimmersion, collaborative e-science etc. In the optical networks presently deployed, each link is optically isolated by transponders doing O/E/O conversions. But these transponders are quite expensive and lack transparency; hence there is a strong motivation to use large all-optical networks. In all-optical networks, all routes need not have adequate signal quality. To provide reliable and transparent service, there is a strong interest in the industry for routing protocols that take into consideration the impairments of optical layer that degrade quality of the signal. We present a new routing protocol that uses information about the quality of signal to select paths in an all-optical network. Our simulations confirm that this new protocol reaches higher network utilization compared to existing ones.

A Vision of the Next Generation Internet: A Policy Oriented Perspective

International Journal of Computer Applications, 2010

The host centric design of the current Internet does not recognise data and end-users as integral... more The host centric design of the current Internet does not recognise data and end-users as integral entities of the system. The first generation of Internet has been very successful and yet business, organizations, governments are finding it difficult to enforce their policies on their networks with the same ease that they do other methods of communications and transport. Ad-Hoc solutions e.g. firewalls, NAT, middleboxes etc, that try to mitigate these issues end up providing localized myopic fixes which often hurt the basic underlying principles of the original design. We envision the future internet to be a dynamic, heterogeneous, secure, energy efficient ubiquitous network flexible enough to support innovations and policy enforcements both at the edge and the core. The first step towards the next generation is the redesign of naming and name binding mechanisms. We, therefore, propose a Policy Oriented Network Architecture (PONA) and an abstract two part protocol stack with a virtualization layer in between. We also introduce the concept of generalized communication end-points-hosts, users, data/services, instantiate the ideas with the Mapping and Negotiation layer and provide an integrated framework for the next generation Internet.

Multi-Tier Diversified Architecture for the Next Generation Internet

Proceedings of the International Conference on Cloud Computing & Virtualization 2010 CCV 2010, 2010

We propose a next generation Internet architecture that will allow natural sharing of resources a... more We propose a next generation Internet architecture that will allow natural sharing of resources among multiple organizations by dynamically reconfiguring and creating a virtual network for a particular application. Our architecture called "Internet 3.0" consists of a 3-tier object model. The bottom tier consists of a high-speed network infrastructure owned by multiple ISPs. The second tier consists of hosts owned by different organizations such as DoE, DARPA, Amazon, etc. The third tier consists of users and data objects. This is a three tiered virtualization model as compared to single tier virtualization being discussed in NSF's GENI and FIND communities. This three tiered virtualization model allows users to quickly setup a virtual cloud for any application. The users and data can easily move among the host clouds that themselves move on the infrastructure cloud. The users, data, hosts, and infrastructures are owned by different organizations that have their own policies for sharing and isolation. Also the multi-tiered virtualization concept allows each tier to recursively provide richer and more diversified set of core services to the tier above it.

A novel incrementally-deployable multi-granularity multihoming framework for the future internet

2012 IEEE Global Communications Conference (GLOBECOM), 2012

Multihoming practice in the current Internet is limited to hosts and autonomous systems (ASs). It... more Multihoming practice in the current Internet is limited to hosts and autonomous systems (ASs). It is "connectivity-oriented" without support for user or data multihoming. However, the swift migration of Internet from "connectivity-oriented" to "content-oriented" pattern urges to incorporate user and data level multihoming support in architecture designs instead of just through ad-hoc patches. In this paper, based on our previous research experience, we expand the multihoming concepts to both user and data levels based on the "multiple points of attachment" in a way similar to host multihoming. We propose a new incrementally-deployable multihoming framework by introducing a "realm" concept. The high-level user and data multihoming support can be built on top of the host and AS level multihoming in an incrementally-deployable and flexibly-assembled manner. Realms form a hierarchy of functionally dependable blocks. We define a new dimension of building block-slice which is an incrementally implementable functional unit for multihoming. Besides the long-term support for user and data multihoming, the first step deployment of the new framework is also able to address the short-term routing scalability challenge by reducing the total inter-domain routing table size gradually.

Geometric Broadcast Protocol for Heterogeneous Sensor Networks

Journal of Interconnection Networks, 2005

We present Geometric Broadcast for Heterogeneous Sensor Networks (GBS), a novel broadcasting prot... more We present Geometric Broadcast for Heterogeneous Sensor Networks (GBS), a novel broadcasting protocol for heterogeneous wireless sensor and actor networks. While broadcasting is a very energy expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. GBS is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. GBS does not need any neighborhood information and imposes very low communication overhead. GBS is scalable to the change in network size, node type, node density and topology. Furthermore it accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed, GBS takes advantage of actor nodes, and uses their resources when possible, thus reducing the energy consumption by sensor nodes. Throu...

ABR Flow Control for Multipoint Connections

IEEE Network, 1998

A survey of the research on future internet architectures

IEEE Communications Magazine, 2011

The current Internet, which was designed over 40 years ago, is facing unprecedented challenges in... more The current Internet, which was designed over 40 years ago, is facing unprecedented challenges in many aspects, especially in the commercial context. The emerging demands for security, mobility, content distribution, etc. are hard to be met by incremental changes through ad-hoc patches. New clean-slate architecture designs based on new design principles are expected to address these challenges. In this survey article, we investigate the key research topics in the area of future Internet architecture. Many ongoing research projects from United States, the European Union, Japan, China, and other places are introduced and discussed. We aim to draw an overall picture of the current research progress on the future Internet architecture.

Architectural Framework For Automatic Protection Provisioning in Dynamic Optical Rings OIF2001. 041

Outline z Background and Motivation z Optical Ring Architectures z Dynamic Provisioning z Future ... more