Software :: Change The Algorithm Of A Node In Ns2?
Jan 3, 2011
there are 3 nodes..A,B and C. Node A wants to send information to Node B but it does so by sending it to Node C first which then sends to B. And similarly Node B sends to A. In this simultaneously C doesn't send to both A and B. This is the in built algorithm..but i want to change it to: A and B send their packets to C and C sends both these packets to A and B..by ORing... In the receiver side...node A can receive the wanted packet and also B. Where do i change the algorithm?
I want to change linux scheduling algorithm for some of my processes but when I click on processes in ksysguard and click renice project, all of the processes use normal level cpu scheduling. Why is it such a thing and there is no priority?
OpenSuSE 11.3 (but this is not likely a distro specific issue)Kernel 2.6.34.7, but likely applies to a number of previousAm close to launching a more extensive webpage describing in detail why and how this configuration is important, but I'm missing up to date information on how to persist the config. By default, changing the TCP Congestion Control algorithm only modifies the current system session. Docs I've read recommend that the command resetting the algorithm be written to Code:/etc/rc.d/rc.dAm confused with all the different config files, but I suspect either an existing file should be modified or an additional file should be modified in
I want to change my servers node name which is the output of "#uname -n"Server is CentOS 5I searched but couldn't find. There was some search results about /etc/nodename but I don't have a file at that path. Also some said uname -S which doesn't work.
I've set up DRBD on 2 machines, 1 of them is the master, another is the slave.
After each bootup, I need to run the following on the master machine:
Code: drbdadm -- --overwrite-data-of-peer primary all
Do we need to specify which machine should be the primary node every time? Is there any method to make the machine "know" it's itself the primary node?
I have created a simple menu driven script for our Operations to take care of the basic monitoring and managing of our production application from the back-end. Now, the script when tested in UAT environment was fine, but when deployed to production it kind of behaved oddly.hen the Operator chooses an option from the menu he is given the output and at the end is prompted to return to the main menu by using ctrl+c. In production, this return does not occur for some strange reason and the program just sits there.The session becomes unresponsive after that and I'm forced to terminated it by closing the PuTTY.I tried enabling the debug mode too (set -x) and still was not able to find any useful hints/trails as to why.
I am familiar with windows 2008 cluster servers, and I just started testing with centos cluster. I am creating a simple 2-node cluster, for a simple ping test.
So far, I can ping a virtual ip, and manually relocate it between the nodes, but I didn't figure out, how to do this automatically. So this is my question: How can I setup the cluster, to it automatically failover the a service to another node case one node fails?
I am working with NS-2, I am facing a situation where I need to re align the transmission range of a particular node. Can I do this by modifying the protocol's source code? I should not change the default value from 250, only few nodes who satisfy a particular criterion should be reset to some other range like 200 or 300. How can I do this?
I don't have much experience in clustering. And I'm deploying a cluster system on CentOS.But I don't know how long a node failover and another node take over those resouces to continue running service is good, fast or slow? 1s, 10s or
I have a copy of the MD5 algorithm and I'm taking a look at the source. It's pretty interesting but there are a few things that I'm curious about and I was wondering if anyone a bit more intuitive than I could help me out.The function declarations in the MD5 files are a bit unfamiliar to me. There is a macro used called PROTO_LIST, which I'm still not sure as to what this thing is doing exactly, but it's littered everywhere throughout the source.The signature here isn't too unfamiliar to me with the exception of the position of the PROTO_LIST macro. So here is a function with an unnamed argument of type MD5_CTX*.To me, this resembles an initializer list found in C++ with constructors but I certainly don't think that is the case here. So my questions about this are (1) how is this legal code in C and (2) what functionality has the PROTO_LIST macro provided for the function?
is linux kernel is priority preemptive kernel?if it is. where it is using round robin scheduling algorithm?when processes are scheduled for the processor process will be allocated as which sechudling alogorithm?
I have a timer thread, and when it expires, it sets a flag. The only problem is, if any higher priority thread comes in between, then the timer is not expired in real time.Thus i want to set a highest priority to my thread. Now, i know 2 algos, which can make my thread in real time are: SCHED_FIFO and SCHED_RR.
So, here are my queries: 1) Which scheduling algo is best suited for this purpose? 2) Is it guaranted to work in real time if i use that algo (you suggest in 1) and set the max_priority by getting the maximum settable priority for that particular algorithm using, int sched_get_priority_max(int policy);
I've got a bit of an obscure question for you to test your brains a wee bit. I'm trying to implement a search program to find areas of high density in a binary string.
Where density is the number of 1's / number of digits with a maximum number of digits being the current number in a buffer (in this example 50). So for the example the density for the whole buffer is 15/50. But the density of Buffer[14..20]=[1110001]=4/7. So if looking for areas of density = 1/3 it would find the longest sequences of density over 1/3.So in the example. Buffer[4..9]=[100101]=3/6=1/2 which is above 1/3 but it is within the Buffer[4..48]=[100101000011100010000001000100100001001011001]=15/45=1/3
I have an algorithm guys called "Self Configurable Diagnosis Algorithm" but i don't have program for this.help me regarding that program and which type of Tcl script will be better suitable for that.
I have printer whhich work perfectly on ubuntu desktop I shared it into network and trying to print from Mac and I'm getting the following error: "SpliX Compression algorithm 0x0 does not exist" Printer - Samsung SCX-4200
I need to simulate dijsktra's algorithm using network animator of ns2. how to write a tcl script for my code. This tcl script runs the dijsktra code and simulates its running on network animator.
i am new to ns2, i want to implement leach algorithm(MIT uAMPS) but i am unable to know how to install ns-2.1b5 version for it.but i successfully installed ns2.29 in fedora14.
otherwise please intimate what linux flavour will be suitable for ns-2.1b5
AStar works on the basis of straight lines, AFAIK. In my case, we have geocoordinates and I can get the straight line distance between the waypoints. But I am wondering how approximate will the route calculated on this basis be? The actual distance "by road", which actually matters can be different.
Example. Assuming A and B are on the same plane, and will be equidistant from the goal point, if we consider a straight line between A and the goal point and, B and the goal point. The distance "by road" between A and the goal point may be greater or lesser than B. But because the AStar works on the basis of straight lines, it will return both the routes as the shortest. If yes, then which algo should be considered , if we want the results on the basis of actual distance in Km/m?
i try to understand this algorithm but i cann't. [URL] I encounter problem understand the algorithm of fixed base windowing exponentiation algorithm ? What is fixed base in the first place ? How this algorithm works ?
upgrading my notebook from Slackware 13.0 to 13.1. There are always some tricky things to wrap around when such upgrade times come, but now I think I caught a bug in mkinitrd, if I'm not wrong. mkinitd doesn't return when I run:
[code]...
After some debugging, I found that the routine copy-libs() is stuck in an infinite loop, because the statement "while [ "$COUNT" != "0" ]; do" does hold always (that is, COUNT never reaches zero). This, by its side, happens because the set of libs whose dependencies should be checked against are regenerated integrally after each step, and the algorithm doesn't converge. I could fix the problem adding some code, which removes the libraries found in the iteration "i-1" from the list of files found in the iteration "i". A patch in provided below. This done, I could build my first initrd image for Slack 13.1 and put it to run with kernel 2.6.33.4.
I read that passwd -S spits out informationabout a user's password including the encryption algorithm used to encrypt the password in /etc/shadow. I ran the command but nothing about the algorithm is returned. Is this a quirk in openSUSE?On another note, I've determined through other means that I've selected blowfishryption as evidenced by the $2blah$2blahblah format of the /etc/shadow entry. However, if I look at /etc/default/passwd it lists CRYPT=md5. If I'm using blowfish why would that variable be set to md5. onversely, if it is set to md5 why is the blowfish algorithm being invoked?
The system I am working on is a xdsl board running Linux kernel 2.6 and receiving dhcp address from a Microsoft XP PC. when looking through the dhclient.leases file I can see there's something wrong with renew time and stuff.strange calculation. as far as you know is this normal? You may find below the dhclient.lease file.
