Advances in Grid technology enable the deployment of data-intensive distributed applications, which require moving Terabytes or even Petabytes of data
between data banks. The current underlying networks cannot provide dedicated links with adequate end-to-end sustained bandwidth to support the requirements of these Grid applications. DWDM-RAM1 is a novel service-oriented architecture, which harnesses the enormous bandwidth potential of optical networks and demonstrates their on-demand nsage on the OMNlnet. Preliminary experiments suggest that dynamic optical networks, such as the OMNlnet, are the ideal option for transferring such massive amounts of data. DWDM-RAM incorporates an OGSI/OGSA compliant service interface and will promote greater convergence between dynamic optical networks and data intensive Grid computing.
DWDM-RAM: An Architecture for Data Intensive Service Enabled by Next Generati...Tal Lavian Ph.D.
An architecture is proposed for data-intensive services enabled by next generation dynamic optical networks. The architecture supports new data communication services that allow for coordinating extremely large sets of distributed data. The architecture allows for novel features including algorithms for optimizing and scheduling data transfers,methods for allocating and scheduling network resources, and an intelligent middleware platform that is capable of interfacing application level services to the underlying optical technologies. The significance of the architecture is twofold: 1) it encapsulates “optical network resources” into a service framework to support dynamically provisioned and advance scheduled data-intensive transport services, and 2) it establishes a generalized enabling framework for intelligent services and applications over next generation networks, not necessarily optical end-to-end. DWDM-RAM1 is an implementation version of the architecture, which is conceptual as well as experimental. This architecture has been implemented in prototype on OMNInet, which is an advanced experimental metro area optical testbed that is based on novel architecture, protocols, control plane services (Optical Dynamic Intelligent Network-ODIN2), and advanced photonic components. This paper presents the concepts behind the DWDM-RAM architecture and its design. The paper also describes an application scenario using the architecture’s data transfer service and network resource services over the agile OMNInet testbed.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A Platform for Large-Scale Grid Data Service on Dynamic High-Performance Netw...Tal Lavian Ph.D.
Data intensive Grid applications often deal with multiple terabytes and even petabytes of data. For them to be effectively deployed over distances, it is crucial that Grid infrastructures learn how to best exploit high-performance networks
(such as agile optical networks). The network footprint of these Grid applications show pronounced peaks and valleys in utilization, prompting for a radical overhaul of traditional network provisioning styles such as peak-provisioning, point-and-click or operator-assisted provisioning. A Grid stack must become capable to dynamically orchestrate a complex set of variables related to application requirements, data services, and network provisioning services, all within a rapidly and continually changing environment. Presented here is a platform that addresses some of these issues. This service platform closely integrates a set of large-scale data services with those for dynamic bandwidth allocation, through a network resource middleware service, using an OGSA-compliant interface allowing direct access by external applications. Recently, this platform has been implemented as an experimental research prototype on a unique wide area optical networking testbed incorporating state-of-the-art photonic
components. The paper, which presents initial results of research conducted on this prototype, indicates that these methods have the potential to address multiple major challenges related to data intensive applications. Given the complexities of this topic, especially where scheduling is required, only selected aspects of this platform are considered in this paper.
DWDM-RAM: a data intensive Grid service architecture enabled by dynamic optic...Tal Lavian Ph.D.
Next generation applications and architectures (for example, Grids) are driving radical changes in the nature of traffic, service models, technology, and cost, creating opportunities for an advanced communications infrastructure to tackle next generation data services. To take advantage of these trends and opportunities, research communities are creating new architectures, such as the Open Grid Service Architecture (OGSA), which are being implemented in new prototype advanced infrastructures.
The DWDM-RAM project, funded by DARPA, is actively addressing the challenges of next generation applications. DWDM-RAM is an architecture for data- intensive services enabled by next generation dynamic optical networks. It develops and demonstrates a novel architecture for new data communication services, within the OGSA context, that allows for managing extremely large sets of distributed data. Novel features move network services beyond notions of the network as a managed resource, for example, by including capabilities for dynamic on-demand provisioning and advance scheduling. DWDM-RAM encapsulates optical network resources (Lambdas, lightpaths) into a Grid Service and integrates their management within the Open Grid Service Architecture. Migration to emerging standards such as WS-Resource Framework (WS-RF) should be staright forward.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
DWDM-RAM: An Architecture for Data Intensive Service Enabled by Next Generati...Tal Lavian Ph.D.
An architecture is proposed for data-intensive services enabled by next generation dynamic optical networks. The architecture supports new data communication services that allow for coordinating extremely large sets of distributed data. The architecture allows for novel features including algorithms for optimizing and scheduling data transfers,methods for allocating and scheduling network resources, and an intelligent middleware platform that is capable of interfacing application level services to the underlying optical technologies. The significance of the architecture is twofold: 1) it encapsulates “optical network resources” into a service framework to support dynamically provisioned and advance scheduled data-intensive transport services, and 2) it establishes a generalized enabling framework for intelligent services and applications over next generation networks, not necessarily optical end-to-end. DWDM-RAM1 is an implementation version of the architecture, which is conceptual as well as experimental. This architecture has been implemented in prototype on OMNInet, which is an advanced experimental metro area optical testbed that is based on novel architecture, protocols, control plane services (Optical Dynamic Intelligent Network-ODIN2), and advanced photonic components. This paper presents the concepts behind the DWDM-RAM architecture and its design. The paper also describes an application scenario using the architecture’s data transfer service and network resource services over the agile OMNInet testbed.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A Platform for Large-Scale Grid Data Service on Dynamic High-Performance Netw...Tal Lavian Ph.D.
Data intensive Grid applications often deal with multiple terabytes and even petabytes of data. For them to be effectively deployed over distances, it is crucial that Grid infrastructures learn how to best exploit high-performance networks
(such as agile optical networks). The network footprint of these Grid applications show pronounced peaks and valleys in utilization, prompting for a radical overhaul of traditional network provisioning styles such as peak-provisioning, point-and-click or operator-assisted provisioning. A Grid stack must become capable to dynamically orchestrate a complex set of variables related to application requirements, data services, and network provisioning services, all within a rapidly and continually changing environment. Presented here is a platform that addresses some of these issues. This service platform closely integrates a set of large-scale data services with those for dynamic bandwidth allocation, through a network resource middleware service, using an OGSA-compliant interface allowing direct access by external applications. Recently, this platform has been implemented as an experimental research prototype on a unique wide area optical networking testbed incorporating state-of-the-art photonic
components. The paper, which presents initial results of research conducted on this prototype, indicates that these methods have the potential to address multiple major challenges related to data intensive applications. Given the complexities of this topic, especially where scheduling is required, only selected aspects of this platform are considered in this paper.
DWDM-RAM: a data intensive Grid service architecture enabled by dynamic optic...Tal Lavian Ph.D.
Next generation applications and architectures (for example, Grids) are driving radical changes in the nature of traffic, service models, technology, and cost, creating opportunities for an advanced communications infrastructure to tackle next generation data services. To take advantage of these trends and opportunities, research communities are creating new architectures, such as the Open Grid Service Architecture (OGSA), which are being implemented in new prototype advanced infrastructures.
The DWDM-RAM project, funded by DARPA, is actively addressing the challenges of next generation applications. DWDM-RAM is an architecture for data- intensive services enabled by next generation dynamic optical networks. It develops and demonstrates a novel architecture for new data communication services, within the OGSA context, that allows for managing extremely large sets of distributed data. Novel features move network services beyond notions of the network as a managed resource, for example, by including capabilities for dynamic on-demand provisioning and advance scheduling. DWDM-RAM encapsulates optical network resources (Lambdas, lightpaths) into a Grid Service and integrates their management within the Open Grid Service Architecture. Migration to emerging standards such as WS-Resource Framework (WS-RF) should be staright forward.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
HYBRID OPTICAL AND ELECTRICAL NETWORK FLOWS SCHEDULING IN CLOUD DATA CENTRESijcsit
Hybrid intra-data centre networks, with optical and electrical capabilities, are attracting research interest
in recent years. This is attributed to the emergence of new bandwidth greedy applications and novel
computing paradigms. A key decision to make in networks of this type is the selection and placement of
suitable flows for switching in circuit network. Here, we propose an efficient strategy for flow selection and
placement suitable for hybrid Intra-cloud data centre networks. We further present techniques for
investigating bottlenecks in a packet networks and for the selection of flows to switch in circuit network.
The bottleneck technique is verified on a Software Defined Network (SDN) testbed. We also implemented
the techniques presented here in a scalable simulation experiment to investigate the impact of flow
selection on network performance. Results obtained from scalable simulation experiment indicate a
considerable improvement on average throughput, lower configuration delay, and stability of offloaded
flows..
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
ADAPTIVE RANDOM SPATIAL BASED CHANNEL ESTIMATION (ARSCE) FOR MILLIMETER WAVE ...IJCNCJournal
Millimeter-wave and mMIMO communications are the most essential success systems for next-generation wireless sensor networks to have enormous amounts of accessible throughput and spectrum. Through installing huge antenna arrays at the base station and performing coherent transceiver processing, mMIMO is a potential technology for enhancing the bandwidth efficiency of wireless sensor networks. The use of mmWave frequencies for mMIMO systems solves the problem of high path-loss through offering greater antenna gains. In this work, we provide a design with a random spatial sample structure that incorporates a totally random step before the analogue is received. It contains a totally random step before the analogue received signals are sent into the digital component of the HBF receiver. Adaptive random spatial based channel estimation (ARSCE) is proposed for channel session measurement collection, and an analogue combiner with valves has been used to estimate the signals at each receiving antenna. The proposed optimization problem formulation attempts to discover the orientations and gains of wideband channel routes. In addition, our proposed model has compared to various state-of-art techniques while considering error minimization.
A novel cache resolution technique for cooperative caching in wireless mobile...csandit
Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the
mobile clients while retrieving data and to reduce the traffic load in the network. Caching also
increases the availability of data due to server disconnections. The implementation of a
cooperative caching technique essentially involves four major design considerations (i) cache
placement and resolution, which decides where to place and how to locate the cached data (ii)
Cache admission control which decides the data to be cached (iii) Cache replacement which
makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e.
maintaining consistency between the data in server and cache. In this paper we propose an
effective cache resolution technique, which reduces the number of messages flooded in to the
network to find the requested data. The experimental results gives a promising result based on
the metrics of studies.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
A Cooperative Cache Management Scheme for IEEE802.15.4 based Wireless Sensor ...IJECEIAES
Wireless Sensor Networks (WSNs) based on the IEEE 802.15.4 MAC and PHY layer standards is a recent trend in the market. It has gained tremendous attention due to its low energy consumption characteristics and low data rates. However, for larger networks minimizing energy consumption is still an issue because of the dissemination of large overheads throughout the network. This consumption of energy can be reduced by incorporating a novel cooperative caching scheme to minimize overheads and to serve data with minimal latency and thereby reduce the energy consumption. This paper explores the possibilities to enhance the energy efficiency by incorporating a cooperative caching strategy.
Dynamic Hybrid Topology Design for Integrated Traffic Support in WDM Mesh Net...CSCJournals
The future Internet will require the transport of a wide range of services including high bandwidth one-to-many applications, with a dynamic interconnection of devices. WDM layer support realizes such services in a transparent, reliable and efficient way. Most of the recent studies have been focused on efficiently building and configuring light-paths for unicast or light-trees for multicast in isolation, and do not take existing traffic demands and configuration into consideration. In this paper we consider a dynamic design problem of integrated traffic in a realistic WDM mesh network. In such a network, new traffic demands of either multicast and/or unicast are supported dynamically in the presence of an existing mixture of traffic. The amount of bandwidth per wavelength is abundant, while the wavelengths and light splitting capabilities on WDM switches are limited. Using subwavelength sharing among traffic demands of unicast and multicast, we build a hybrid virtual topology that exploits both existing light-trees and light-paths. By optimizing WDM resources in addition to resource sharing with existing unicast and multicast demands, we truly maximize the WDM layer capability and efficiently support more traffic demands. We validate the efficiency of our approach with extensive simulations on various network topologies.
ON THE PERFORMANCE OF INTRUSION DETECTION SYSTEMS WITH HIDDEN MULTILAYER NEUR...IJCNCJournal
Deep learning applications, especially multilayer neural network models, result in network intrusion detection with high accuracy. This study proposes a model that combines a multilayer neural network with Dense Sparse Dense (DSD) multi-stage training to simultaneously improve the criteria related to the performance of intrusion detection systems on a comprehensive dataset UNSW-NB15. We conduct experiments on many neural network models such as Recurrent Neural Network (RNN), Long-Short Term Memory (LSTM), Gated Recurrent Unit (GRU), etc. to evaluate the combined efficiency with each model through many criteria such as accuracy, detection rate, false alarm rate, precision, and F1-Score.
In this paper, we examine WiMAX – based network and evaluate the performance for quality of service (QoS) using an idea of IEEE 802.16 technology. In our models, the study used a multiprocessor architecture organized by the interconnection network. OPNET Modeler is used to simulate the architecture and to calculate the performance criteria (i.e. throughput, delay and data dropped) that
slightly concerned in network estimation. It is concluded that our models shorten the time quite a bit for
obtaining the performance measures of an end-to-end delay as well as throughput can be used as an
effective tool for this purpose.
Efficient Design of p-Cycles for Survivability of WDM Networks Through Distri...CSCJournals
The optical networks provide the backbone infrastructure for telecommunication networks. Because of the high-speed of optical networks, network failure such as a cable cut or node failure may result in a tremendous loss of data and hence revenue received. The p-cycle is a novel approach reported for design of survivable optical WDM networks. They are preconfigured protection structure, combining fast restoration speed of ring and mesh protection efficiency. The main issue in p-cycle network design is to find a set of p-cycles to protect a given working capacity distribution so that total spare capacity used by the p-cycles is minimized. An Integer Linear Programming (ILP) is the most efficient method reported in the literature for designing of optimal p-cycles. Where complexity of ILP increases as the size of network increases, i.e., it is not so efficient in case of large networks. Recently, a new, promising concept to support dynamic demand environments has been introduced by Grover namely, the distributed cycle pre- configuration (DCPC) protocol, which is an adaptation of the processing rule of the self-healing network (SHN). However, it is generally unable to provide 100% protection of the working capacity under Spare Capacity Optimization (SCO) design model. Therefore in this paper we have proposed enhancements in DCPC to increase its protection level under single failure scenario. The main idea behind the proposed enhancement is it to fix the span as a straddle span of a p-cycle where unprotected working capacity is more. From the simulation of test case networks, it is found that the proposed scheme significantly increases ratio of protection under the SCO design model.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
HYBRID OPTICAL AND ELECTRICAL NETWORK FLOWS SCHEDULING IN CLOUD DATA CENTRESijcsit
Hybrid intra-data centre networks, with optical and electrical capabilities, are attracting research interest
in recent years. This is attributed to the emergence of new bandwidth greedy applications and novel
computing paradigms. A key decision to make in networks of this type is the selection and placement of
suitable flows for switching in circuit network. Here, we propose an efficient strategy for flow selection and
placement suitable for hybrid Intra-cloud data centre networks. We further present techniques for
investigating bottlenecks in a packet networks and for the selection of flows to switch in circuit network.
The bottleneck technique is verified on a Software Defined Network (SDN) testbed. We also implemented
the techniques presented here in a scalable simulation experiment to investigate the impact of flow
selection on network performance. Results obtained from scalable simulation experiment indicate a
considerable improvement on average throughput, lower configuration delay, and stability of offloaded
flows..
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
ADAPTIVE RANDOM SPATIAL BASED CHANNEL ESTIMATION (ARSCE) FOR MILLIMETER WAVE ...IJCNCJournal
Millimeter-wave and mMIMO communications are the most essential success systems for next-generation wireless sensor networks to have enormous amounts of accessible throughput and spectrum. Through installing huge antenna arrays at the base station and performing coherent transceiver processing, mMIMO is a potential technology for enhancing the bandwidth efficiency of wireless sensor networks. The use of mmWave frequencies for mMIMO systems solves the problem of high path-loss through offering greater antenna gains. In this work, we provide a design with a random spatial sample structure that incorporates a totally random step before the analogue is received. It contains a totally random step before the analogue received signals are sent into the digital component of the HBF receiver. Adaptive random spatial based channel estimation (ARSCE) is proposed for channel session measurement collection, and an analogue combiner with valves has been used to estimate the signals at each receiving antenna. The proposed optimization problem formulation attempts to discover the orientations and gains of wideband channel routes. In addition, our proposed model has compared to various state-of-art techniques while considering error minimization.
A novel cache resolution technique for cooperative caching in wireless mobile...csandit
Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the
mobile clients while retrieving data and to reduce the traffic load in the network. Caching also
increases the availability of data due to server disconnections. The implementation of a
cooperative caching technique essentially involves four major design considerations (i) cache
placement and resolution, which decides where to place and how to locate the cached data (ii)
Cache admission control which decides the data to be cached (iii) Cache replacement which
makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e.
maintaining consistency between the data in server and cache. In this paper we propose an
effective cache resolution technique, which reduces the number of messages flooded in to the
network to find the requested data. The experimental results gives a promising result based on
the metrics of studies.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
A Cooperative Cache Management Scheme for IEEE802.15.4 based Wireless Sensor ...IJECEIAES
Wireless Sensor Networks (WSNs) based on the IEEE 802.15.4 MAC and PHY layer standards is a recent trend in the market. It has gained tremendous attention due to its low energy consumption characteristics and low data rates. However, for larger networks minimizing energy consumption is still an issue because of the dissemination of large overheads throughout the network. This consumption of energy can be reduced by incorporating a novel cooperative caching scheme to minimize overheads and to serve data with minimal latency and thereby reduce the energy consumption. This paper explores the possibilities to enhance the energy efficiency by incorporating a cooperative caching strategy.
Dynamic Hybrid Topology Design for Integrated Traffic Support in WDM Mesh Net...CSCJournals
The future Internet will require the transport of a wide range of services including high bandwidth one-to-many applications, with a dynamic interconnection of devices. WDM layer support realizes such services in a transparent, reliable and efficient way. Most of the recent studies have been focused on efficiently building and configuring light-paths for unicast or light-trees for multicast in isolation, and do not take existing traffic demands and configuration into consideration. In this paper we consider a dynamic design problem of integrated traffic in a realistic WDM mesh network. In such a network, new traffic demands of either multicast and/or unicast are supported dynamically in the presence of an existing mixture of traffic. The amount of bandwidth per wavelength is abundant, while the wavelengths and light splitting capabilities on WDM switches are limited. Using subwavelength sharing among traffic demands of unicast and multicast, we build a hybrid virtual topology that exploits both existing light-trees and light-paths. By optimizing WDM resources in addition to resource sharing with existing unicast and multicast demands, we truly maximize the WDM layer capability and efficiently support more traffic demands. We validate the efficiency of our approach with extensive simulations on various network topologies.
ON THE PERFORMANCE OF INTRUSION DETECTION SYSTEMS WITH HIDDEN MULTILAYER NEUR...IJCNCJournal
Deep learning applications, especially multilayer neural network models, result in network intrusion detection with high accuracy. This study proposes a model that combines a multilayer neural network with Dense Sparse Dense (DSD) multi-stage training to simultaneously improve the criteria related to the performance of intrusion detection systems on a comprehensive dataset UNSW-NB15. We conduct experiments on many neural network models such as Recurrent Neural Network (RNN), Long-Short Term Memory (LSTM), Gated Recurrent Unit (GRU), etc. to evaluate the combined efficiency with each model through many criteria such as accuracy, detection rate, false alarm rate, precision, and F1-Score.
In this paper, we examine WiMAX – based network and evaluate the performance for quality of service (QoS) using an idea of IEEE 802.16 technology. In our models, the study used a multiprocessor architecture organized by the interconnection network. OPNET Modeler is used to simulate the architecture and to calculate the performance criteria (i.e. throughput, delay and data dropped) that
slightly concerned in network estimation. It is concluded that our models shorten the time quite a bit for
obtaining the performance measures of an end-to-end delay as well as throughput can be used as an
effective tool for this purpose.
Efficient Design of p-Cycles for Survivability of WDM Networks Through Distri...CSCJournals
The optical networks provide the backbone infrastructure for telecommunication networks. Because of the high-speed of optical networks, network failure such as a cable cut or node failure may result in a tremendous loss of data and hence revenue received. The p-cycle is a novel approach reported for design of survivable optical WDM networks. They are preconfigured protection structure, combining fast restoration speed of ring and mesh protection efficiency. The main issue in p-cycle network design is to find a set of p-cycles to protect a given working capacity distribution so that total spare capacity used by the p-cycles is minimized. An Integer Linear Programming (ILP) is the most efficient method reported in the literature for designing of optimal p-cycles. Where complexity of ILP increases as the size of network increases, i.e., it is not so efficient in case of large networks. Recently, a new, promising concept to support dynamic demand environments has been introduced by Grover namely, the distributed cycle pre- configuration (DCPC) protocol, which is an adaptation of the processing rule of the self-healing network (SHN). However, it is generally unable to provide 100% protection of the working capacity under Spare Capacity Optimization (SCO) design model. Therefore in this paper we have proposed enhancements in DCPC to increase its protection level under single failure scenario. The main idea behind the proposed enhancement is it to fix the span as a straddle span of a p-cycle where unprotected working capacity is more. From the simulation of test case networks, it is found that the proposed scheme significantly increases ratio of protection under the SCO design model.
Google has launched Google Education or Classroom. Using a google jockey or google voice enhances teaching. Webquest powered by google let many topics get treated at the same time. Learn how.
Koning Boudewijn wilde André Leysen als premierThierry Debels
Vlak voor het overlijden van Boudewijn wordt André Leysen op het paleis ontboden. De koning had Leysen in gedachten om eind jaren zeventig, begin jaren tachtig een zakenkabinet te leiden. Maar de liefde tussen Boudewijn en Leysen was ondertussen fel bekoeld.
Leysen deed in 1993 immers enkele ‘alarmerende’ uitspraken over de financiële toestand van België. Voldoende om medio juli door Boudewijn ontboden te worden en een donderpreek te ontvangen.
Het personeel was met vakantie, kabinetschef Van Ypersele was wel aanwezig. Maar: ‘Boudewijn nam de bediening zelf waar.’
Gezellig werd het niet. De koning las Leysen de levieten. De boodschap kwam hard aan. Leysen was ‘onthutst’. Twee weken later overlijdt Boudewijn in Spanje.
Relevanter is dat Boudewijn aan een zakenkabinet dacht. In zijn biografie schrijft Leysen daarover het volgende: ‘Dat de koning met iemand met een “zwart” jeugdverleden over een eventueel ministerschap of liever nog de leiding van een regering sprak, was toch opmerkelijk.’
Boudewijn had na de val van de regering Martens III (in 1980) zeker gedurende een jaar tot anderhalf jaar een zakenregering onder leiding van Leysen voor ogen. Op die manier kon de parlementaire democratie omzeild worden.
Het toont aan dat de ideeën van Boudewijn over de parlementaire democratie niet zo veraf staan van die van zijn vader Leopold III. Sommigen drongen ook bij de vorst aan om zijn gezag te doen gelden.
IPSAS Implementation at the United Nations - Unis Valencia Williams-Baker, Un...OECD Governance
Presentation made by Unis Valencia Williams-Baker, United Nations, at the 16th Annual OECD Accruals Symposium held at the OECD Conference Centre, Paris, on 21-22 March 2016.
It's The Cause, Not the College: Expanding Content Marketing Beyond the BrandGene Begin
On campus, around the world, and even in its own marketing department, Babson College is entrepreneurial to the core. In 2013, the College experimented with creating a content marketing hub geared not toward traditional higher ed audiences like prospective students or engaged alumni, but instead aimed at the much broader sphere of people who share our passion for entrepreneurship. The site, Entrepreneurship of All Kinds™, rallies the community around a cause, not just a college, to extend our brand’s reach far beyond campus.
RANSlicing: Towards Multi-Tenancy in 5G Radio Access Networksijwmn
A significant purpose of 5G networks is allowing sharing resources among different network tenants such as service providers and Mobile Virtual network Operators. Numerous domains are taken in account regarding resource sharing containing different infrastructure (storage, compute and networking), Radio Access Network (RAN) and Radio Frequency (RF) spectrum. RAN and spectrum, transport. Spectrum sharing and RAN are anticipated as the fundamental part in multi-tenant 5G network. Nevertheless, there is a shortage of evaluation platforms to determine the number of benefits that can be acquired from multilevel spectrum sharing rather than single-level spectrum sharing. The work presented in this paper intend to address this issue by presenting a modified SimuLTE model is used for evaluating active RAN based on multi-tenant 5G networks. The result shows an understanding into the actual advantages of RAN slicing for multi-tenants in 5G networks.
DWDM-RAM: DARPA-Sponsored Research for Data Intensive Service-on-Demand Advan...Tal Lavian Ph.D.
The DWDM-RAM architecture identifies two distinct planes over the dynamic
underlying optical network:
the Data Grid Plane that speaks for the diverse requirements of a data-intensive application by providing generic data-intensive interfaces and services and
2) the Network Grid Plane that marshals the raw bandwidth of the underlying optical
network into network services, within the OGSI framework, and that matches the complex requirements specified by the Data Grid Plane.
At the application middleware layer, the Data Transfer Service (DTS) presents an interface between the system and an application. It receives high-level client requests, policy-and-access filtered, to transfer specific named blocks of data with specific advance scheduling constraints.
The network resource middleware layer consists of three services: the Data Handler Service (DHS), the Network Resource Service (NRS) and the Dynamic Lambda Grid Service (DLGS). Services of this layer initiate and control sharing of resources.
Project DRAC: Creating an applications-aware networkTal Lavian Ph.D.
Intelligent networking and the ability for applications to more effectively use all of the network’s capability, rather than just the transport “pipe,” have been elusive. Until now. Nortel has developed a proof-of-concept software capability — service-mediation “middleware” called the Dynamic Resource Allocation Controller (DRAC) — that runs on any Java platform and opens up the network to applications with proper credentials,making available all of the properties of a converged network, including service topology, time-of-day reservations, and interdomain connectivity options. With a more open network, applications can directly provision and invoke services, with no need for operator involvement or point-and click sessions. In its first real-world demonstrations in large research networks, DRAC is showing it can improve user satisfaction while reducing network operations and investment costs.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
Cloud Based Datacenter Network Acceleration Using FPGA for Data-Offloading Onyebuchi nosiri
Currently, the high-performance processors in Spine-Leaf, Mesh, and Router layer-3 (SLMR-3) backend server domain have multiple cores, but data offloading from processor to the peripheral is not keeping pace with the required Quality of Service (QoS) needed to balance the workload on a Warehouse Scaled Computer (WSC) running a developed Enterprise Energy Tracking Analytic Cloud Portal (EETACP) data center network. High speed with low latency interconnects between the processors and Field Programmable Gate Array (FPGA) is critical for achieving performance benefits in EETACP deployment. Most of the servers in WSC architectures are running at average utilization rates and perform well under peak processing power. These servers are good candidates for FPGA processors in cloud-based data centers owing to its acceleration coherency. This paper made a strong case for cloudbased support for EETACP. An FPGA-based Spine-Leaf model is proposed to be an alternative to traditional network models for EETACP provisioning. The paper analyzed reconfigurable FPGAs, characterized a simplified process model for hyperscale FPGA cloud design description. To validate the performance, comparisons was made with two similar networks, namely DCell and BCube for enterprise application deployments. It was concluded that FPGA-based DCN acceleration for EETACP offers acceptable QoS expectations
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
Network on Chip Architecture and Routing Techniques: A surveyIJRES Journal
The processor designing and development was designed to perform various complex logical information exchange and processing operations in a variety of resolutions. They mainly rely on concurrent and sync, both that of the software and hardware to enhance the productivity and performance. With the high speed growth approaching multi-billion transistor integration era, some of the main problems which are symbolized by all gate lengths in the range of 60-90 nm, will be from non-scalable delays generated by wire. All similar problems may be solved by using Network on Chip (NOC) systems. In the presented paper, we have summarized research papers and contributions in NOC area. With advancement in the technology in the on chip communication, faster interaction between devices is becoming vital. Network on Chip (NOC) can be one of the solutions for faster on chip communication. For efficient link between devices of NOC, routers are needed. This paper also reviews implementation of routing techniques. The use of routing gives higher throughput as required for dealing with complexity of modern systems. It is mainly focused on the routing design parameters on both system level including traffic pattern, network topology and routing algorithm, and architecture level including arbitration algorithm.
RESOURCE ALLOCATION ALGORITHMS FOR QOS OPTIMIZATION IN MOBILE WIMAX NETWORKSijwmn
WiMAX is based on the standard IEEE 802.16e-2009 for wireless access in Metropolitan Area Networks. It
is one of the solutions for 4G IP based wireless technology. WiMAX utilizes Orthogonal Frequency
Division Multiple Access which also supports Multicast and Broadcast Service with appropriate
Modulation and Coding Scheme. Presently, Scheduling and Resource allocation algorithm in Opportunistic
Layered Multicasting provides multicasting of layered video over mobile WiMAX to ensure better QoS.
Initially, the knowledge based allocation of subcarriers is used for scheduling. In addition, to reduce the
burst overhead, delay and jitter, SWIM (Swapping Min-Max) algorithm is utilized. Another promising
technology that can greatly improve the system performance by exploring the broadcasting nature of
wireless channels and the cooperation among multiple users is the Cooperative Multicast Scheduling
(CMS) technique. The simulation results show, Swapping Min-Max performs better with lesser number of
bursts, Zero jitter and with optimal throughput. The results with Cooperative Multicast Scheduling show
the enhanced throughput for each member in the Multicasting Scenario.
Active Network is a novel approach of networking to mobile users in which the nodes are programmed to perform custom operations on the messages that pass through the node. It provides an architectural support for dynamically deploying new protocols in an existing network topology. The routers in an active network can download and execute code that is contained in the packets passing through them, thus rendering the node recognized and run totally new protocols without making any changes to the architecture of the network. Because the network's behavior can be altered at any time, active networks could be used to provide dynamic quality of service (QoS) or to support dynamic solutions to traffic congestion. This research implements and tests such specialized Active Networks security service known as the firewall and the ping service in Active Network. Active Network environment will be implemented on a small scale test scenario in order to study the performance and characteristics of active networks
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Similar to DWDM-RAM: Enabling Grid Services with Dynamic Optical Networks (20)
A system for providing ultra low phase noise frequency synthesizers using Fractional-N PLL (Phase Lock Loop), Sampling Reference PLL and DDS (Direct Digital Synthesizer). Modern day advanced communication systems comprise frequency synthesizers that provide a frequency output signal to other parts of the transmitter and receiver so as to enable the system to operate at the set frequency band. The performance of the frequency synthesizer determines the performance of the communication link. Current days advanced communication systems comprises single loop Frequency synthesizers which are not completely able to provide lower phase deviations for errors (For 256 QAM the practical phase deviation for no errors is 0.4-0.5°) which would enable users to receive high data rate. This proposed system overcomes deficiencies of current generation state of the art communication systems by providing much lower level of phase deviation error which would result in much higher modulation schemes and high data rate.
A system for providing ultra low phase noise frequency synthesizers using Fractional-N PLL (Phase Lock Loop), Sampling Reference PLL and DDS (Direct Digital Synthesizer). Modern day advanced communication systems comprise frequency synthesizers that provide a frequency output signal to other parts of the transmitter and receiver so as to enable the system to operate at the set frequency band. The performance of the frequency synthesizer determines the performance of the communication link. Current days advanced communication systems comprises single loop Frequency synthesizers which are not completely able to provide lower phase deviations for errors (For 256 QAM the practical phase deviation for no errors is 0.4-0.5°) which would enable users to receive high data rate. This proposed system overcomes deficiencies of current generation state of the art communication systems by providing much lower level of phase deviation error which would result in much higher modulation schemes and high data rate.
Embodiments of the present invention present a method and apparatus for photonic line sharing for high-speed routers. Photonic switches receive high-speed optical data streams and produce the data streams to a router operating according to routing logic and produce optical data streams according to destination addresses stored in the data packets. Each photonic switch can be configured as one of a 1:N multiplexer or an M:N cross-connect switch. In one embodiment, optical data is converted to electrical data prior to routing, while an alternate embodiment routes only optical data. Another embodiment transfers large volumes of high-speed data through an optical bypass line in a circuit switched network to bypass the switch fabric thereby routing the data packets directly to the destination. An edge device selects one of the packet switched network or the circuit switched network. The bypass resources are released when the large volume of high-speed data is transferred.
Systems and methods to support sharing and exchanging in a networkTal Lavian Ph.D.
Embodiments of the invention provide for providing support for sharing and exchanging in a network. The system includes a memory coupled to a processor. The memory includes a database comprising information corresponding to first users and the second users. Each of the first users and the second users are facilitated for sharing or exchanging activity, service or product, based on one or more conditions corresponding thereto. Further, the memory includes one or more instructions executable by the processor to match each of the first users to at least one of the second users. Furthermore, the instructions may inform each of the first users about the match with the at least one of the second users when all the conditions are met by the at least one second user based on the information corresponding to each of the second users.
Systems and methods for visual presentation and selection of IVR menuTal Lavian Ph.D.
Embodiments of the invention provide a system for generating an Interactive Voice Response (IVR) database, the system comprising a processor and a memory coupled to the processor. The memory comprising a list of telephone numbers associated with one or more destinations implementing IVR menus, wherein the one or more destinations are grouped based on a plurality of categories of the IVR menus. Further the memory includes instructions executable by said processor for automatically communicating with the one of more destinations, and receiving at least one customization record from said at least one destination to store in the IVR database.
Various embodiments allow Grid applications to access resources shared in communication network domains. Grid Proxy Architecture for Network Resources (GPAN) bridges Grid services serving user applications and network services controlling network devices through proxy functions. At times, GPAN employs distributed network service peers (NSP) in network domains to discover, negotiate and allocate network resources for Grid applications. An elected master NSP is the unique Grid node that runs GPAN and represents the whole network to share network resources to Grids without Grid involvement of network devices. GPAN provides the Grid Proxy service (GPS) to interface with Grid services and applications, and the Grid Delegation service (GDS) to interface with network services to utilize network resources. In some cases, resource-based XML messaging can be employed for the GPAN proxy communication.
A system for providing ultra low phase noise frequency synthesizers using Fractional-N PLL (Phase Lock Loop), Sampling Reference PLL and DDS (Direct Digital Synthesizer). Modern day advanced communication systems comprise frequency synthesizers that provide a frequency output signal to other parts of the transmitter and receiver so as to enable the system to operate at the set frequency band. The performance of the frequency synthesizer determines the performance of the communication link. Current days advanced communication systems comprises single loop Frequency synthesizers which are not completely able to provide lower phase deviations for errors (For 256 QAM the practical phase deviation for no errors is 0.4-0.5°) which would enable users to receive high data rate. This proposed system overcomes deficiencies of current generation state of the art communication systems by providing much lower level of phase deviation error which would result in much higher modulation schemes and high data rate.
Systems and methods for electronic communicationsTal Lavian Ph.D.
Embodiments of the invention provide a system for enhancing user interaction with the Internet of Things. The system includes a processor, and a memory coupled to the processor. The memory includes a database having one or more options corresponding to each of the Internet of Things. The memory further includes instructions executable by the processor to share at least one of the one or more options with one or more users of the things. Further, the instructions receive information corresponding to selection of the at least one option by the one or more users. Additionally, the instructions update the database based on the selection of the at least one option by the one or more users. Further, a device for enhancing interaction with the things is also disclosed.
A system for providing ultra low phase noise frequency synthesizers using Fractional-N PLL (Phase Lock Loop), Sampling Reference PLL and DDS (Direct Digital Synthesizer). Modern day advanced communication systems comprise frequency synthesizers that provide a frequency output signal to other parts of the transmitter and receiver so as to enable the system to operate at the set frequency band. The performance of the frequency synthesizer determines the performance of the communication link. Current days advanced communication systems comprises single loop Frequency synthesizers which are not completely able to provide lower phase deviations for errors (For 256 QAM the practical phase deviation for no errors is 0.4-0.5°) which would enable users to receive high data rate. This proposed system overcomes deficiencies of current generation state of the art communication systems by providing much lower level of phase deviation error which would result in much higher modulation schemes and high data rate.
A system for providing ultra low phase noise frequency synthesizers using Fractional-N PLL (Phase Lock Loop), Sampling Reference PLL and DDS (Direct Digital Synthesizer). Modern day advanced communication systems comprise frequency synthesizers that provide a frequency output signal to other parts of the transmitter and receiver so as to enable the system to operate at the set frequency band. The performance of the frequency synthesizer determines the performance of the communication link. Current days advanced communication systems comprises single loop Frequency synthesizers which are not completely able to provide lower phase deviations for errors (For 256 QAM the practical phase deviation for no errors is 0.4-0.5°) which would enable users to receive high data rate. This proposed system overcomes deficiencies of current generation state of the art communication systems by providing much lower level of phase deviation error which would result in much higher modulation schemes and high data rate.
Radar target detection system for autonomous vehicles with ultra-low phase no...Tal Lavian Ph.D.
An object detection system for autonomous vehicle, comprising a radar unit and at least one ultra-low phase noise frequency synthesizer, is provided. The radar unit configured for detecting the presence and characteristics of one or more objects in various directions. The radar unit may include a transmitter for transmitting at least one radio signal; and a receiver for receiving the at least one radio signal returned from the one or more objects. The ultra-low phase noise frequency synthesizer may utilize Clocking device, Sampling Reference PLL, at least one fixed frequency divider, DDS and main PLL to reduce phase noise from the returned radio signal. This proposed system overcomes deficiencies of current generation state of the art Radar Systems by providing much lower level of phase noise which would result in improved performance of the radar system in terms of target detection, characterization etc. Further, a method for autonomous vehicle is also disclosed.
Various embodiments allow Grid applications to access resources shared in communication network domains. Grid Proxy Architecture for Network Resources (GPAN) bridges Grid services serving user applications and network services controlling network devices through proxy functions. At times, GPAN employs distributed network service peers (NSP) in network domains to discover, negotiate and allocate network resources for Grid applications. An elected master NSP is the unique Grid node that runs GPAN and represents the whole network to share network resources to Grids without Grid involvement of network devices. GPAN provides the Grid Proxy service (GPS) to interface with Grid services and applications, and the Grid Delegation service (GDS) to interface with network services to utilize network resources. In some cases, resource-based XML messaging can be employed for the GPAN proxy communication.
Method and apparatus for scheduling resources on a switched underlay networkTal Lavian Ph.D.
A method and apparatus for resource scheduling on a switched underlay network (18) enables coordination, scheduling, and scheduling optimization to take place taking into account the availability of the data and the network resources comprising the switched underlay network (18). Requested transfers may be fulfilled by assessing the requested transfer parameters, the availability of the network resources required to fulfill the request, the availability of the data to be transferred, the availability of sufficient storage resources to receive the data, and other potentially conflicting requested transfers. In one embodiment, the requests are under-constrained to enable transfer scheduling optimization to occur. The under-constrained nature of the requests enable transfer scheduling optimization to occur. The under-constrained nature of the requests enables requests to be scheduled taking into account factors such as transfer priority, transfer duration, the amount of time it has been since the transfer request was submitted, and many other factors.
Dynamic assignment of traffic classes to a priority queue in a packet forward...Tal Lavian Ph.D.
An apparatus and method for dynamic assignment of classes of traffic to a priority queue. Bandwidth consumption by one or more types of packet traffic received in the packet forwarding device is monitored to determine whether the bandwidth consumption exceeds a threshold. If the bandwidth consumption exceeds the threshold, assignment of at least one type of packet traffic of the one or more types of packet traffic is changed from a queue having a first priority to a queue having a second priority.
Method and apparatus for using a command design pattern to access and configu...Tal Lavian Ph.D.
An XML accessible network device is capable of performing functions in response to an XML encoded request transmitted over a network. It includes a network data transfer service, coupled to a network, that is capable of receiving XML encoded requests from a client also connected to the network. A service engine is capable of understanding and parsing the XML encoded requests according to a corresponding DTD. The service engine further instantiates a service using parameters provided in the XML encoded request and launches the service for execution on the network device in accordance with a command design parameter. A set of device APIs interacts with hardware and software on the network device for executing the requested service on the network device. If necessary, a response is further collected from the device and provided to the client in a response message.
Embodiments of the invention provide means to the users of the system to provide ratings and corresponding feedback for enhancing the genuineness in the ratings. The system includes a memory coupled to a processor. The memory includes one or more instructions executable by the processor to enable the users of the system to rate each other based on at least one of sharing, exchanging, and selling one of activity, service or product. The system may provide a mechanism to encourage genuineness in ratings provided by the users. Furthermore, the instructions facilitate the rating receivers to provide feedbacks corresponding to the received ratings. The feedback includes accepting or objecting to a particular rating. Moreover, the memory includes instructions executable by the processor to enable the system to determine genuineness of an objection raised by a rating receiver.
Embodiments of the present invention provide a system for enhancing reliability in computation of ratings provided by a user over a social network. The system comprises of a processor and a memory coupled to the processor. The memory further comprises a rater score database, a satisfaction database, a social network registration database, a user profile database, and a plurality of instruction executable by the processor. Said instructions in the memory are enabled to accept a message from at least one user wherein said message comprises a satisfaction score associated with at least one service provider and to retrieve a rater score associated with said at least one user from said rater score database. Further, the memory includes instructions in order to compute a new satisfaction score based on said rater score and said satisfaction score and update said satisfaction database to include said new satisfaction score. In a similar manner, the new satisfaction score can be computed based upon the information stored in the social network registration database and user profile database.
Systems and methods for visual presentation and selection of ivr menuTal Lavian Ph.D.
Embodiments of the invention provide a system for generating an Interactive Voice Response (IVR) database, the system comprising a processor and a memory coupled to the processor. The memory comprising a list of telephone numbers associated with one or more destinations implementing IVR menus, wherein the one or more destinations are grouped based on a plurality of categories of the IVR menus. Further the memory includes instructions executable by said processor for automatically communicating with the one of more destinations, and receiving at least one customization record from said at least one destination to store in the IVR database.
A system for providing ultra low phase noise frequency synthesizers using Fractional-N PLL (Phase Lock Loop), Sampling Reference PLL and DDS (Direct Digital Synthesizer). Modern day advanced communication systems comprise frequency synthesizers that provide a frequency output signal to other parts of the transmitter and receiver so as to enable the system to operate at the set frequency band. The performance of the frequency synthesizer determines the performance of the communication link. Current days advanced communication systems comprises single loop Frequency synthesizers which are not completely able to provide lower phase deviations for errors (For 256 QAM the practical phase deviation for no errors is 0.4-0.5°) which would enable users to receive high data rate. This proposed system overcomes deficiencies of current generation state of the art communication systems by providing much lower level of phase deviation error which would result in much higher modulation schemes and high data rate.
A system for providing ultra low phase noise frequency synthesizers using Fractional-N PLL (Phase Lock Loop), Sampling Reference PLL and DDS (Direct Digital Synthesizer). Modern day advanced communication systems comprise frequency synthesizers that provide a frequency output signal to other parts of the transmitter and receiver so as to enable the system to operate at the set frequency band. The performance of the frequency synthesizer determines the performance of the communication link. Current days advanced communication systems comprises single loop Frequency synthesizers which are not completely able to provide lower phase deviations for errors (For 256 QAM the practical phase deviation for no errors is 0.4-0.5°) which would enable users to receive high data rate. This proposed system overcomes deficiencies of current generation state of the art communication systems by providing much lower level of phase deviation error which would result in much higher modulation schemes and high data rate.
DWDM-RAM: Enabling Grid Services with Dynamic Optical Networks
1. 2004 IEEE International Symposium on Cluster Computing and the Grid
DWDM-RAM: Enabling Grid Services with Dynamic Optical Networks
S. Figueira', S. Naiksata", H. Cohen', D. Cutrell', P. Daspit', D. Gutierrez3, D. B. Hoang4,
T. Lavian', J. Mambretd, S. Merrill', F. Travostino'.
'Santa Clara University, 'Nortel Networks Labs,' 'Stanford University,
University of Technology, Sydney, 'iCAIR and Northwestern University.
{sfgueira, snaiksatam] @scu.edu, {hcohen, dcutrell, pduspit, tlavian, smerrill,
tra vos) @ Tiortelnetworks. com, degm @ stanford. edu, dhoang @ it. uts. edu. au,
j-mambretti@northwestt?m.edu.
4
Abstract
Advances in Grid technology enable the deployment
of data-intensive distributed applications, which
require moving Terabytes or even Petabytes of data
between data banks. The current underlying
nehvorks cannut provide dedicated links with
adequate end-to-end sustained bandwidth to support
ihe requirements of these Grid applications. DWDM-RAM'
is a novel service-oriented architecture, which
harnesses the enormous bandwidth potential of
optical nefivorks and demonstrates their on-demand
nsage on the OMNlner. Preliminary experiments
suggest that dynamic optical networks, such as the
OMNlnet, are the ideal option for transferring such
massive amounts of data. DWDM-RAM incorporates
an OGSI/OGSA compliant service interface and will
promote greater convergence between dynamic
optical networks and data intensive Grid computing.
1. Introduction
DWDM-RAM is a DARPA [IO] funded research
experiment established to design and implement in
prototype a new type of Grid service architecture that
is optimized to support data intensive Grid
applications through advanced optical networking.
DWDM-RAM closely integrates Grid data services
and optical networking services.
One of the goals of Grid architecture development
is to enable efficient support for data-intensive
applications, which may require moving - without
prior notice - Terabytes or even Petabytes of data
' DWDM-RAM research was made possible with suppon from
DARPA. award NO. ~3116nz-98.z-11194.
0-7803-8430-W04/$20.000 2004 IEEE
among multiple sites. One of the harriers to achieve
this goal is the fact that traditional technology used in
currently deployed networks limits at many levels the
transfer of massive amounts of data. Although
availability of sufficient bandwidth is an issue, access
to resources that provides this bandwidth solves only
one part of the problem. The complete solution is a
new network architecture with the ability to
orchestrate data flows with many different types of
characteristics, including those requiring
exceptionally high bandwidth for sustained periods
of time. In the DWDM-RAM model, these high
performance data flows are provided by dedicated
optical paths, which are dynamically allocated. State
of the art DWDM technology based on dynamic
wavelength switching enables the creation of Grid
services that allocate and release these paths either
on-demand or by advance reservation.
Grid applications typically need to allocate and
reserve multiple types of resources, such as
computational. data, instrumentation, and networks,
at distributed sites. Services such as the Globus
Resource Allocation Manager (GRAM) job scheduler
[8] have been developed to coordinate and schedule
the computational and data resources needed by Grid
applications. In [U] ,th e authors propose G A M , the
General Purpose Architecture for Reservation and
Allocation, which enables the construction of
application-level co-reservation and co-allocation
libraries that applications can use to dynamically
schedule collections of resources. In GAM, the
network is treated as a primary resource, which can
be allocated and reserved as well, and a service
provides this resource.
To enable the efficient use of optical networks as
a primary resource, a novel architecture for the
reservation and dynamic allocation of individual
707
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.
2. 2004 IEEE International Symposium on Cluster Computing and the Grid
wavelengths is required. This architecture relies on a
new network service, which provides options for
allocating dedicated network resources. This service
must discover the nctwork topology and both explore
the availability and optimize the schedule of the
optical network resources. It should also present a
standardized, high-level and network-accessible
interface. A natursl choice for implementing this
interface is the Open Grid Service Interface (OGSI)
[27]. Such interfaces are compliant with the GGFs
OGSA specification [I31 and, in addition, conform to
widely used Web Services standards (WSDL, SOAP,
and XML).
In addition to presenting an OGSI-compliant
interface, the network service should have a standard
way of representing wavelength resources for
communicating with clients. No such standard
currently exists, For the Grid community, a
promising approach would he to extend the XML
form of the Resource Specification Language (RSL)
[16]. This RSL schema is currently used by GRAM
for other resources. Adding optical network
extensions to RSL would make it possible to enhance
GRAM to handle optical network resources.
This paper presents an implementation of the
aforementioned concepts as a part of the DWDM-RAM
research project. This project encompasses the
development of two services, the Data Transfer
Scheduling (DTS) service and the Network Resource
Scheduling (NRS) service. The DTS service's goal is
to provide scheduled data transfer between data
banks. The NRS service's goal is to provide dynamic
dedicated wavelength, both on demand and by
advance reservation. The DTS uses the NRS service
to provide the user application with an optimized
utilization of the optical network. A preliminary
implementation of this architecture was first
demonstrated during the 9' Global Grid Forum, in
Chicago, October 2003 and then at the
Supercomputing Conference, in Phoenix, November
2003. Other results of experiments with dynamic
wavelength on advanced optical networks
provisioning for data-intensive Grid applications
have been recently published [22].
This paper is organized as follows: Section 2
describes dynamic optical networks and their
features, Section 3 introduces the DWDM-RAM
architecture, Section 4 presents the interface created
to allocate wavelengths dynamically, Section 5
describes the testhed used in the implementation and
presents initial results, and Section 6 concludes and
discusses future work.
2. Optical Networks
Bulk data transfer oriented grid computing requires
quality of service, in particular, guaranteed minimum
bandwidth and minimized packet loss, which are not
easily achievable in packet switching networks.
Recently, Grid developers have been using IntServ
[6] and DiffServ [4] approaches to obtain QoS in
packet switching networks ([I 11[121[151[211[251).
IntServ and DiffServ may help in some special cases,
but they arc far from perfect solutions. Optical
networks have the potential to change the way
networks are used in Grid computing. Optical
networks based on wavelength switching can easily
provide guaranteed bandwidth and performance in
terms of low hit error rates. In fact, based on the
same assumption, other groups have also been
focusing on providing optical networks to the Grid
community [26][29].
A main concern about wavelength switched
optical networks is the overhead incurred during the
end-to-end path setup. However, it should he noted
that the time taken in the transfer of the huge
amounts of data generated by Grid applicarions
amortizes the time spent in the setup. The graph in
Figure 1 illustrates this fact. It shows the amount of
time spent in the path setup as a percentage of the
total transfer time versus data transfers of different
sizes. These numbers were generated synthetically in
order to motivate the usage of optical networks in
different scenarios. We indicate in the graph the
threshold at which the setup time is about 5% of the
total time, i.e., the overhead is amortized and
becomes insignificant.
100%
80%
t 40% 500GB
30%
2 20%
2 10%
0%
1w ,ow 10000 100000 l O w w 0 lWoOW0
File Size (ME)
Figure 1: Overhead is insignificant at 500 GB
In Figure I , we assume a setup time of 48 sec and
a bandwidth of 920 Mhps, in which case the
threshold is 500 GB. Since Grid applications usually
708
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.
3. 2004 IEEE International Symposium on Cluster Computing and the Grid
transfer huge data sets, it is clear that the time for the
path setup is negligible in Grid computing.
Note that 48 sec is the currently observed average
upper-bound time for the path setup, and 920 Mbps is
the currently observed maximum throughput (see
Section 5). Of equal importance is the time required
to deallocate resources to enable subsequent usage,
once the data transfer is complete. This has been
observed to be around llsec (see Section 5) and is
also insignificant in comparison to the data transfer
time.
3. The DWDM-RAM Architecture
The DWDM-RAM architecture shown in Figure 2
closely fits the Grid Architecture described in [14].
This architecture also leverages the Globus Toolkit
3’s functionality. The main modules are explained
below.
Fabric: OMNInet and ODIN
The OMNInet photonic testhed network [3]
implemented across a metro area constitutes the
shared resource in the DWDM-RAM architecture.
Optical Dynamic Intelligent Network* (ODIN)
1.17][18][22] is the software suite that controls the
OMNInet through various lower-level API calls
presented in Section 5. ODIN has been designed for
extremely high performance, long term Terabit data
Ilows with flexible and fine grained control. It is a
stateless server implementation, which includes a
simple API to provide path provisioning and
monitoring to the higher layers.
Connectivity: TCP/IP, HTTP, SOAP, JAX-RPC
Currently, the DWDM-RAM system uses standard
off-the-shelf communication protocol suites to
communicate requests and responses between
application clients and DWDM-RAM services and
also among DWDM-RAM components. Requests
and responses conform to OGSI and Web Services
specifications, i.e., they are SOAP messages, carried
in HTTP envelopes and transported over TCPflP
connections. The SOAP messages are encoded using
IAX-RPC to facilitate interoperability between
existing Java-based Globus toolkit and the DWDM-RAM
components.
Figure 2: The DWDM-RAM architecture
Resource: DWDM-RAM Network Resource
Scheduling (NRS) Service
The Resource and Connectivity protocol layers form
the neck of our “hourglass model” [23] based
architecture. The NRS is essentially a resource
management service, which supports protocols that
offer advance reservations and QoS. It maintains
schedules and provisions resources in accordance
with the schedule. It provides an OGSMOGSI
compliant interface to request the optical network
resources. It has complete understanding of dynamic
lightpath provisioning and communicates these
requests to the Fabric layer entities. In our
architecture, the NRS can stand alone without the
DTS (see Collective layer). GARA integration is an
important avenue for future development. A key
feature is the ability to reschedule reservations,
which satisfy under-constrained scheduling requests,
in order to accommodate new requests and changes
in resource availability. Requests may be under-constrained
through specification of a target
reservation window, which is larger than the
requested duration, through open-ended
specifications, such as “ASAP”, or through more
sophisticated request specifications, such as client-provided
utility functions for evaluating scheduling
’ODIN research was made passible with suppan from the National
Science Foundation: awwd - ANI-0123399
709
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.
4. 2004 IEEE International Symposium on Cluster Computing and the Grid
costs. Models for priorities and accounting can also
be incorporated into the scheduling algorithms.
Collective: DWDM-RAM Data Transfer
Scheduling (DTS) Service
The DTS service is a direct extension of the NRS
service. The DTS shares the same hackend
scheduling engine and resides on the same host. It
provides a higher-level functionality that allows
applications to schedule advance reservations for
data transfers without the need to directly schedule
path reservations with the NRS service. The DTS
service requires additional infrastructure in the form
of services living at the data transfer endpoints.
These services perform the actual data transfer
operations once the network resources are allocated.
As with the NRS, the DTS has an OGSI interface,
and GARA integration is a planned avenue for future
development. As an extension of the NRS, the DTS
also employs under-constrained scheduling requests
in order to accommodate new requests and changes
in resource availability.
It is important to note that, in the DWDM-RAM
design, the application at the endpoints drives the
statc and decisions by DTS, NRS, and ODIN, thus in
full compliance with the end-to-end argument [24].
These intervening layers never attempt to re-construct
nor second-guess an application's intent
from traffic. Instead, they follow the explicit
command and control from the application. These
layers are best positioned to appreciate both
application's commands and network status, while
bridging meaningfully between the two.
Also, we plan to have DWDM-RAM comply with
the so-called fate-sharing principle [7].T his design
principle argues that it is acceptable to lose the state
information associated with an entity if, at the same
time, the entity itself is lost. In this case, DTS, NRS,
and ODD4 will make a point of reclaiming resources
once an application is terminated, or is found to he
non-responsive for a configurable time interval.
4. Dynamically Allocating Bandwidth
On-Demand
For wavelength switching to be useful for Grid
applications, a network service with an application
level interface is required to request, release and
manage the underlying network resources. Previous
work has been done in defining an OGSNOGSI
based network service interface to network resources.
In 1121, for example, the authors describe a service
that provides allocation of bandwidth in IntServ
networks. Our approach follows their model but
develops a more comprehensive schedule and
reservation based Network Resource Scheduling
(NRS) service, which provides user applications with
access to underlying optical network resources. This
service should guarantee dedicated access to the
optical links, which may be requested on-demand or
by advance reservation. Advance reservation requests
can he under-constrained, which means the request
can be satisfied by more than one possible time slot.
This allows the service to reschedule reservations as
needed to satisfy future requests and changing
conditions.
The NRS also attempts to provide an interface
with different levels of detail. Some coordinating and
scheduling clients may need only high-level facilities
like those for individual applications. For these
applications, the interface should allow the request of
light paths, hut these clients do not need to have
knowledge of the details of the underlying network
topology or management protocols. However, clients
that attempt to optimize network resources use may
need a richer interface, e.g., they may need to be able
to schedule individual optical segments. For these
clients, the interface should allow the request of
individual segments. Although these clients may
need knowledge of the network topology, they
should still be insulated from the network
management protocols.
We have started by implementing a network
service with a simple application-level interface. This
service is able to allocate dynamically dedicated end-to-
end light paths requested on demand. The
following were the goals for this initial interface:
It should be usable by Grid applications.
It should be network-accessible from any
authorized host.
It should be standards-based and not require any
proprietary technology.
It should allow the application to specify
parameters of the desired optical path that are
relevant at the application level.
It should hide the details of the underlying
network topology and network management
protocols.
It should support the immediate allocation of
bandwidth, but should be easy to extend in order
to incorporate future scheduling.
At the highest level, the interface described here is
wrapped in a Java implementation that shields the
caller from the details of the application-level
protocols, which are needed to communicate with the
710
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.
5. 2004 IEEE International Symposium on Cluster Computing and the Grid
service. The service itself hides various lower level
network topology and management protocols from
the caller.
This current interface exposes two methods to the
user: allocateNetworkPath and
deallocateNetworkPath. The method
allocateNetworkPath requests a path between
the end hosts. The path allocated should meet the
criteria specified in the parameter object passed to the
method. These parameters include the network
addresses of the hosts to he connected, the minimum
and maximum acceptable bandwidths, and the
maximum duration of the allocation. The
allocateNetworkPath method returns to the
caller an object containing descriptive information on
the path that was allocated. This object also serves as
a handle for the deallocateNetworkPath
rcquest. By adding parameters representing earliest
and latest acccptable start times, this interface can he
extended to accommodate under-constrained advance
reservations.
The NRS interface suggests likely properties for a
service that may implement this interface. Such a
service can he implemented in a way that does not
maintain any session or context information for any
particular client between calls. The only necessary
context information is the allocated path identifier,
which the client is required to supply in order to
deallocate a path. The service must maintain this
information ahout these allocated paths so, in this
sense, it is not “stateless,” but each client call can he
treated as a self-contained unit and processed entirely
in a single-message exchange. Thus, the interface
tits the service oriented architecture of Web Services
[5] quite closely.
At the same time, we believe that it is important to
conForm to the emerging Open Grid Services
Architecture (OGSA) Grid standard to be accessible
to Grid applications that use this architecture. Hence
the NRS interface also conforms to the Open Grid
Services Infrastructure (OGSI) interface for services.
This interface, in its basic form, is a Web Service
interface with some additional conventions from the
OGSI standard. Although client access is via a
normal Java interface as described above. internally,
the client-service interface is an OGSI Web Service
implemented using SOAP and the JAX-RPC API.
The OGSI implementation is quite lean (no SDEs),
and therefore the conversion to new specifications
like the WS-Resource Framework (WS-RF) [301 will
be a somewhat mechanical process. In fact, the
DWDM-RAM architecture builds the concept of a
Network Service from the ground up and is fairly
well insulated from either OGSI, or WS-RF, or any
other emerging specification that may prevail. In any
case, the user of the NRS service is spared any direct
contact with the underlying middleware.
5. Testbed, Experiments and Result
The testbed for the DWDM-RAM system is provided
by a next-generation large-scale MetroLAN dynamic
optical network extent called the OMNInet [3],
operational since 2001. OMNInet uses metro dark
fiber infrastructure, which has been provided by SBC
to connect locations sponsored by Northwestern
University, and a mix of product and rcsearch
equipmcnt from Nortel Networks. OMNInet has been
deployed at four locations in the Chicago metro area
and is configured in a partial-mesh IOGE DWDM
network. Each location has a MEMS based 8 x 8
DWDM photonic switch interfaced with a Nortel
Passport 8600 Ethernet Routing Switch, providing 4
x lOGE line interfaces and up to 32 x IGE client
interfaces. The OMNInet configuration is shown in
Figure 3.
Univ oflllinois, Chiraxo Northwestern Unir
uu
Figure 3 OMNlnet core nodes
The dynamic light path provisioning of the
OMNlnet is provided by the Optical Dynamic
Intelligent Network (ODIN) services module, which
manages the optical network control plane and
resource provisioning including path allocation,
deletion, and setting of attributes. ODIN uses an O F
UNI 1.0 [28] compliant UN1 library to interface with
the OMNInet unified control plane. The control plane
is orchestrated by a GMPLS [20] based CR-LDP [ I ]
implementation, which is used to establish the label
forwarding state along the routes computed by an
enhanced OSPF (constraint-based routing)
71 1
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.
6. 2004 IEEE International Symposium on Cluster Computing and the Grid
algorithm5. (Note: An RSVP-TE [2] implementation
to support advance reservations is also in the process
of being deployed.) The technological breakthrough
in the design of the OMNInet photonic switches,
coupled with the tight integration of the control
software, brings down the provisioning time from
months to a few seconds. This is the critical enabling
factor in on-demand provisioning, which makes
dynamic optical networks an important technology
for data-intensive Grid computing.
Figure 4 compares the efficiency of packet
switching with lambda switching, executing with
different amounts of bandwidth, by plotting the
amount of data transferred against the time taken in
seconds. This graph was generated synthetically. The
path setup takes 48 sec which was recorded in
experiments (explained in detail later). The path
setup time includes the time required to request a
path, allocate the path, configure the layer I and 2
components of the network and update the relevant
tables. It is important to note that only a miniscule
fraction (approximately 20 milliseconds) of this delay
is actually due to the setting up of the path within the
optical switch. A part of the setup delay is also due to
the propagation of state information through the
photonic nodes and optical paths. The major portion
of the delay is introduced by switches at the edge of
the optical network, which switch the data to and
from the end hosts. This is an artifact of the current
network setup, and with fairly simple optimizations,
we expect to bring this 48 sec delay down
significantly.
amshed
ISW M W 1 GbW
5000
45W -PlhkBI
mdtcned
4oW 1% M W
--Lamu
I1oGbpSl
e g -
35W 3oW
$ =W
Imched
I750 Mbw)
rwhed (l
moo
15W
1000
5w
0
0 20 40 60 80 1W 120
rim (S)
Figure 4: Packed Switched.vs. Lambda Network --
Setup time tradeoffs.
For the OMNlnet metro photonic networking research, the
GMPLS. 0-UNI. LMP smdards we implemented as Nortel
Networks proprietary Wavelength Routing and Distribution
Protocol (WRDP) optical control plane software suite.
The important information obtained by this graph
is the crossover points at which the optical network
becomes a better option than the packet switched
network. Note that when the path setup takes 48 sec,
the crossover point can he with files as small as 1.9
GB and up to 4.5 GB. The graph affirms the
enormous advantage of the DWDM-RAM system
over other packet switching systems when
transferring large data sets and presents an exciting
option for the Grid community.
Note that, for transferring smaller amounts of
data, the packet switching traditional approach may
be a better option. The appropriate network to use, in
each case, should bc decided by co-allocation
services, as defined in [9][ 121. These co-allocation
scheduling services use information about the
resource's capabilities and the application's
requirements to allocate a performance-efticient set
of resources for the application.
Figure S presents a throughput graph for a 30 GB
memory-to-memory transfer. The smooth curve is the
average effective data-transfer rate, including the
startup cost of allocating the lightpath. The jagged
curve, averaging around 440 Mbps, is the
instantaneous throughput, measured in 0.1 sec
intervals on the receiving machine. Note that the
throughput periodically jumped to about 530 Mhps
for a sustained period of about 100 seconds, a
phenomenon under investigation. For this 30 GB data
transfer, we can see that the startup costs begin to be
amortized after about 230 sec or 12.2 GB.
. . . . ... .
. ' . . .
Figure 5: Instantaneous and average throughput for a
30 GB memoly-to-memory transfer over OMNlnet
using TCP as transport protocol.
The above experiment was run on dual PIII
997MHz machines with S12MB memory, 1GB swap
space, running on Red Hat Linux 7.3 (Kernel: 2.4.18-
3") and using I GigE NIC cards. Note that we
used the Linux networking protocol stack with no
performance tuning.
71 2
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.
7. PO04 IEEE International Symposium on Cluster Computing and the Grid
of the channel. Currently, the default UDT protocol
values are being used, namely, UDT buffer size of
40,960,000 bytes, UDP send buffer of 64KB. UDP
receive buffer of 4 MB, and flow window size of
25600. We believe that tuning these parameters to the
OMNInet testhed will yield a higher throughput.
Table 1: Auplication level measurements recorded for
..
a 20GB file transfer I Event I Seconds
Start : File transfer request arrives 1 0.0
Path Allocation request I 0.5
ODIN server processing
When performing file transfer in the above setup
we observed large oscillations in the instantaneous
throughput, which resulted in significantly lower
average throughput. We suspected that this was an
artifact of using standard TCP. This prompted us to
experiment using UDT [ 191, a high performance data
transfer protocol. Figure 6 shows a 15 GB memory-to-
memory data transfer using UDT as the underlying
transport protocol. The throughput has been sampled
at 0.1 sec intervals. The maximum and the average
throughput recorded were 920 Mhps and-680 Mbps,
respectively.
2.6
Network reconfiguration
Data transfer
Path deallocation request
45
622
0.3
T-1-1 r&ource accessed through a Grid service, which is
necessary for data-intensive applications. The
Figure 6: Instantaneous throughput recorded for a 15 DWDM-RAM system presented here addresses
GB memory-to-memory transfer over OMNlnet using limitations of traditional implementations and
UDT a s transport protocol. facilitates on demand optical channel (lightpath)
The numbers in Figure 6 show a better
performance than those in Figure 5, reinforcing our
initial suspicion that TCP was affecting the
throughput. We also performed file transfer
experiments using UDT. For a 20 GB tile transfer,
the maximum and the average throughput recorded
were 376 Mbps and 272 Mbps respectively. These
are significantly lower than those seen in Figure 6,
leading us to believe that issues like disk YO on both
ends of the data pipe, buffering, and similar factors
impact the average throughput in the disk-to-disk file
transfers.
Table 1 shows a breakup of the total end-to-end
time required for the above file transfer operation to
complete. It is important to note that the lightpath
used to transfer data in the experiment described was
dynamically allocated and dedicated to the file
transfer.
While UDT does seem to have had a favorable
impact on the average throughput, it is evident from
the graph of Figure 6, that there are still oscillations
in the instantaneous throughput. Also, the average
throughput is less than the maximum 1 Gbps capacity
- .
provisioning. We have also presented an
OGSAJOGSI compliant interface developed to ease
the usage of the OMNInet by Grid applications.
The interface presented meets the needs of many
applications, hut it should be extended to include
features that may be necessary or desirable in other
circumstances. One of our main goals is to make the
interface G A M compliant and able to provide a
comprehensive, re-schedulable and window-based,
network service as discussed in Section 3.
We are currently exploring UDT and other high
performance transport protocols which can help to
achieve a uniform throughput close to the maximum
limits. This, coupled with the facility to aggregate
several channels to transfer one large tile, will
dramatically impact the data transfer time perceived
by the user.
While a photonic switched network like OMNInet
may be ideal for a DWDM-RAM-like architecture,
our experiments suggest that DWDM-RAM could
also he implemented on a traditional optical-electrical-
optical (OEO) network. Providing a solid
interface to such optical networks is a key step in
enabling its usage by the Grid community. Our initial
71 3
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.
8. 2004 IEEE International Symposium on Cluster Computing and the Grid
experiments have been extremely promising, and we Integration,” Open Grid Service Infrastructure WG,
are continuing to improve the network service
Acknowledgements
The authors would like to thank Aaron Johnson, Fei
Yeh, Jeremy Weinberger, Jim Chen, and David
Lilithun from ICAIR, and Ramesh Durairaj, Inder
Monga, and Phil Wang from Nortel Networks, for
their invaluable contributions.
References
[I] P. Ashwood-Smith (Ed) and L. Berger (Ed),
“Generalized Multi-Protocol Label Switching
(GMPLS) Signaling Constraint-based Label
Distribution Protocol (CR-LDP) Extensions,” RFC
3472, January 2003.
121 D. Awduche et al., “RSVP-TE: Extensions to RSVP
for LSP Tunnels,” RFC 3209, December 2001.
[3] E. Bernier et al., “OMNlnet: A Metropolitan 10Gh/s
DWDM Photonic Switched Network Trial.”
Submitted for OFC 2004, Feb 22 - 27, 2004. (In
YPYi_PW..),
[4] S. Blake et al., “An Architecture for Differentiated
Services,’’ IETF RFC 2475.
[SI D. Booth, et al., “Web Services Architecture,”
http://www.w3.org/TR/2003/WBws-arch-
20030808/wsa.pdf
[61 R. Braden et al., RFC 1633: Integrated Services in the
Internet Architecture: an Overview, Inremet RFC
1633, July 1994.
[7] D. Clark, ‘The design philosophy of the DARPA
Internet protocols,” in Proceedings of ACM
SICCOMM, Stanford. CA, pp. 106--114, August
1988.
[XI K. Czajkowski et al., “A Resource Management
Architecture for Metacomputing Systems,” in
Proceedings of IPPYSPDP ‘98 Workshop on Job
Scheduling Strategies for Purullel Processing, pp. 62-
82, 1998.
[9] K. Czajkowski et al., “Resource Co-Allocation in
Computational Grids,” Proceedings of the Eighrh
IEEE Internarional Symposium on High Per/ormunce
Distributed Computing (HPDC-8I, pp. 219-228, 1999.
[IO] Department of Defense Advanced Research Projects
Agency (http://www.darpa.miV)
[ I l l 1. Foster et al., “End-to-End Quality of Service for
High-end Applications,” Computer Communicurions,
Speciul Issue on Network Supporr for Grid
Computing, 2002.
[I21 1. Foster et al., “A Distributed Resource Management
Architecture that Supports Advance Reservations and
Co-Allocation,” Inremotional Workshop on Qualify of
Service, 1999.
[I31 1. Foster et al., ‘The Physiology of the Grid An Open
Grid Services Architecture for Distributed Systems
Global Grid Forum, June 2002.
[I41 1. Foster et al., ‘The Anatomy of the Grid Enabling
Scalable Virtual Organizations.” lnremationul Joumal
of Superrompurer Applications, 15(3), 2001.
[IS] 1. Foster et al., “A Quality of Service Architecture that
Combines Resource Reservation and Application
Adaptation,” 8th International Workshop on Qualiy
of Service, 2000.
[I61 “The Globus Resource Specification Language RSL
VI.O ,” http://www.globus.org/gram/rsI_specl .html.
[I71 R. Grossman et al., “Experimental Studies Using
Photonic Data Services at Grid 2002.” Joumal of
Future Computer Systems. Elsevier Press, pp.945-956,
August 2003.
[IS] R. Grossman et al., “Photonic Data Services:
Integrating Path, Network and Data Services to
Support Next Generation Data Mining Applications,”
NGDMM, Proceedings, November 2002.
[I91 Y. Gu and R. Grossman, “End-to-End Congestion
Control for High Performance Data Transfer.”
submitted to IEEWACM Transactions on Networking.
[ZO] L. Berger (Ed), “Generalized Multi-Protocol Label
Switching (GMPLS) Signaling Functional
Description.” RFC 3471, January 2003.
[211 G. Hoo et al., “QoS as Middleware: Bandwidth
Reservation System Design,’’ Proceedings of rhe 8th
IEEE Symposium on High Perfurmunce Distributed
Computing, pp. 345-346, 1999.
[22] I. Mambretti et al., “The Photonic TeraStream:
Enabling Next Generation Applications Through
Intelligent Optical Networking at Grid 2002,” Joumul
of Future Computer Systems, Elsevier Press. August
2003, pp.897-908.
[23] “Realizing the Information Future: The Internet and
Beyond,” National Academy Press, 1994,
http://www.nap.edu/readingroom/books/rti
[24] I. Saltzer et al., “End-to-end arguments in system
design,” ACM Transactions on Computer Systems, pp.
277-288, 1984.
[ZS] V. Sander et al.. “A Differentiated Services
Implementation for High-Performance TCP Flows,”
Elsevier Computer Networks, 34915-929.2000.
[26] L. Smarr et al., ‘The OptlPuter,” Communications of
the ACM, Vol. 46, No. 1 I, pp. 58-67, November 2003.
[271 S. Tuecke et al., “Open Grid Services Infrastructure
(OGSI) Version 1.0,” Global Grid Forum Draft
Recommendation, June 2003.
[28] “User Network Interface (UNI) 1.0 Signaling
Specification,” http://www.oiforum.com/public/docu
ments/O1F-UNI-01 .O.pdf
[29] D. Vanderster, ‘The Return of Circuit Switching: A
Review of User-Controlled Lightpaths for Grid
Computing,” Technical Report, University of
Victoria, Canada, August 2003.
[301 “WS-Resource Framework,” http://www-fp.
globus.org/wsrt/
71 4
Authorized licensed use limited to: Tal Lavian. Downloaded on July 24, 2009 at 19:10 from IEEE Xplore. Restrictions apply.