نتایج جستجو برای: telecommunication network routing

تعداد نتایج: 704940  

2009
Ömer Korçak

ROUTING AND NETWORK MOBILITY MANAGEMENT IN NEXT GENERATION SATELLITE NETWORKS Satellite networks are an attractive option to provide broadband telecommunication services to globally scattered users, due to their extensive geographic coverage, high bandwidth availability, inherent broadcast capabilities, etc. Satellites rotating in geostationary orbit (GEO) are very well suited for broadcast ser...

2003
David Soen-Mun Chan Khim Shiong Chua Christopher Leckie Ajeet Parhar

ODL for visualising large network topologies. The main contribution of our algorithm is to simplify the layout problem by separating the nodes in the network into multiple hierarchical layers based on the outdegree of each node. Our algorithm is designed to exploit the underlying structure of power-law topologies, which occur in a wide variety of practical network applications. However, the use...

Journal: :Comp. Opt. and Appl. 2009
Claude Lemaréchal Adam Ouorou Georgios Petrou

To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest paths problems) and of a smooth function (coming from the congestion). Key-words: Convex optimization, routing, multico...

Journal: :journal of advances in computer engineering and technology 2015
forouz ghaffarizadeh ahmad khademzadeh

mobile ad hoc networks (manet) are constructed by mobile nodes without access point. since manet has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. the olsr protocol is an optimization of the classical link state algorithm. olsr introduces an interesting concept, the multipoint r...

Journal: :journal of advances in computer research 2014
maryam javaherian abolfazl t.haghighat

nowadays, wireless sensor network has been of interest to investigators and the greatest challenge in this part is the limited energy of sensors. sensors usually are in the harsh environments and transit in these environments is hard and impossible and moreover the nodes use non- replaceable batteries. because of this, saving energy is very important. in this paper we tried to decrease hard and...

Journal: :journal of sciences, islamic republic of iran 2013
a.a. baradaran

in this paper, an algorithm , based on genetics and auxiliary nodes, to reduce energy consumption in wireless sensor networks has been presented. in this research, by considering some parameters as energy and distance, a target function has been created, which is more optimum comparing to other methods. in this research cluster head is selected by genetic algorithm. in rawsn algorithm a new tec...

2007
SHAOYAN ZHANG RUI ZHANG SETHURAMAN MUTHURAMAN JIANMIN JIANG

The growing number of unauthorized activities and various trends of networking technologies in telecommunication network have added heavy burdens to telecommunication performance management (PM) system. One-class-support vector machine (OCSVM) is introduced in this paper, to automatically detect network anomalies. Real telecommunication performance data are employed in this paper to investigate...

Recently, wireless sensor network (WSN) is the popular scope of research. It uses too many applications such as military and non-military. WSN is a base of the Internet of Things (IoT), pervasive computing. It consists of many nodes which are deployed in a specific filed for sense and forward data to the destination node. Routing in WSN is a very important issue because of the limitation of the...

Journal: :Networks 2009
Andreas Bley

In this paper, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph D = (V,A) and a set K of directed commodities, an USPR is a set of flow paths Φ(s,t), (s, t) ∈ K, such that there exists a metric λ = (λa) ∈ Z+ with respect to which each Φ(s,t) is the unique shortest ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید