The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The current Internet should not only support simple packet forwarding, but also be able to provide diverse network functions to compose different routing services on the communication paths for network applications. Meanwhile, the user requirements for different applications are becoming more and more diversified, it is a challenge to distinguish the differences among these requirements in order to...
Many different types of applications simultaneously execute in current data centers (DCs). To provide low cost and improved performance, each application is typically deployed in distributed DCs. Tasks of users around the world first go through Internet service providers (ISPs) which deliver data between distributed DCs and users. However, capacities and bandwidth cost of different ISPs vary. Besides,...
This paper presents an analytical model for quantifying the reactive routing overhead in Mobile Ad-hoc Networks (MANETs). The overhead is characterized as a function of network mobility and traffic load. Also, a numerical model for determining the optimal cached route Time-To-Live is derived to minimize the overhead depending on network mobility and traffic load. The final result shows the minimum...
The worst-case network throughput is an important performance metric of interconnection networks and it is of particular concern to real-time systems. The existing model for throughput analysis assumes that the router nodes will not constrain the throughput, and hence the ideal throughput of the network is determined completely by congestion in the channels/links. In many recently proposed NoCs, however,...
Network on Chip (NoC) is a sophisticated communication infrastructure that provides quality of service (QoS) guarantees for a complex Systems-on-Chip (SoC) application. Some applications demand guaranteed end-to-end latency. Mapping algorithms are used to map an application on an NoC to satisfy the bandwidth constraints and end-to-end latency requirements. The design of the mapping algorithms determines...
We have witnessed a rapid evolvement in the embedded mobile devices, such as mobile phones and vehicles, with various processing capabilities, some of which are even beyond the common computers. They constitute an unstructured distributed environment with huge computation potential. On the other hand, intermittently connected networks provide a way for delay-tolerant communication between these devices...
A beamforming-based broadcast technique is proposed here for VANETs. It is based on two key information: the direction to the destination and the beamforming angle θ. Simulations demonstrate the efficiency of our proposal in terms of probability of transmission success, ratio of implicated nodes and bandwidth gain. An analytical model is derived to calculate the forwarding transmission area. Simulation...
An optimized broadcast protocol is proposed for VANETs. It is based on two key information: the direction to the destination and the beamforming angle θ. The efficiency of this technique is demonstrated in terms of packet delivery, bandwidth gain and probability of transmission success. An analytical model is developed to calculate the transmission area. This model allows capturing the propagation...
There has been a vast amount of work to develop programming models that provide good performance across machine architectures, are easy to use, and have predictable performance. Similarly, the design and optimization of architectures to achieve optimal performance for an application class remains a challenging task. Accurate cost modeling is essential for both application development and system design...
Configuring a large number of routers and network devices to achieve quality of service (QoS) goals is a challenging task. In a differentiated services (DiffServ) environment, traffic flows are assigned specific classes of service, and service level agreements (SLA) are enforced at routers within each domain. We present a model for QoS configurations that facilitates efficient property-based verification...
In Optical Burst Switching Network, contention is one of the challenging problems. Contention occurs when more than one burst demand for same output wavelength channel in same time. The deflection routing, fiber delay line (FDL) and wavelength conversion are the methods used to resolve contention in OBS Networks. With deflection routing, contending bursts in send in another route rather than primary...
In this paper the primary group with two Poisson traffics is considered whereupon the rejected calls from one of them are directed to the alternative groups and served with changed serving intensity. The generating function technique is used for the analytical solving model with secondary and ternary groups. The obtained analytically solutions essentially reduce constraint concerning the equation...
Configuring routers and network devices to achieve quality of service (QoS) goals is a challenging task. In a DiffServ environment, traffic flows are assigned specific classes of service, and service level agreements (SLA) are enforced at routers within the domain. We present a model for QoS policy configurations that facilitates efficient property-based verification. Network configuration is given...
Mobile Adhoc Network (MANET) is a collection of mobile nodes with dynamic topology. Such networks are of interest because they do not require any prior investment in fixed infrastructure. Instead, the network nodes agree to relay each other's packets and hence act as routers and automatically form their own cooperative infrastructure. The primary responsibility of a medium access control (MAC) protocol...
The paper presents the Performance Analysis of Manhattan Street Network (MSN). Improvement of performance at the destination node by applying different buffering capacities at the routers is demonstrated. The results using NS2 simulator are produced. It can be concluded that the congestion and the packet drops can be reduced at the link node by appropriate size of buffer at the link node.
Anonymous routing algorithm determines the performance and security of an anonymous communication system directly, which are two conflicting considerable factors for the practicality of the whole system. Most of existing anonymous routing algorithms care little about the tradeoff between performance and anonymity. Some algorithms aim to achieve better performance, while others aim to acquire higher...
This paper proposes a sub-domain hybrid P2P network model, and gives a detailed analysis about the design idea of the model. On the one hand, the model makes full use of the advantages of supporting fuzzy queries in the unstructured network. On the other hand, it also maintains efficient in resource locating in structured P2P network. The nodes are gathered into a domain according to approaching of...
Multipath inter-domain routing can solve many technical flaws which have been exposed in BGP, but the market-driven factors have more direct relationship with its deployment. In order to analyze impact of these market-driven elements, this paper established an optimization model for Internet service provider (ISP) revenues based on user's utility function. Then, the solution using Lagrange multiplier...
This paper is a quantities analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for routing of packets from source to destination. Some of them promised that they will route accurately but it seems with increased workload. Some of them promised that they...
This paper presents a support for the development of distributed virtual environments (DVEs) on P2P architectures. A hierarchical overlay is defined by pairing each peer with a weight which is proportional to its networking bandwidth. Peers characterized by higher weights are assigned a greater workload, in terms of connections with other peers and of number of passive objects they manage, and can...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.