نتایج جستجو برای: alternate load path method

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

2007
Shreyas Prasad André Schumacher Harri Haanpää Pekka Orponen

We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, starting with an approximate optimisation method that guarantees a provable congestion performance bound, and then designing a distributed implementation by modifying the DSR protocol. In this paper, the performance of the resulting...

2014
Song Guo Muqing Wu Qian Hu

In dynamic routing construction of ICN, traditional CCN routing mechanism can improve the diversity and reliability of data forwarding. But it also brings problems in retrieval redundancy, taking some load to the network. SoCCeR strategy uses ant colony algorithm to finish single-path routing of CCN in distribution, while it has defects in ant agency control and convergence feature. Therefore, ...

Journal: :journal of optimization in industrial engineering 2010
moharam habib nezhad korayem mehdi bamdad ashkan akbareh

planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. the problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...

2000
Marc Pearlman Zygmunt Haas Peter Sholander Siamak S. Tabrizi

This research used a custom event-driven network simulator to evaluate Alternate Path Routing’s (APR’s) behavior in Mobile Ad Hoc Networks (MANETs). In particular, it investigated how much route-diversity is inherent in typical ad-hoc networks, and the ability of a globally reactive routing-protocol (such as the Zone Routing Protocol) to capture and utilize that route diversity. It then explore...

2011
Yogesh Chaba R. B. Patel Rajesh Gargi

A mobile ad-hoc network (MANET) is a wireless network in which nodes, in the absence of fixed access points, communicate via single or multi-hop paths. Each node in a MANET should thus be able to perform necessary routing functions, and a MANET routing protocol should be able to adapt fast and effectively to sudden changes in network layout. Multipath routing allows the establishment of multipl...

2003
Kerr-Jia Lu Sridhar Kota

The performance of many mechanical systems is directly related to the geometric shapes of their components, such as aircraft wings and antenna reflectors. While the shapes of these components are mostly fixed, incorporating shape morphing into these systems can increase the flexibility and enhance the performance. A synthesis approach for shape morphing compliant mechanism is presented in this ...

2011
Renpeng Tan Shuoyu Wang Yinlai Jiang Kenji Ishida Masakatsu G. Fujie Masanori Nagano M. NAGANO

In previous studies, an omni-directional walker was developed for walking rehabilitation. Walking training programs are stored in the walker so that rehabilitation can be carried out without a physical therapist. However, the walker sometimes strays from the predefined path because of center-of-gravity shifts and load changes. It is necessary for the walker to precisely follow the paths defined...

Journal: :Plant physiology 1978
A Theologis G G Laties

The respiration of fresh potato (Solanum tuberosum, var. Russet Burbank) slices is predominantly cyanide-sensitive whether in the presence or absence of uncoupler. By contrast, the wound-induced respiration which develops in thin slices with aging is cyanide-resistant, and in the presence of cyanide, sensitive to chlorobenzhydroxamic acid, a selective inhibitor of the cyanide-resistant respirat...

Journal: :Computer Networks 2000
Claudio Casetti Renato Lo Cigno Marco Mellia

In this paper, we present two diierent path ordering algorithms whose aim is balancing the load among network links when used in conjunction with static routing algorithms. Both algorithms have the same aim, but use diierent heuristics to obtain it. A new formalism based on set theory is deened in order to allow a formal description of the two algorithms. The rst selection criterion we deene tr...

2002
Balázs Szviatovszki Áron Szentesi Alpár Jüttner

In this piece of work, we compare the effectiveness of distributed restoration path computation methods that use head-end precomputation and do not use backup path sharing. Our aim is to provide statistics on primary and secondary path lengths of simple disjoint path computation methods in real-world network topologies. Moreover, we propose a path computation method which can be used when paths...

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

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