Search

Miriam C Kadansky

from Westford, MA
Age ~66
Get Report
Also known as:
Miriam Claire Kadansky
Phone and address:
8 Brookside Rd, Graniteville, MA 01886
(978) 392-1414
Related to:
David H Kadansky, 71
Connected to:
Vijaya Kadapa, 51Chris Kadar, 42Denise C Kadar, 72Dwight S Kadar, 77Ilona J Kadar, 48Linda J Kadar, 68Michael J Kadar, 45Ofer Kadar, 51Steve Kadar, 124Meena S Kadaramandalige, 53

Miriam Kadansky Phones & Addresses

  • 8 Brookside Rd, Westford, MA 01886 (978) 392-1414
  • 12 Brookside Rd #19, Westford, MA 01886
  • 165 Westview Dr, Westford, MA 01886
  • 15 Highland St, Concord, MA 01742
  • Bellingham, MA

Resumes

Resumes

Miriam Kadansky Photo 1

Software Engineer

View page
Location:
Westford, MA
Industry:
Industrial Automation
Work:
Assembly Guidance Systems
Software Engineer
Aligned Vision
Software Engineer
Sun Microsystems 2005 - 2009
People and Program and Project Manager
Sun Microsystems 1997 - 2005
Senior Staff Engineer
Xyplex 1988 - 1997
Software Engineer, Manager
Education:
Simmons Graduate School of Library and Information Science 1979 - 2006
Masters, Information Science Harvard University 1976 - 1979
Bachelors, Bachelor of Arts, Mathematics
Miriam Kadansky Photo 2

At Assembly Guidance Systems

View page
Position:
Software Engineer at Assembly Guidance Systems
Location:
Greater Boston Area
Industry:
Computer Software
Work:
Assembly Guidance Systems since Jul 2010
Software Engineer
Sun Microsystems Laboratories 2005 - 2009
People/Program/Project Manager
Sun Microsystems Laboratories 1997 - 2005
Senior Staff Engineer
Xyplex, Inc. 1988 - 1997
Software Engineer, Manager
Cambex 1986 - 1988
Software Engineer (Jupiter Technology)
Education:
Simmons Graduate School of Library and Information Science 2000 - 2006
Master of Library and Information Science Harvard University 1976 - 1979
BA, cum laude, Mathematics
Skills:
Product Development
Distributed Systems
Management
Java
Architecture
People Development
Cloud Computing
C
Result Oriented
Leadership
Research
Software Engineering

Publications

Us Patents

Method And Apparatus For Routing And Congestion Control In Multicast Networks

View page
US Patent:
6427166, Jul 30, 2002
Filed:
Sep 22, 2000
Appl. No.:
09/668432
Inventors:
Stephen A. Hurst - Nashua NH
Joseph Wesley - Quincy MA
Stephen R. Hanna - Bedford MA
Miriam C. Kadansky - Westford MA
Philip M. Rosenzweig - Acton MA
Assignee:
Sun Microsystems, Incorporated - Palo Alto CA
International Classification:
G06F 1300
US Classification:
709220, 709224, 709235, 709238, 370254
Abstract:
An embodiment consistent with the present invention includes a method and apparatus for distributing multicast data. The method may be performed by a data processor and comprises the steps of forming a multicast repair tree including a sender, a plurality of heads, and a plurality of receivers, wherein at least one head is associated with the sender and at least one receiver is associated with the head; sending, by a sender to the plurality of heads and the plurality of receivers, a plurality of multicast messages at a data rate; receiving, by the sender from one of the plurality of heads, a congestion status associated with a receiver of the head; and slowing the data rate, by the sender, in accordance with the congestion status.

Multiple Ack Windows Providing Congestion Control In Reliable Multicast Protocol

View page
US Patent:
6505253, Jan 7, 2003
Filed:
Jun 18, 1999
Appl. No.:
09/336659
Inventors:
Dah Ming Chiu - Acton MA
Miriam C. Kadansky - Westford MA
Stephen R. Hanna - Bedford MA
Stephen A. Hurst - Nashua NH
Joseph S. Wesley - Quincy MA
Philip M. Rosenzweig - Acton MA
Radia J. Perlman - Acton MA
Assignee:
Sun Microsystems - Burlington MA
International Classification:
G06F 1300
US Classification:
709235, 709224, 709232, 709238, 370229, 370254
Abstract:
A multicast repair tree is established, the repair tree having one sender station and a plurality of repair head stations. A repair head station has an affiliated group of member stations. A repair head station retransmits a lost message to its affiliated group of member stations upon receipt from a member station of a NACK message indicating that the selected message was not received. Acknowledgment windows (ACK windows) are established in a member station for transmission of ACK or NACK message by the member station. A number of messages transmitted by the sender station during a transmission window is established. Also a same size of ACK window is established in the receiving stations, with a slot in the ACK window corresponding to each message transmitted by the repair head station. Each receiving station is assigned a slot in the ACK window during which time that receiving station transmits its ACK or NACK messages. Thus the ACK window slots assigned to receiver stations for transmission of ACK/NACK windows are staggered so that different receiver stations transmit their ACKNACK messages at different times.

Dynamic Optimization For Receivers Using Distance Between A Repair Head And A Member Station In A Repair Group For Receivers Having A Closely Knit Topological Arrangement To Locate Repair Heads Near The Member Stations Which They Serve In Tree Based Repair In Reliable Multicast Protocol

View page
US Patent:
6507562, Jan 14, 2003
Filed:
Jun 18, 1999
Appl. No.:
09/336660
Inventors:
Miriam C. Kadansky - Westford MA
Dah Ming Chiu - Acton MA
Stephen R. Hanna - Bedford MA
Stephen A. Hurst - Nashua NH
Joseph S. Wesley - Quincy MA
Philip M. Rosenzweig - Acton MA
Radia J. Perlman - Acton MA
Assignee:
Sun Microsystems, Inc. - Burlington MA
International Classification:
G06F 1100
US Classification:
370216, 370254, 370390, 370408, 709238, 3408252
Abstract:
Receiver stations located close together in a computer network dynamically form a multicast repair tree by a plurality of receiver stations choosing a repair head station from among the closely located receiver stations. A receiver station calculates its distance from a repair head station by subtracting the decremented TTL value read from the IP header from the initial value of the TTL parameter carried in field TTL SCOPE of HELLO messages, transmitted by repair head stations. Using a criteria that a closer repair head station is a more optimum repair head station, receiver stations listen to each received HELLO message, calculate the distance to the repair head station, and reaffiliate with the closest repair head station.

Detecting Congestion By Comparing Successive Loss Of Packets In Windows To Provide Congestion Control In Reliable Multicast Protocol

View page
US Patent:
6526022, Feb 25, 2003
Filed:
Jun 18, 1999
Appl. No.:
09/336670
Inventors:
Dah Ming Chiu - Acton MA
Miriam C. Kadansky - Westford MA
Stephen R. Hanna - Bedford MA
Stephen A. Hurst - Nashua NH
Joseph S. Wesley - Quincy MA
Philip M. Rosenzweig - Acton MA
Radia J. Perlman - Acton MA
Assignee:
Sun Microsystems - Burlington MA
International Classification:
G01R 3108
US Classification:
370229, 370252
Abstract:
A method of detecting congestion in a computer network uses a receiving station which determines a first number of messages missing in a first acknowledgment window. The station then determines a second number of messages missing in a subsequent acknowledgement window. The station then measures congestion on the network in response to an increase in the number of missing messages as indicated by the first number of missing messages in the first acknowledgement window and the second number of missing messages in the second acknowledgement window.

Use Of Beacon Message In A Network For Classifying And Discarding Messages

View page
US Patent:
6658004, Dec 2, 2003
Filed:
Dec 28, 1999
Appl. No.:
09/473402
Inventors:
Miriam C. Kadansky - Westford MA
Dah Ming Chiu - Acton MA
Stephen R. Hanna - Bedford MA
Stephen A. Hurst - Nashua NH
Radia J. Perlman - Acton MA
Joseph S. Wesley - Quincy MA
Assignee:
Sun Microsystems, Inc. - Palo Alto CA
International Classification:
H04L 1228
US Classification:
370394, 709203
Abstract:
A method and apparatus for identifying a data message that is eligible for discard. A beacon node periodically transmits a beacon message to a plurality of client nodes communicatively coupled via a network. Each beacon message includes a beacon sequence number and preferably, the beacon sequence numbers are authenticated by the beacon, node. The client nodes, upon receipt of the beacon messages, verify the authenticity of the respective received beacon sequence numbers and generate a local sequence number derived from the received beacon sequence number. When one client in the session has data to transmit to another client in the session, the sending client assembles a data message and inserts its local sequence number in the data message prior to transmission of the data message to the other client nodes in the session. The client nodes receiving the data message discard the data message if their respective local sequence number at the time of receipt of the data message exceeds the local sequence number inserted in the data message by a predetermined value. In one embodiment, the beacon node generates sequence numbers at a periodic interval P but only transmits 1 out of every m beacon sequence numbers to the client nodes in the session.

Method And System For Measuring Reception Characteristics In A Multicast Data Distribution Group

View page
US Patent:
6693907, Feb 17, 2004
Filed:
Apr 11, 2000
Appl. No.:
09/546946
Inventors:
Joseph S. Wesley - Quincy MA
Dah Ming Chiu - Acton MA
Miriam C. Kadansky - Westford MA
Joseph E. Provino - Cambridge MA
Stephen R. Hanna - Bedford MA
Assignee:
Sun Microsystems, Inc. - Palo Alto CA
International Classification:
H04L 1228
US Classification:
370390, 370400, 370408
Abstract:
A method and system for accurately measuring the reception characteristics of receivers in a multicast data distribution group having a sending node and a plurality of receivers. The multicast group is organized as a repair tree in which selected nodes of the multicast group comprise repair nodes for downstream receivers. Multicast data packets transmitted by the repair nodes include a retransmission count field in addition to the multicast packet header information, a session identifier, a packet sequence number and payload data. The retransmission count provides an indication of the number of times the respective packet has been retransmitted in response to a repair request. The receivers include an original packet counter and a retransmission count counter for each multicast session. Each receiver increments the original packet counter upon receipt of a packet that has not been previously received. Each receiver adds the value contained in the retransmission count field of a received packet to the retransmission count counter upon receipt of a retransmitted multicast packet that corresponds to a packet identified as a missing packet by the respective receiver.

Method And Apparatus For Using Ranking To Select Repair Nodes In Formation Of A Dynamic Tree For Multicast Repair

View page
US Patent:
6757843, Jun 29, 2004
Filed:
Oct 26, 2000
Appl. No.:
09/698490
Inventors:
Joseph Wesley - Quincy MA
Stephen A. Hurst - Nashua NH
Miriam C. Kadansky - Westford MA
Stephen R. Hanna - Bedford MA
Philip M. Rosenzweig - Acton MA
Dah Ming Chiu - Acton MA
Radia J. Perlman - Acton MA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 1100
US Classification:
714 18
Abstract:
An embodiment consistent with the present invention includes a method and apparatus for forming a multicast repair tree. The methods perform by a data processor and comprises the steps of determining, for each of a plurality of potential heads in a multicast group, a ranking value associated with the potential head; advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the head having the highest ranking value, thereby forming a group of which the potential receiver,is a member and the potential head is the head. The ranking values may include âableâ, âunableâ, âwillingâ, and âreluctant. â The ranking value of a potential head determines in accordance with a static or a dynamic configuration. Ranking values determine dynamically based on ranges of system resource levels such as memory and available processor resources.

Method And Apparatus For Facilitating Efficient Flow Control For Multicast Transmissions

View page
US Patent:
6850488, Feb 1, 2005
Filed:
Apr 14, 2000
Appl. No.:
09/549805
Inventors:
Joseph S. Wesley - Quincy MA, US
Dah Ming Chiu - Acton MA, US
Miriam C. Kadansky - Westford MA, US
Joseph E. Provino - Cambridge MA, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
H04L 1200
H04L 1228
G08C 2502
US Classification:
370230, 370236, 370252
Abstract:
One embodiment of the present invention provides a system that facilitates efficient flow control for data transmissions between a sender and a plurality of receivers. The system operates by sending a stream of packets from the sender to the plurality of receivers, wherein the packets include information specifying a sampling window for the stream of packets. The sender subsequently receives feedback information from the plurality of receivers, wherein a receiver sends feedback information to the sender if a congestion condition occurs at the receiver while receiving packets within the sampling window. In response to the feedback information, the sender adjusts a rate of transmission for the stream of packets. In one embodiment of the present invention, the feedback information from the receivers is aggregated at intermediate nodes prior to reaching the sender in order to eliminate redundant feedback information. In one embodiment of the present invention, the sender communicates with the plurality of receivers through a tree of nodes, wherein the sender is a root node of the tree.
Control profile
Miriam C Kadansky from Westford, MA, age ~66 Get Report