Re: [Savannah-hackers] submission of MENEHUNE-TE - savannah.gnu.org

[Jonathan Gonzalez V.]

"rahul chandrakumar gundecha" <address@hidden> writes:

Hi,

I have approved your project.  You will receive an automated e-mail
containing detailed information about the approval.

Your project was approved as without source code, this means that we
will review your CVS in a month (more or less) looking for problems.


Regards,


>  
> hi,
>
>         we are group of students doing academic project. we have not started 
> implementation as such. but we will be using GPL for our coding
> After some part of implemetation we will send it to you.
>
>         We are modifying native OSPF which is already Non-proprietary, which 
> is using Dijkstra's shortest path algorithm. We are just using it for 
> additional
> parameters..
>
> regards
> rahul.
>
> On Fri, 31 Dec 2004 Jonathan Gonzalez V. wrote :
>>address@hidden writes:
>>
>>Hi Rahul,
>>
>>I'm evaluating the project you submitted for approval in Savannah.
>>
>>You mentioned a Dijkstra algorithm, can you give us more information
>>about the algorithm and if it licensed or not?
>>
>>Can you provide us with an URL to download your source code? or if you
>>prefer, can you send the tarball to my email address (address@hidden)?
>>
>>We wish to review your source code, even if it is not functional, to
>>catch potential legal issues early.
>>
>>For example, to release your program properly under the GPL you must
>>include a copyright notice and permission-to-copy statements at
>>the beginning of every file of source code.  This is explained in
>>http://www.gnu.org/licenses/gpl-howto.html.  Our review would help catch
>>potential omissions such as these.
>>
>>Regards,
>>
>> > A package was submitted to savannah.gnu.org
>> > This mail was sent to address@hidden,
>> > address@hidden
>> >
>> >
>> > rahul c g <address@hidden> described the package as follows:
>> > License: gpl
>> > Other License:
>> > Package: MENEHUNE-TE
>> > System name: ospf-te
>> > Type: GNU
>> >
>> > Description:
>> > In our project, MENEHUNE-TE, we are
>> > extending the OSPF protocol with Traffic-Engineering metrics. Herein, we
>> > try
>> > to find an optimal path instead of shortest path as in native OSPF
>> > which will reduce the undesirable problems of packet loss and imbalance in
>> >
>> > the network.
>> > There will be some additional parameters in the Dijkstra's algorithm
>> > that we will use.
>> > The routing decision for the packet will be considered according to
>> > current load on links.
>> > We will be using C language on Linux platform for implementation. We
>> > are storing data with BerkeleyDB.
>> > Some major features of the project are-
>> > 1.  Providing a query interface to the user.
>> > 2.  Dynamic routing decisions.
>> > 3.  Constrained based routing.
>> > Maintaining database overflow and providing dynamic routing decisions
>> > will be the major obstacles in our project. Our project is concerned
>> > with TCP/IP protocol.
>> > Our coding hasn't
>>
>>
>>--
>>"Emacs the only editor which has its own church"
>
> [inbox] 
>

-- 
"Emacs the only editor which has its own church"

pgpNNjHHi5hMj.pgp
Description: PGP signature