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.
Topology optimization of P2P overlays has become an increasingly important issue in recent years. P2P systems today have an increased number of legal applications, but they still fail to meet two important requirements crucial for many such applications and for Internet providers: making efficient use of Wide-Area network resources and providing a fast response to queries by reducing routing stretch...
The performance of TCP-based applications depends on the selection of queue management mechanism in network routers and how well its control decisions are made. Fast Congestion Notification (FN) mechanism enables the two control decisions, packet admissions and congestion control directing, to be made together. This permits sending congestion avoidance notification as early as required, even if the...
In this paper, we propose L3 handover scheme using SIP messages to minimize handover latency and packet loss in a MN with single interface. Packet loss and handover latency arise from L2/L3 association delay and IP configuration delay when the MN transfers internet connectivity from the serving access router to the target access router using legacy terminal mobility mechanisms. Therefore, seamless...
A terminal connected to a router has a private IP address. When this terminal sends a data packet to the service system via the router, the router will change the private IP to a public IP, then tries to send the data packet to the server. The service system knows only the router's public IP as the destination address. So the response packet is delivered to the router, and the router cannot deliver...
This work presents a study of RTP multiplexing schemes, which are compared with the normal use of RTP, in terms of ITU R-factor quality estimator. The bandwidth saving of the different schemes is studied, and some tests with VoIP traffic are carried out in order to compare R-factor using three different router buffer policies. Network delays are added using an adequate statistical distribution. The...
Although IP multicast techniques were proposed a long time ago and despite of their advantages, they are still not widely deployed due to the absence of multicast support in some routers/domains and inter-domain management issues. On the other hand, in the most of recent internet applications, where the average consumed bandwidth is measured by hundreds of Kbits per second and where the support of...
We describe RFC, a new capability that minimizes customer outages during software and hardware upgrades in ISP networks. RFC is being used by a large Tier-1 ISP to upgrade access routers supporting thousands of customers.
We propose a MILP based design model for energy reduction in IP over dynamic optical networks. By virtual topology reconfiguration, it can dynamically switch off unnecessary networking equipments, and reduce the power caused by over-provision. Simulation results indicate that the proposed design can significantly improve network energy performance.
With the advent of mobile devices, the internet now undertook a huge and unexpected explosion of growth. The wireless mobile internet gives users access to the internet services while they are on the move. This mobility has been supported through the Internet Protocol known as Mobile IP. Mobile IP allows users with mobile devices to have continuous network connectivity to the internet without changing...
QoS Routing Algorithm is a routing algorithm for finding the shortest path that satisfies the QoS requirements of the end users. While finding the shortest path this uses some of improved ideas for effectively finding the shortest path with required QoS measures. Exactly the QoS routing algorithm is a kind of multi constrained routing algorithm where more than one link components are taken into considerations...
In order to design the congestion control scheme in the routers, an Active Queue Management (AQM) is proposed. This is used to control congestion at the router, where packets are dropped before queue becomes full. A new framework of AQM, namely NEWQUE with Per-flow Scheduling (PerNEWQUE) active queue management algorithm supporting explicit congestion notification (ECN), is proposed by extending scheduling...
In the case of congestion the competition of flows for obtaining network resources increases and since the network resources are shared between different flows, the fair allocation of them becomes a crucial issue. In this work, we propose a fair active queue management (AQM) mechanism based on a well-known economic model called supply and demand. AQM is an effective router-based approach for avoiding...
IEEE 802.16 mesh mode defines centralized and distributed scheduling schemes for transmitting external and internal packet respectively. These schemes are independently executed for allocating minislots to each data subframe. Deploying the Combined Distributed and Centralized scheduling (CDC) can be more flexible to allocate minislots. In this paper, we propose a collision free slot allocation algorithm...
Ever increasing demand for more bandwidth over the Internet has lead to the development of many new technologies and architectures. Among these, Hybrid of Wireless and Optical networks have become increasingly important because of their “mobility” and “flexibility” in the wireless part and “robustness” and “high capacity”...
This paper begins with the uplink bottleneck problem which is common in campus network, relatively analyzes existed solutions of multiple uplinks, and passes an opinion of our own based on that. In order to utilize network resources more fully, and provide a good online working, studying, entertaining environment to the teachers and students, without adjusting the original network structure, we proposed...
Wireless Mesh Networks (WMNs) have emerged as an important technology in building next generation fixed wireless broadband networks that provide low cost Internet access for fixed and mobile users. An orthogonal evolution in computer networking has been the rise of Peer-to-Peer (P2P) applications such as P2P file sharing. It is of interest to enable effective P2P file sharing in this type of networks...
Numerous studies based on complex measurement platforms have been carried out for over ten years now in order to discover the Internet topology on domain level. It turns out that this topology exhibits certain invariant properties such as a distribution of node degree. This distribution follows a power law. Moreover, the revealed topology is hierarchical. The hierarchy is caused by commercial contracts...
A managed wireless mesh for infrastructure-level, stable regional mesh network has been studied. NerveNet, which we have been proposing, is a concept of future regional platform network that covers local regions and provides various context-aware services with the shared use of sensors and actuators. The managed wireless mesh developed for materializing NerveNet features auto-configuration of multiple,...
Path splicing is a proposed routing architecture for the Internet in which end-hosts (and intermediate routers) are empowered to change the paths their traffic uses by modifying a number of bits in the packet headers. These bits allow intermediate routers to choose alternate paths from the shortest one. To that end, this paper exposes SKWeak (Selective K Weakest links) attacks that exploit the adaptive...
Most of today's high capacity switches and Internet routers do not provide performance guarantees. This is attributed to their underlaying interconnection topology (i.e. the crossbar) and/or to their impractically complex scheduling algorithms. This paper derives a study for a Partially Buffered Crossbar (PBC) switch to practically provide throughput and fairness guarantees. We show how a PBC switch...
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.