A Flexible Gateway Architecture Enabling Scalable Realization of UMTS Networks

The Network-on-Chip (NoC) is Network-version of System-on-Chip (SoC) means that on-chip communication through packet based networks. In NOC topology, routing algorithm and switching are main terminology. The routing algorithm is one of the key factors in NoC architecture. The routing algorithm which defines as the path taken by a packet between the source and the destination. The paper proposes a novel algorithm for a Network-on-Chip, which is based on packet switching. Using square mesh techniques used for 16 nodes based NoC design and simulation. The node is equal to row and column. Paper discusses internal architecture of NoC using addressable memory and simulate on XILINX 14.1 ISE MODELSIM. Keywords : Network-on-Chip, Static routing, Parallelism Cite this Article Anurag Shrivastava, Sudhir Kumar Sharma. A reliable routing architecture and algorithm for network-on-chip, Journal of Electronic Design and Technology . 2015; 6(3): 40–48p.

This paper introduces a new IEEE standard, IEEE 802.15.5,which provides mesh capability for wireless personal area network (WPAN) devices. The standard provides an architectural framework enabling WPAN devices to promote interoperable, stable, and scalable wireless mesh topologies. It is composed of two parts: low-rate WPAN mesh and high-rate WPAN mesh. In this paper, we present only low-rate WPAN mesh because it is designed to support wireless sensor networks. IEEE 802.15.5 low-rate part is a light-weight scalable mesh routing protocol that caters well to the requirements of resource-constrained wireless sensor networks. By binding logical addresses to the network topology, IEEE 802.15.5 obviates the need for route discovery. This eliminates the initial route discovery latency, saves storage space and reduces the communication overhead and energy consumption. A distributed link state scheme is further built atop the block addressing scheme to improve the quality of routes, robustness, and load balancing. The routing scheme scales well with regard to various performance metrics. The standard also provides enhanced functions such as multicast, reliable broadcast, power saving, time synchronization, route tracing and portability. We also present the performance evaluation of major functions performed with a 50-nodes tested deployed over a whole floor (100 × 140 ft2) at CUNY Engineering building. The results testify that the IEEE 802.15.5 will serve well for wireless personal area networks and wireless sensor networks.

A Wireless Sensor Network (WSN) normally consists of an exceptionally large number of inexpensive, disposable, robust, small, and low power sensor nodes operational considerately. A Distributed and Scalable Scheduling Access (DSSA) scheme that mitigates in wireless sensor networks handles some mobility with high data loss due to the faults. A virtual grid network in distributed and scalable scheduling access scheme is an effortless method to cluster local sensors but fails in network scalability improvement. Existing, Information Controlled Transmission Power (ICTP) alteration method uses higher transmission powers with additional information than individuals that are less instructive to distribute their object state information with the neighboring nodes. ICTP does not detect faults and outlier sensor nodes in the network and probable safety measures have to be taken against them. To overcome these faulty and energy saving issues, Collaborator Homed Routing (CHR) mechanism is developed in WSN. In CHR, cluster heads aggregate information and relay information to the base station independently for improving system’s transmission power with half amount of energy consuming. Non Cluster Head (NCH) nodes choose a restricted number of objects in the information transmission. Based on the CHR principles, designed and implemented a novel mechanism to handle faulty situations. Using CHR in WSN, cluster head faults are installed to observe the scalability of these mechanisms. Therefore CHR consumes less energy with minimal faults. Experimental results show that proposed routing considerably reduces energy consumption, fault free routing, and reduces the possibility of communication disturbance, network scalability, throughout and link failure ratio is compared to existing method

Interacting with the Web of Things

Author(s): Ioannou, Petros; Giuliano, Genevieve; Dessouky, Maged; Chen, Pengfei; Dexter, Sue | Abstract: The current freight transportation network is highly unbalanced as routing decisions are made by individual users without coordination. Certain routes may become congested when chosen based on current traffic information without any anticipation that if other users do the same, these routes are no longer the best. This project developed a centrally coordinated load balancing system that considers all user demands and generates individual routes that balance freight loads across the network by minimizing cost. It is initially assumed that all vehicles are diesel and then gradually increases zero emissions vehicles such as electric trucks for a mixed fleet of trucks. The electric trucks add additional constraints due to limitation of range and charging time of batteries. As the number of electric trucks increases, the emissions reduce as expected; however, the cost of charging does not make their use less operational costly than the corresponding diesel trucks. The experiments show that for electric trucks to compete with diesel, charging should occur when drivers are off duty or in idle mode since the cost of charging is mainly due to the labor cost of the waiting driver. Several simulation experiments show the benefits of deploying electric trucks in a freight fleet with respect to environment and operational cost, provided charging is scheduled appropriately. It is shown that the proposed centrally coordinated load balancing system can easily incorporate different concepts such as the empty container re-use where the exchange of containers between users can be optimized to reduce empty trips. In order to better understand the implementation issues of a load balancing system, the report also includes results from interviews of individuals responsible for trucking operations in the Los Angeles region. All interviewed trucking companies are either drayage operations (hauling freight to and from ports or intermodal facilities) or short-haul operators that move goods between manufacturers, distribution center, and retail facilities. The answer for load balancing system varies between interviewees and it is recommended to follow an iterative fashion by first targeting trucking companies who already work collaboratively in associations and vertical markets. These clusters of firms have built working relationships, engage in communication, and have trust between members.View the NCST Project Webpage

At first thought, one may not realize the need for a special issue of Parallel and Distributed Computing Practices focused on Cluster Computing when our community has already invested years of research and spent a wealth of resources on traditional Big Iron supercomputers, for instance, the SGI/Cray Origin and IBM SP. Academia, industry, and national laboratories are still using, and for the foreseeable future, will continue to use, supercomputers to solve both grand-challenge scale and high-throughput applications. Then why the interest and new popularity of research into clusters for high-performance parallel and distributed applications? Clusters incorporate the tremendous successes that are attributable to our parallel and distributed processing community. Over the next decade, clusters will span the entire range of high-performance computing platforms. Instead of being restricted solely to supercomputers for achieving high-performance computing, the spectrum of available platforms will spread out to Beowulf-class clusters, to superclusters, and on to supercomputers. Moving along this continuum represents increasing computational resources, which in turn allows the capability for solving larger classes of applications or instances of problems. Compute-bound applications on workstations often may take advantage of the extra horsepower provided by symmetric multiprocessors. Applications with even larger computational requirements and a high-degree of concurrency may use Beowulf clusters, that is, clusters that are home-built from mass-market, commercial off-the-shelf workstations and networks, for instance, PC's interconnected by Fast Ethernet. A supercluster may contain commodity SMP nodes interconnected with scalable, low-latency, high-bandwidth networks, and is integrated by a system vendor rather than the computational scientist. Applications with greater complexity, for example, grand challenges from the sciences, demand scalable systems with high-performance, interconnects, perhaps coupled with terascale I/O subsystems, and thus, are appropriate for these superclusters. Finally, supercomputers, the largest of the clusters, may provide the ultimate platform for the highest-fidelity models and simulations and data-intensive applications. At each step up this ladder of cluster architectures, the system cost increases approximately by an order of magnitude, but having the high-performance capability to solve the problem of interest may require an entry point at any of these levels, the Beowulf, or supercluster, or even supercomputer platform. Cluster computing with Beowulf- or superclusters, thus, may be one or two orders of magnitude less expensive than a supercomputer, and provide a cost-effective solution and capability that was not available on a workstation. But this cost comparison measures just the basic system price. What about the applications? As recently as a few years ago, the lack of a canonical high-performance architectural paradigm meant that migrating to a new computer system, even from the same vendor, typically required redesigning applications to efficiently use the high-performance system. Thus, the application must be redesigned with parallel algorithms and libraries that are optimized for each high-performance system. This process of porting, redesigning, optimizing, debugging, and analyzing, the application may in fact be prohibitively expensive, and certainly frustrating when the process is completed just in time to greet the next generation system! That was then, this is now. With the successful standardization of system-level interfaces, many of these issues no longer hinder our expedited use of these new, high-performance clusters. The message-passing interface (MPI) is a clear example of a standard that has contributed significantly to the success of cluster computing. Supercomputer vendors working together with the high-performance computing community embarked on a process to standardize the user-level interface and behavior for passing messages between concurrent tasks. Now, using ordinary sequential compilers and vendor-supplied or freely-available implementations of this message-passing interface, applications can be implemented efficiently on one supercomputer and ported with little or no effort to other parallel machines. The message-passing paradigm, thus, provides a reasonably good canonical high-performance model and methodology for implementing high-performance applications. An algorithm that exhibits efficient execution and scaling on one machine then is likely to perform well on another with little or no additional programming effort. Using this cluster computing paradigm, algorithms typically are optimized by minimizing the number of remote memory accesses (reducing the amount of messages passed), and carefully organizing the data placement to increase memory locality. Thus, high-performance algorithms and applications that have been optimized for supercomputers, using the same cluster paradigm, may be appropriate for Beowulf and superclusters. Cluster computing, realizing the importance of a standard high-performance programming environment that applies equally well to both ends of the architectural spectrum, highly leverages these and other successes from parallel and distributed processing research and development. This is in an exciting, new era for high-performance computing where the canonical architectural paradigm stretches from home-built Beowulf clusters, to superclusters, and on to supercomputers. But cluster computing faces some challenges ahead of it. Continued research is required for designing 1) scalable, high-performance algorithms, applications, and methodologies, that can tolerate the communication overheads, and adapt to hybrid, SMP, and heterogeneous, nodes; 2) high-performance computer architectures, scalable interconnection networks, and I/O subsystems; and 3) scalable systems software, compilers, and monitoring tools. Cluster computing has come of age, and it is high time for the parallel and distributed processing community to lay the groundwork for our own legacy of success stories. David A. Bader University of New Mexico

The differentiated services (DS) architecture provides a framework for the scalable provisioning of multiple service levels in the Internet. Its definition and initial work have concentrated mainly on per-hop behaviors (PHB) and mechanisms at each DS domain. Equally important is what happens between DS domains. Thanks to the flexibility of the architecture, it is the providers’ choice how to interconnect with peers. In principle, traditional, static peering agreements work together with DS, but they do not offer the flexibility and dynamics needed in an electronic market for network capacity. Therefore, we look at dynamic service level agreements at the interdomain level. Such agreements are established by software entities called traders. These traders follow market-based principles to decide which contracts will be beneficial. In particular, traders compare the offers made by neighbor providers and select the most interesting ones. This selection of peer services creates competition among providers and integrates route selection based on service level and destination. We describe and implement a framework for service level agreement trading. We show the basic workings and first performance results of SLA trading using specific traders and an experimentally defined PHB in a simulation environment. Keywords— Network architecture, differentiated services architecture, service level agreement, pricing, trading, interdomain QoS routing.

In this thesis, concepts for developing Spatial Data Infrastructures with an emphasis on visualizing 3D landscape and city models in distributed environments are discussed. Spatial Data Infrastructures are important for public authorities in order to perform tasks on a daily basis, and serve as research topic in geo-informatics. Joint initiatives at national and international level exist for harmonizing procedures and technologies. Interoperability is an important aspect in this context - as enabling technology for sharing, distributing, and connecting geospatial data and services. The Open Geospatial Consortium is the main driver for developing international standards in this sector and includes government agencies, universities and private companies in a consensus process. 
\n3D city models are becoming increasingly popular not only in desktop Virtual Reality applications but also for being used in professional purposes by public authorities. Spatial Data Infrastructures focus so far on the storage and exchange of 3D building and elevation data. For efficient streaming and visualization of spatial 3D data in distributed network environments such as the internet, concepts from the area of real time 3D Computer Graphics must be applied and combined with Geographic Information Systems (GIS). For example, scene graph data structures are commonly used for creating complex and dynamic 3D environments for computer games and Virtual Reality applications, but have not been introduced in GIS so far. 
\nIn this thesis, several aspects of how to create interoperable and service-based environments for 3D spatial data are addressed. These aspects are covered by publications in journals and conference proceedings. The introductory chapter provides a logic succession from geometrical operations for processing raw data, to data integration patterns, to system designs of single components, to service interface descriptions and workflows, and finally to an architecture of a complete distributed service network.
\nDigital Elevation Models are very important in 3D geo-visualization systems. Data structures, methods and processes are described for making them available in service based infrastructures. A specific mesh reduction method is used for generating lower levels of detail from very large point data sets. An integration technique is presented that allows the combination with 2D GIS data such as roads and land use areas. This approach allows using another optimization technique that greatly improves the usability for immersive 3D applications such as pedestrian navigation: flattening road and water surfaces. It is a geometric operation, which uses data structures and algorithms found in numerical simulation software implementing Finite Element Methods. 
\n3D Routing is presented as a typical application scenario for detailed 3D city models. Specific problems such as bridges, overpasses and multilevel networks are addressed and possible solutions described. The integration of routing capabilities in service infrastructures can be accomplished with standards of the Open Geospatial Consortium. An additional service is described for creating 3D networks and for generating 3D routes on the fly. Visualization of indoor routes requires different representation techniques.
\nAs server interface for providing access to all 3D data, the Web 3D Service has been used and further developed. Integrating and handling scene graph data is described in order to create rich virtual environments. Coordinate transformations of scene graphs are described in detail, which is an important aspect for ensuring interoperability between systems using different spatial reference systems. The Web 3D Service plays a central part in nearly all experiments that have been carried out. It does not only provide the means for interactive web-visualizations, but also for performing further analyses, accessing detailed feature information, and for automatic content discovery.
\nOpenStreetMap and other worldwide available datasets are used for developing a complete architecture demonstrating the scalability of 3D Spatial Data Infrastructures. Its suitability for creating 3D city models is analyzed, according to requirements set by international standards. A full virtual globe system has been developed based on OpenStreetMap including data processing, database storage, web streaming and a visualization client.
\nResults are discussed and compared to similar approaches within geo-informatics research, clarifying in which application scenarios and under which requirements the approaches in this thesis can be applied.
\n

IntroductionThe popularity of mobile communication systems has increased remarkably during the last decade and the market demand still continues to increase.As a fundamental part of these systems, antenna is one of the most important design issues in modern mobile communication units.Although there are several similar definitions, an antenna can be mainly described as a device, which transforms the electromagnetic waves in an antenna to radiating waves in an unbounded medium such as air in transmitting mode and vice versa in receiving mode.Because antennas are dependent on frequency, they are designed to operate for certain frequency bands.The rapid growth of mobile communication systems has forced to the use of novel antennas for base and mobile station applications (mobile phone, notebook computer, personal digital assistants (PDA), etc.).Earlier, mobile systems were designed to operate for one of the frequency bands of 2G (second generation) systems, which are Digital Cellular System (DCS), Personal Communications Service (PCS) and Global System for Mobile Communications (GSM) networks.Currently, many mobile communication systems use several frequency bands such as GSM 900/1800/1900 bands (890-960 MHz and 1710-1990 MHz); Universal Mobile Telecommunication Systems (UMTS) and UMTS 3G expansion bands (1900-2200 MHz and 2500-2700 MHz); and Wi-Fi (Wireless Fidelity)/Wireless Local Area Networks (WLAN) bands (2400-2500 MHz and 5100-5800 MHz) where the list of frequently used frequency bands is given in Table 1 ( Best, 2008).Conventionally, because a single antenna can not operate at all of these frequency bands of mobile communication, multiple different antennas covering these bands separately should be used.However, usage of many antennas is usually limited by the volume and cost constraints of the applications.Therefore, multiband and wideband antennas are essential to provide multifunctional operations for mobile communication.A multiband antenna in a mobile communication system can be defined as the antenna operating at distinct frequency bands, but not at the intermediate frequencies between bands.For example, a triple band antenna for GSM 900/1800/1900 bands can cover the frequency bands 890-960 MHz and 1710-1990 MHz (Ali et al., 2003); however, it does not operate properly at the frequencies such as 1200 MHz or 2500 MHz.On the other hand, a wideband antenna operates at every frequency points within a given frequency band.For example, a wideband antenna covering UMTS, extended UMTS and WLAN 2400 bands functions at every frequency points www.intechopen.com

In recent years, system-on-chip designs have migrated from fairly simple single processor and memory designs to relatively complicated systems with higher communication requirements. Network-on-chip architectures emerged as promising solutions for future system-on-chip communication architecture designs. However, the switching and routing algorithm design of network-on-chip communication architectures are still facing great challenges. To address the deficiencies of the existing routing algorithms, a new adaptive network-on-chip routing algorithm: Traffic Allocation routing algorithm is proposed in this paper. The specifics of Traffic Allocation routing as well as the simulation results and analysis are also presented. For the proposed algorithm, traffic allocation registers are added to each of the routers to keep track of communication traffic loads for the four outgoing directions. Instead of monitoring the buffer depth of the neighboring routers, the proposed Traffic Allocation routing measures traffic loads based on local computation so as to reduce extra communication overhead. Simulation of the proposed Traffic Allocation routing algorithm and three existing routing algorithms has been carried out on NIRGAM network-on-chip simulator. Simulation results illustrate that the performance of the Traffic Allocation routing algorithm matches or exceeds the performance of the existing routing algorithms.

The 3GPP proposed the specifications of “Open Service Access (OSA),” which included eight suites of open application programming interface (API) for developing telecommunication services in 1999. Instead of traditional telecommunication operators, the third-party companies can easily create a variety of new services across operators’ networks via the API without wasting time and energy on the details of telecommunication networking. There have been a few international organizations, such as 3GPP, Parlay Group, and ETSI, working on the standards. The Parlay Group proposed a suite of specifications, which was almost the same as the OSA after several revisions. Therefore, the suite can also be named OSA/Parlay. These standard organizations hope that their activities can bring great advances to mobile services and communication industry. In recent years, the web service has prevailed all over the world because its outstanding software architecture can run on any computing platform. In order to make the OSA more popular, the Parlay Group included the concept and technique of the web service and proposed the other suite of OSA specifications, Parlay X, in 2003. The APIs in the former OSA/Parlay specifications were designed base on the protocols of telecommunication networking. Instead, the APIs in the Parlay X were devised from the viewpoint of applications’ requirements. In this article, we will introduce the architecture and capabilities of the Parlay X, and compare it with the original OSA/Parlay. We also take two examples, “Stock Risk Notification System,” and “Weather Forecasting SMS System,” to explain the mechanism of the Parlay X in detail.

The explosive growth of the Internet demands higher reliability and performance than what the current networking infrastructure can provide. This dissertation explores novel architectures and protocols that provide a methodology for grouping together multiple networking elements, such as routers, gateways, and switches, to create a more reliable and performant distributed networking system. Clustering of networking elements is a novel concept that requires the invention of distributed computing protocols that facilitate efficient and robust support of networking protocols. We introduce the Raincore protocol architecture that achieves these goals by bridging the fields of computer networks and distributed systems. In designing Raincore, we paid special attention to the unique requirements from the networking environment. First, networking clusters need to scale up the networking throughput in addition to the scaling up of computing power. Second, task switching between the different services supported by a networking element has a major negative impact on performance. Third, fast fail-over time is critical for maintaining network connections in the event of failures. We discuss in depth the design of Raincore Group Communication Manager that addresses the forgoing requirements and provides group membership management and reliable multicast transport. It is based on a novel token-ring protocol. We prove that this protocol is formally correct, namely, it satisfies the set of formal specifications that defines the Group Membership problem. The creation of Raincore has already made a substantial impact both at Caltech and the academic community as well as in the industry. The first application is SNOW, a scalable web server cluster that is part of RAIN, a collaborative project between Caltech and JPL/NASA. The second application is RainWall, a commercial solution created by Rainfinity, a Caltech spin-off company, that provides the first fault-tolerant and scalable firewall cluster. These applications exhibit the fast fail-over response, low overhead, and near-linear scalability of the Raincore protocols. In addition, we studied fault-tolerant networking architectures. In particular, we considered efficient constructions of extra-stage fault-tolerant Multistage Interconnection Networks. Multistage Interconnection Networks provide a way to construct a larger switching network using smaller switching elements. We discovered an optimal family of constructions, in the sense that it requires the least number of extra components to tolerate multiple switching element failures. We prove that this is the only family of constructions that has this optimal fault-tolerance property.

Nowadays you can see everyone holding mobile phones on the street, used to be with only purely voice service till now, as the progress of the technology, function of wireless internet surfing is more and more valued. Whether video call, on-line browsing, or navigation is to provide consumer a multiple service. To fulfill most users’ request, high-speed downloading of 3G broadband system is needed. Telecom Operators start to create mass HSPA (High Speed Packet Access) system in 2009, meaning HSDPA (High Speed Downlink Packet Access) could reach 14.4Mbps and HSUPA (High Speed Uplink Packet Access) could reach 2Mbps. In order to fulfill this mass transportation, Telecom Operator not only has to upgrade the software and hardware of base stations (aka. Node B), the flow of physical circuit’s transmission also has to reach certain bandwidth. Considering investment cost and quality of service, fixed Telecom operators has take a new generation NG-SDH (Next Generation-Synchronous Digital Hierarchy). Using Ethernet to provide physical transmission of wireless internet browsing. This thesis is mainly discussing new generation Ethernet NG-SDH’s usage, while current base station using physical fiber circuit to provide transmission internet service quality. Through the result if the experiment, we will have a better reference for transmission service quality and solution when future operators planning transmission of HSPA+, 4G LTE (Long Term Evolution).

Parallel, distributed and network-based computing is a continuosly evolving field, driven by progress in microprocessor architecture and interconnection technology, as well as by the needs of computing- and data-intensive applications in science and engineering, and, more recently, in business. This field is currently undergoing a significant change, because of the development of multicore and manycore processors, GPUs, and FPGAs, which are the new building blocks of parallel architectures. At the other end of the parallel and distributed computing scenario, computational grids are far from being a mature infrastructure and are evolving toward cloud computing, to get a higher level of virtualization. The availability of programming models, algorithms and software tools capable of harnessing the processing power offered by the new technologies is a key issue to make them usable by application developers. This special issue provides a view of the efforts carried out in this direction. Barlas introduces an optimization approach for reducing data communication and load imbalance in medical image matching on Grids. Binzenhofer et al. present a distributed and scalable algorithm to monitor a p2p network. Cesario and Talia discuss the use of data mining models and services on Grid systems for analysis of large data repositories. Danelutto et al. describe a performance model for component-based applications with stream communication semantics running on Grids. Danese et al. describe a FPGA-based coprocessor to accelerate double precision floating point operations in high-performance applications. Gross and Marquardt introduce a graphical editor providing abstractions from base technology for user-friendly configuration of Ubiquitous Computing environments. The papers collected here are selected extended versions of papers presented at PDP 2007, the Fifteenth Euromicro Conference on Parallel, Distributed and Network-based Processing, held in Naples, Italy, in February 2007. The conference was organized by the Institute for High-Performance Computing and Networking (ICAR) of the Italian National Research Council (CNR) in collaboration with the Second University of Naples, the University of Naples Parthenope and the University of Naples Federico II. We thank the editors of Scalable Computing: Practice and Experience for providing us the opportunity of publishing this issue, the authors for their contributions, and the referees for their precious help in selecting good-quality papers. Pasqua D'Ambra Institute for High-Performance Computing and Networking (ICAR), CNR Naples, Italy pasqua.dambra@cnr.it Daniela di Serafino Department of Mathematics, Second University of Naples Caserta, Italy daniela.diserafino@unina2.it Mario Rosario Guarracino Institute for High-Performance Computing and Networking (ICAR), CNR Naples, Italy mario.guarracino@cnr.it Francesca Perla Department of Statistics and Mathematics for Economic Research, University of Naples Parthenope Naples, Italy francesca.perla@uniparthenope.it

Intelligent Transportation Systems (ITS) are gaining momentum among researchers. ITS encompasses several technologies, including wireless communications, sensor networks, data and voice communication, real-time driving assistant systems, etc. These states of the art technologies are expected to pave the way for a plethora of vehicular network applications. In fact, recently we have witnessed a growing interest in Vehicular Networks from both the research community and industry. Several potential applications of Vehicular Networks are envisioned such as road safety and security, traffic monitoring and driving comfort, just to mention a few. It is critical that the existence of convenience or driving comfort services do not negatively affect the performance of safety services. In essence, the dissemination of safety services or the discovery of convenience applications requires the communication among service providers and service requesters through constrained bandwidth resources. Therefore, service discovery techniques for vehicular networks must efficiently use the available common resources. In this thesis, we focus on the design of bandwidth-efficient and scalable service discovery protocols for Vehicular Networks. Three types of service discovery architectures are introduced: infrastructure-less, infrastructure-based, and hybrid architectures. Our proposed algorithms are network layer based where service discovery messages are integrated into the routing messages for a lightweight discovery. Moreover, our protocols use the channel diversity for efficient service discovery. We describe our algorithms and discuss their implementation. Finally, we present the main results of the extensive set of simulation experiments that have been used in order to evaluate their performance.